./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/nr3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/nr3.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 4885a4fffd0288753086daaa59bdb12816a7be62636dc49311bbb97ad277d866 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 16:58:05,655 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 16:58:05,711 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 16:58:05,716 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 16:58:05,718 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 16:58:05,735 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 16:58:05,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 16:58:05,736 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 16:58:05,736 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 16:58:05,737 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 16:58:05,737 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 16:58:05,738 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 16:58:05,738 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 16:58:05,738 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 16:58:05,738 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 16:58:05,738 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 16:58:05,738 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 16:58:05,738 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 16:58:05,738 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 16:58:05,739 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 16:58:05,739 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 16:58:05,739 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 16:58:05,739 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 16:58:05,739 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 16:58:05,739 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 16:58:05,739 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 16:58:05,739 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 16:58:05,739 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 16:58:05,739 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 16:58:05,739 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 16:58:05,740 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 16:58:05,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 16:58:05,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 16:58:05,740 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 16:58:05,740 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 16:58:05,740 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 16:58:05,740 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 16:58:05,741 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 16:58:05,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 16:58:05,741 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 16:58:05,741 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 16:58:05,741 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 16:58:05,741 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 16:58:05,741 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-jdk21/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 -> 4885a4fffd0288753086daaa59bdb12816a7be62636dc49311bbb97ad277d866 [2025-02-07 16:58:05,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 16:58:05,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 16:58:05,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 16:58:05,950 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 16:58:05,951 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 16:58:05,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/nr3.c [2025-02-07 16:58:07,097 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ab9e45630/e29aeadca31c46148a79901e41b9ad47/FLAGd973d1d8d [2025-02-07 16:58:07,313 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 16:58:07,314 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-tiling/nr3.c [2025-02-07 16:58:07,325 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ab9e45630/e29aeadca31c46148a79901e41b9ad47/FLAGd973d1d8d [2025-02-07 16:58:07,664 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ab9e45630/e29aeadca31c46148a79901e41b9ad47 [2025-02-07 16:58:07,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 16:58:07,667 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 16:58:07,668 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 16:58:07,668 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 16:58:07,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 16:58:07,671 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 04:58:07" (1/1) ... [2025-02-07 16:58:07,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b53348a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:07, skipping insertion in model container [2025-02-07 16:58:07,672 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 04:58:07" (1/1) ... [2025-02-07 16:58:07,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 16:58:07,772 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-tiling/nr3.c[394,407] [2025-02-07 16:58:07,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 16:58:07,794 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 16:58:07,803 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-tiling/nr3.c[394,407] [2025-02-07 16:58:07,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 16:58:07,816 INFO L204 MainTranslator]: Completed translation [2025-02-07 16:58:07,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:07 WrapperNode [2025-02-07 16:58:07,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 16:58:07,817 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 16:58:07,817 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 16:58:07,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 16:58:07,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:07" (1/1) ... [2025-02-07 16:58:07,825 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:07" (1/1) ... [2025-02-07 16:58:07,839 INFO L138 Inliner]: procedures = 15, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2025-02-07 16:58:07,839 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 16:58:07,840 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 16:58:07,840 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 16:58:07,840 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 16:58:07,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:07" (1/1) ... [2025-02-07 16:58:07,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:07" (1/1) ... [2025-02-07 16:58:07,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:07" (1/1) ... [2025-02-07 16:58:07,852 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 6, 4]. 50 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 2 writes are split as follows [0, 0, 2]. [2025-02-07 16:58:07,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:07" (1/1) ... [2025-02-07 16:58:07,853 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:07" (1/1) ... [2025-02-07 16:58:07,856 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:07" (1/1) ... [2025-02-07 16:58:07,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:07" (1/1) ... [2025-02-07 16:58:07,856 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:07" (1/1) ... [2025-02-07 16:58:07,857 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:07" (1/1) ... [2025-02-07 16:58:07,858 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 16:58:07,858 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 16:58:07,858 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 16:58:07,858 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 16:58:07,859 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:07" (1/1) ... [2025-02-07 16:58:07,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 16:58:07,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:58:07,884 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 16:58:07,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 16:58:07,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 16:58:07,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 16:58:07,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 16:58:07,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 16:58:07,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 16:58:07,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 16:58:07,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 16:58:07,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 16:58:07,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 16:58:07,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 16:58:07,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 16:58:07,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 16:58:07,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 16:58:07,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 16:58:07,959 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 16:58:07,960 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 16:58:08,069 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-07 16:58:08,069 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 16:58:08,074 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 16:58:08,075 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 16:58:08,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 04:58:08 BoogieIcfgContainer [2025-02-07 16:58:08,075 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 16:58:08,077 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 16:58:08,077 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 16:58:08,080 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 16:58:08,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 04:58:07" (1/3) ... [2025-02-07 16:58:08,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4249699d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 04:58:08, skipping insertion in model container [2025-02-07 16:58:08,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:58:07" (2/3) ... [2025-02-07 16:58:08,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4249699d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 04:58:08, skipping insertion in model container [2025-02-07 16:58:08,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 04:58:08" (3/3) ... [2025-02-07 16:58:08,082 INFO L128 eAbstractionObserver]: Analyzing ICFG nr3.c [2025-02-07 16:58:08,091 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 16:58:08,094 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nr3.c that has 1 procedures, 20 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-07 16:58:08,132 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 16:58:08,140 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;@63dc357f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 16:58:08,140 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 16:58:08,143 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 17 states have (on average 1.588235294117647) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:08,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 16:58:08,146 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:08,146 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:08,146 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:08,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:08,149 INFO L85 PathProgramCache]: Analyzing trace with hash 471203222, now seen corresponding path program 1 times [2025-02-07 16:58:08,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:08,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320377081] [2025-02-07 16:58:08,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:58:08,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:08,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 16:58:08,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 16:58:08,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:08,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:08,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:08,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:08,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320377081] [2025-02-07 16:58:08,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320377081] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 16:58:08,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 16:58:08,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 16:58:08,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551531805] [2025-02-07 16:58:08,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 16:58:08,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 16:58:08,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:58:08,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 16:58:08,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 16:58:08,307 INFO L87 Difference]: Start difference. First operand has 20 states, 17 states have (on average 1.588235294117647) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:08,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:58:08,315 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2025-02-07 16:58:08,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 16:58:08,316 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-07 16:58:08,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:58:08,320 INFO L225 Difference]: With dead ends: 35 [2025-02-07 16:58:08,320 INFO L226 Difference]: Without dead ends: 16 [2025-02-07 16:58:08,322 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-02-07 16:58:08,325 INFO L435 NwaCegarLoop]: 25 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, 25 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-02-07 16:58:08,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 16:58:08,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-02-07 16:58:08,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-02-07 16:58:08,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:08,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2025-02-07 16:58:08,351 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 11 [2025-02-07 16:58:08,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:58:08,351 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-02-07 16:58:08,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:08,351 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2025-02-07 16:58:08,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 16:58:08,351 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:08,351 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:08,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 16:58:08,352 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:08,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:08,354 INFO L85 PathProgramCache]: Analyzing trace with hash -2080953739, now seen corresponding path program 1 times [2025-02-07 16:58:08,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:08,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709073188] [2025-02-07 16:58:08,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:58:08,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:08,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 16:58:08,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 16:58:08,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:08,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:08,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:08,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:08,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709073188] [2025-02-07 16:58:08,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709073188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 16:58:08,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 16:58:08,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 16:58:08,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776647786] [2025-02-07 16:58:08,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 16:58:08,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 16:58:08,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:58:08,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 16:58:08,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-07 16:58:08,638 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:08,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:58:08,675 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2025-02-07 16:58:08,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 16:58:08,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-07 16:58:08,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:58:08,676 INFO L225 Difference]: With dead ends: 27 [2025-02-07 16:58:08,676 INFO L226 Difference]: Without dead ends: 20 [2025-02-07 16:58:08,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-07 16:58:08,676 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 16:58:08,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 21 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 16:58:08,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-07 16:58:08,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2025-02-07 16:58:08,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:08,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2025-02-07 16:58:08,684 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 11 [2025-02-07 16:58:08,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:58:08,684 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-02-07 16:58:08,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:08,685 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2025-02-07 16:58:08,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-07 16:58:08,685 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:08,685 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:08,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 16:58:08,685 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:08,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:08,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1093934672, now seen corresponding path program 1 times [2025-02-07 16:58:08,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:08,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524057042] [2025-02-07 16:58:08,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:58:08,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:08,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-07 16:58:08,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-07 16:58:08,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:08,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:08,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:08,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:08,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524057042] [2025-02-07 16:58:08,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524057042] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 16:58:08,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 16:58:08,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 16:58:08,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472607530] [2025-02-07 16:58:08,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 16:58:08,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 16:58:08,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:58:08,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 16:58:08,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 16:58:08,732 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:08,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:58:08,747 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2025-02-07 16:58:08,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 16:58:08,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-07 16:58:08,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:58:08,748 INFO L225 Difference]: With dead ends: 31 [2025-02-07 16:58:08,748 INFO L226 Difference]: Without dead ends: 20 [2025-02-07 16:58:08,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 16:58:08,749 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 16:58:08,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 28 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 16:58:08,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-07 16:58:08,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-02-07 16:58:08,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:08,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-02-07 16:58:08,752 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 13 [2025-02-07 16:58:08,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:58:08,752 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-02-07 16:58:08,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:08,752 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-02-07 16:58:08,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-07 16:58:08,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:08,753 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:08,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 16:58:08,753 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:08,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:08,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1885260083, now seen corresponding path program 1 times [2025-02-07 16:58:08,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:08,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587262006] [2025-02-07 16:58:08,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:58:08,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:08,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-07 16:58:08,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-07 16:58:08,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:08,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:08,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:08,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:08,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587262006] [2025-02-07 16:58:08,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587262006] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:58:08,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537722529] [2025-02-07 16:58:08,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:58:08,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:08,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:58:08,813 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 16:58:08,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 16:58:08,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-07 16:58:08,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-07 16:58:08,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:08,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:08,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 16:58:08,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:58:08,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:08,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:58:08,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:08,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537722529] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:58:08,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:58:08,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-07 16:58:08,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87074706] [2025-02-07 16:58:08,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:58:08,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 16:58:08,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:58:08,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 16:58:08,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 16:58:08,930 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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-02-07 16:58:08,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:58:08,958 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2025-02-07 16:58:08,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 16:58:08,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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 16 [2025-02-07 16:58:08,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:58:08,959 INFO L225 Difference]: With dead ends: 36 [2025-02-07 16:58:08,959 INFO L226 Difference]: Without dead ends: 24 [2025-02-07 16:58:08,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 16:58:08,960 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 16:58:08,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 40 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 16:58:08,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-07 16:58:08,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-02-07 16:58:08,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:08,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2025-02-07 16:58:08,964 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 16 [2025-02-07 16:58:08,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:58:08,964 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2025-02-07 16:58:08,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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-02-07 16:58:08,964 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2025-02-07 16:58:08,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 16:58:08,966 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:08,966 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:08,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 16:58:09,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:09,168 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:09,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:09,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1177762797, now seen corresponding path program 2 times [2025-02-07 16:58:09,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:09,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838494856] [2025-02-07 16:58:09,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 16:58:09,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:09,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-07 16:58:09,192 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 16:58:09,193 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 16:58:09,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:09,279 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:09,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:09,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838494856] [2025-02-07 16:58:09,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838494856] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:58:09,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299535519] [2025-02-07 16:58:09,279 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 16:58:09,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:09,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:58:09,282 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 16:58:09,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 16:58:09,315 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-07 16:58:09,333 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 16:58:09,333 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 16:58:09,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:09,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-07 16:58:09,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:58:09,399 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:09,400 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 16:58:09,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299535519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 16:58:09,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 16:58:09,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-02-07 16:58:09,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592534848] [2025-02-07 16:58:09,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 16:58:09,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 16:58:09,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:58:09,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 16:58:09,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-02-07 16:58:09,401 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:09,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:58:09,431 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2025-02-07 16:58:09,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 16:58:09,432 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-07 16:58:09,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:58:09,432 INFO L225 Difference]: With dead ends: 42 [2025-02-07 16:58:09,432 INFO L226 Difference]: Without dead ends: 24 [2025-02-07 16:58:09,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-02-07 16:58:09,433 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 16:58:09,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 36 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 16:58:09,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-07 16:58:09,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-02-07 16:58:09,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 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-02-07 16:58:09,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2025-02-07 16:58:09,436 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 22 [2025-02-07 16:58:09,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:58:09,437 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-02-07 16:58:09,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:09,437 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2025-02-07 16:58:09,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 16:58:09,437 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:09,437 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:09,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-07 16:58:09,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:09,638 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:09,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:09,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1309750036, now seen corresponding path program 1 times [2025-02-07 16:58:09,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:09,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202724843] [2025-02-07 16:58:09,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:58:09,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:09,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 16:58:09,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 16:58:09,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:09,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:10,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:10,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202724843] [2025-02-07 16:58:10,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202724843] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:58:10,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578298674] [2025-02-07 16:58:10,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:58:10,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:10,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:58:10,265 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 16:58:10,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 16:58:10,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 16:58:10,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 16:58:10,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:10,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:10,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-07 16:58:10,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:58:10,455 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-02-07 16:58:10,526 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 19 treesize of output 18 [2025-02-07 16:58:10,604 INFO L349 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2025-02-07 16:58:10,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 40 [2025-02-07 16:58:10,906 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:10,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:58:11,130 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 63 treesize of output 59 [2025-02-07 16:58:11,135 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 283 treesize of output 275 [2025-02-07 16:58:11,312 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 16:58:11,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578298674] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:58:11,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:58:11,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 14] total 38 [2025-02-07 16:58:11,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676633762] [2025-02-07 16:58:11,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:58:11,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-07 16:58:11,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:58:11,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-07 16:58:11,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1169, Unknown=0, NotChecked=0, Total=1406 [2025-02-07 16:58:11,316 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 38 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 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-02-07 16:58:13,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:58:13,452 INFO L93 Difference]: Finished difference Result 137 states and 176 transitions. [2025-02-07 16:58:13,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-02-07 16:58:13,455 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-07 16:58:13,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:58:13,457 INFO L225 Difference]: With dead ends: 137 [2025-02-07 16:58:13,457 INFO L226 Difference]: Without dead ends: 119 [2025-02-07 16:58:13,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2190 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1451, Invalid=6031, Unknown=0, NotChecked=0, Total=7482 [2025-02-07 16:58:13,460 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 471 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 16:58:13,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 117 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 16:58:13,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-07 16:58:13,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 44. [2025-02-07 16:58:13,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 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-02-07 16:58:13,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2025-02-07 16:58:13,470 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 22 [2025-02-07 16:58:13,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:58:13,471 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2025-02-07 16:58:13,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 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-02-07 16:58:13,471 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2025-02-07 16:58:13,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-07 16:58:13,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:13,471 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:13,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 16:58:13,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:13,676 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:13,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:13,677 INFO L85 PathProgramCache]: Analyzing trace with hash 29197556, now seen corresponding path program 1 times [2025-02-07 16:58:13,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:13,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758860404] [2025-02-07 16:58:13,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:58:13,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:13,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-07 16:58:13,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-07 16:58:13,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:13,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:13,976 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:13,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:13,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758860404] [2025-02-07 16:58:13,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758860404] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:58:13,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530984530] [2025-02-07 16:58:13,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:58:13,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:13,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:58:13,979 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 16:58:13,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 16:58:14,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-07 16:58:14,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-07 16:58:14,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:14,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:14,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-07 16:58:14,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:58:14,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-07 16:58:14,144 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:14,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:58:14,179 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 19 treesize of output 17 [2025-02-07 16:58:14,181 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 24 treesize of output 20 [2025-02-07 16:58:14,282 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:14,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530984530] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:58:14,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:58:14,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 13] total 25 [2025-02-07 16:58:14,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440836312] [2025-02-07 16:58:14,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:58:14,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-07 16:58:14,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:58:14,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-07 16:58:14,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2025-02-07 16:58:14,285 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:14,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:58:14,662 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2025-02-07 16:58:14,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-07 16:58:14,663 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-02-07 16:58:14,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:58:14,664 INFO L225 Difference]: With dead ends: 108 [2025-02-07 16:58:14,664 INFO L226 Difference]: Without dead ends: 106 [2025-02-07 16:58:14,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=1853, Unknown=0, NotChecked=0, Total=2162 [2025-02-07 16:58:14,666 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 78 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 16:58:14,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 138 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 16:58:14,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-07 16:58:14,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 69. [2025-02-07 16:58:14,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 68 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:14,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 86 transitions. [2025-02-07 16:58:14,675 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 86 transitions. Word has length 32 [2025-02-07 16:58:14,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:58:14,675 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 86 transitions. [2025-02-07 16:58:14,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:14,675 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 86 transitions. [2025-02-07 16:58:14,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-07 16:58:14,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:14,676 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:14,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-07 16:58:14,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-07 16:58:14,877 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:14,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:14,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1635735945, now seen corresponding path program 2 times [2025-02-07 16:58:14,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:14,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455911143] [2025-02-07 16:58:14,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 16:58:14,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:14,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-07 16:58:14,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-07 16:58:14,901 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 16:58:14,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:15,096 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 16:58:15,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:15,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455911143] [2025-02-07 16:58:15,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455911143] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:58:15,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239803243] [2025-02-07 16:58:15,096 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 16:58:15,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:15,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:58:15,098 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 16:58:15,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 16:58:15,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-07 16:58:15,149 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-07 16:58:15,149 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 16:58:15,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:15,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-07 16:58:15,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:58:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 16:58:15,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:58:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 16:58:15,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239803243] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:58:15,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:58:15,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24 [2025-02-07 16:58:15,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675847467] [2025-02-07 16:58:15,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:58:15,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-07 16:58:15,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:58:15,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-07 16:58:15,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2025-02-07 16:58:15,539 INFO L87 Difference]: Start difference. First operand 69 states and 86 transitions. Second operand has 24 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 24 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:15,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:58:15,677 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2025-02-07 16:58:15,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 16:58:15,678 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 24 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-02-07 16:58:15,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:58:15,678 INFO L225 Difference]: With dead ends: 119 [2025-02-07 16:58:15,678 INFO L226 Difference]: Without dead ends: 94 [2025-02-07 16:58:15,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=227, Invalid=585, Unknown=0, NotChecked=0, Total=812 [2025-02-07 16:58:15,679 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 117 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 16:58:15,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 112 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 16:58:15,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-07 16:58:15,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 62. [2025-02-07 16:58:15,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 61 states have internal predecessors, (76), 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-02-07 16:58:15,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2025-02-07 16:58:15,692 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 37 [2025-02-07 16:58:15,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:58:15,693 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2025-02-07 16:58:15,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 24 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:15,693 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2025-02-07 16:58:15,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-07 16:58:15,694 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:15,694 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:15,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-07 16:58:15,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:15,894 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:15,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:15,895 INFO L85 PathProgramCache]: Analyzing trace with hash -294668554, now seen corresponding path program 3 times [2025-02-07 16:58:15,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:15,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552361770] [2025-02-07 16:58:15,895 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 16:58:15,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:15,902 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 8 equivalence classes. [2025-02-07 16:58:15,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 38 of 38 statements. [2025-02-07 16:58:15,933 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-02-07 16:58:15,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:16,955 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 4 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:16,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:16,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552361770] [2025-02-07 16:58:16,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552361770] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:58:16,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702341217] [2025-02-07 16:58:16,956 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 16:58:16,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:16,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:58:16,958 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 16:58:16,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-07 16:58:16,993 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 8 equivalence classes. [2025-02-07 16:58:17,016 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 38 of 38 statements. [2025-02-07 16:58:17,016 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-02-07 16:58:17,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:17,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-07 16:58:17,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:58:17,104 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-02-07 16:58:17,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 16:58:17,172 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 22 [2025-02-07 16:58:17,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 16:58:17,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 16:58:17,313 INFO L349 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2025-02-07 16:58:17,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 48 [2025-02-07 16:58:25,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 16:58:25,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 16:58:25,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 16:58:25,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:25,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 40 [2025-02-07 16:58:25,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 16:58:25,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 16:58:25,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 16:58:25,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 16:58:25,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 16:58:25,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 16:58:25,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:25,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 56 [2025-02-07 16:58:29,969 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 5 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:29,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:59:48,569 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 61 treesize of output 59 [2025-02-07 16:59:48,576 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 11246 treesize of output 11182 [2025-02-07 16:59:49,389 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 2 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:59:49,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702341217] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:59:49,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:59:49,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 19] total 55 [2025-02-07 16:59:49,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727986735] [2025-02-07 16:59:49,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:59:49,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-02-07 16:59:49,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:59:49,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-02-07 16:59:49,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=2602, Unknown=22, NotChecked=0, Total=2970 [2025-02-07 16:59:49,391 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand has 55 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 55 states have internal predecessors, (105), 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)