./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.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 d0cee5b1964cd71f7406ad577c9568bfea84778de80728dfc08113baa4a027fc --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:13:27,746 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:13:27,807 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:13:27,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:13:27,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:13:27,838 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:13:27,839 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:13:27,839 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:13:27,839 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:13:27,839 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:13:27,840 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:13:27,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:13:27,840 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:13:27,840 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:13:27,841 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:13:27,841 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:13:27,841 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:13:27,841 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:13:27,841 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:13:27,841 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:13:27,842 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:13:27,842 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:13:27,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:13:27,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:13:27,842 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:13:27,842 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:13:27,842 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:13:27,842 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:13:27,842 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:13:27,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:13:27,842 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:13:27,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:13:27,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:13:27,843 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:13:27,843 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:13:27,843 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:13:27,843 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:13:27,843 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:13:27,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:13:27,843 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:13:27,844 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:13:27,844 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:13:27,844 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:13:27,844 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 -> d0cee5b1964cd71f7406ad577c9568bfea84778de80728dfc08113baa4a027fc [2025-02-05 16:13:28,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:13:28,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:13:28,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:13:28,107 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:13:28,107 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:13:28,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c [2025-02-05 16:13:29,391 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24785e51d/306b2b736f8b48b4a8e04b11c5ed2528/FLAGbb52e336e [2025-02-05 16:13:29,680 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:13:29,681 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c [2025-02-05 16:13:29,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24785e51d/306b2b736f8b48b4a8e04b11c5ed2528/FLAGbb52e336e [2025-02-05 16:13:29,712 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24785e51d/306b2b736f8b48b4a8e04b11c5ed2528 [2025-02-05 16:13:29,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:13:29,716 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:13:29,718 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:13:29,718 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:13:29,723 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:13:29,725 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:13:29" (1/1) ... [2025-02-05 16:13:29,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@983aef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:29, skipping insertion in model container [2025-02-05 16:13:29,729 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:13:29" (1/1) ... [2025-02-05 16:13:29,749 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:13:29,916 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/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c[6940,6953] [2025-02-05 16:13:29,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:13:29,928 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:13:29,960 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/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c[6940,6953] [2025-02-05 16:13:29,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:13:29,973 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:13:29,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:29 WrapperNode [2025-02-05 16:13:29,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:13:29,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:13:29,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:13:29,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:13:29,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:29" (1/1) ... [2025-02-05 16:13:29,990 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:29" (1/1) ... [2025-02-05 16:13:30,015 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 247 [2025-02-05 16:13:30,015 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:13:30,016 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:13:30,016 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:13:30,016 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:13:30,022 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:29" (1/1) ... [2025-02-05 16:13:30,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:29" (1/1) ... [2025-02-05 16:13:30,024 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:29" (1/1) ... [2025-02-05 16:13:30,038 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 16:13:30,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:29" (1/1) ... [2025-02-05 16:13:30,038 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:29" (1/1) ... [2025-02-05 16:13:30,043 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:29" (1/1) ... [2025-02-05 16:13:30,044 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:29" (1/1) ... [2025-02-05 16:13:30,045 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:29" (1/1) ... [2025-02-05 16:13:30,046 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:29" (1/1) ... [2025-02-05 16:13:30,051 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:13:30,051 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:13:30,051 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:13:30,051 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:13:30,052 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:29" (1/1) ... [2025-02-05 16:13:30,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:13:30,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:13:30,079 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-05 16:13:30,083 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-05 16:13:30,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:13:30,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:13:30,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:13:30,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:13:30,183 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:13:30,184 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:13:30,576 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-02-05 16:13:30,576 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:13:30,589 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:13:30,589 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:13:30,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:13:30 BoogieIcfgContainer [2025-02-05 16:13:30,590 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:13:30,594 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:13:30,595 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:13:30,598 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:13:30,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:13:29" (1/3) ... [2025-02-05 16:13:30,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35b76b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:13:30, skipping insertion in model container [2025-02-05 16:13:30,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:13:29" (2/3) ... [2025-02-05 16:13:30,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35b76b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:13:30, skipping insertion in model container [2025-02-05 16:13:30,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:13:30" (3/3) ... [2025-02-05 16:13:30,600 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c [2025-02-05 16:13:30,616 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:13:30,618 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c that has 1 procedures, 68 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 16:13:30,688 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:13:30,699 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;@43eb8fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:13:30,700 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:13:30,704 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 66 states have (on average 1.696969696969697) internal successors, (112), 67 states have internal predecessors, (112), 0 states have call successors, (0), 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-05 16:13:30,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 16:13:30,709 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:30,709 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:30,710 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:30,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:30,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1606310531, now seen corresponding path program 1 times [2025-02-05 16:13:30,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:30,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740695499] [2025-02-05 16:13:30,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:30,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:30,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 16:13:30,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 16:13:30,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:30,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:30,911 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-05 16:13:30,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:30,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740695499] [2025-02-05 16:13:30,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740695499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:30,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:30,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 16:13:30,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433341430] [2025-02-05 16:13:30,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:30,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 16:13:30,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:30,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 16:13:30,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:13:30,937 INFO L87 Difference]: Start difference. First operand has 68 states, 66 states have (on average 1.696969696969697) internal successors, (112), 67 states have internal predecessors, (112), 0 states have call successors, (0), 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 12.5) internal successors, (25), 2 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-05 16:13:30,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:30,951 INFO L93 Difference]: Finished difference Result 111 states and 182 transitions. [2025-02-05 16:13:30,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 16:13:30,953 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 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 25 [2025-02-05 16:13:30,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:30,959 INFO L225 Difference]: With dead ends: 111 [2025-02-05 16:13:30,959 INFO L226 Difference]: Without dead ends: 65 [2025-02-05 16:13:30,962 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-05 16:13:30,964 INFO L435 NwaCegarLoop]: 107 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, 107 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-05 16:13:30,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:30,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-05 16:13:30,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-02-05 16:13:30,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.671875) internal successors, (107), 64 states have internal predecessors, (107), 0 states have call successors, (0), 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-05 16:13:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 107 transitions. [2025-02-05 16:13:30,995 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 107 transitions. Word has length 25 [2025-02-05 16:13:30,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:30,995 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 107 transitions. [2025-02-05 16:13:30,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 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-05 16:13:30,996 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 107 transitions. [2025-02-05 16:13:30,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 16:13:30,997 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:30,997 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:30,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:13:30,998 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:30,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:30,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1197486306, now seen corresponding path program 1 times [2025-02-05 16:13:30,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:30,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37978410] [2025-02-05 16:13:30,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:30,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:31,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 16:13:31,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 16:13:31,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:31,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:31,193 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-05 16:13:31,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:31,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37978410] [2025-02-05 16:13:31,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37978410] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:31,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:31,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:13:31,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110627510] [2025-02-05 16:13:31,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:31,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:13:31,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:31,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:13:31,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:13:31,196 INFO L87 Difference]: Start difference. First operand 65 states and 107 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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-05 16:13:31,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:31,247 INFO L93 Difference]: Finished difference Result 111 states and 178 transitions. [2025-02-05 16:13:31,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:13:31,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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 25 [2025-02-05 16:13:31,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:31,248 INFO L225 Difference]: With dead ends: 111 [2025-02-05 16:13:31,248 INFO L226 Difference]: Without dead ends: 65 [2025-02-05 16:13:31,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:13:31,249 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:31,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 398 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:31,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-05 16:13:31,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-02-05 16:13:31,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 0 states have call successors, (0), 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-05 16:13:31,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2025-02-05 16:13:31,253 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 90 transitions. Word has length 25 [2025-02-05 16:13:31,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:31,253 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 90 transitions. [2025-02-05 16:13:31,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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-05 16:13:31,253 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2025-02-05 16:13:31,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 16:13:31,254 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:31,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:31,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:13:31,254 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:31,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:31,255 INFO L85 PathProgramCache]: Analyzing trace with hash -163804974, now seen corresponding path program 1 times [2025-02-05 16:13:31,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:31,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835457637] [2025-02-05 16:13:31,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:31,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:31,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 16:13:31,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 16:13:31,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:31,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:31,431 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-05 16:13:31,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:31,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835457637] [2025-02-05 16:13:31,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835457637] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:31,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:31,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:13:31,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498151094] [2025-02-05 16:13:31,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:31,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:13:31,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:31,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:13:31,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:13:31,432 INFO L87 Difference]: Start difference. First operand 65 states and 90 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:31,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:31,510 INFO L93 Difference]: Finished difference Result 233 states and 358 transitions. [2025-02-05 16:13:31,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:13:31,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-02-05 16:13:31,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:31,511 INFO L225 Difference]: With dead ends: 233 [2025-02-05 16:13:31,511 INFO L226 Difference]: Without dead ends: 191 [2025-02-05 16:13:31,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:13:31,512 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 380 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:31,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 335 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:31,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-02-05 16:13:31,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 105. [2025-02-05 16:13:31,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.4807692307692308) internal successors, (154), 104 states have internal predecessors, (154), 0 states have call successors, (0), 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-05 16:13:31,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 154 transitions. [2025-02-05 16:13:31,521 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 154 transitions. Word has length 41 [2025-02-05 16:13:31,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:31,521 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 154 transitions. [2025-02-05 16:13:31,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:31,521 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 154 transitions. [2025-02-05 16:13:31,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-05 16:13:31,522 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:31,522 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:31,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:13:31,522 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:31,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:31,523 INFO L85 PathProgramCache]: Analyzing trace with hash -753372686, now seen corresponding path program 1 times [2025-02-05 16:13:31,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:31,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617845641] [2025-02-05 16:13:31,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:31,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:31,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-05 16:13:31,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 16:13:31,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:31,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:31,876 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-05 16:13:31,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:31,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617845641] [2025-02-05 16:13:31,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617845641] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:31,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:31,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:13:31,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776315984] [2025-02-05 16:13:31,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:31,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:13:31,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:31,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:13:31,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:13:31,882 INFO L87 Difference]: Start difference. First operand 105 states and 154 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 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-05 16:13:31,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:31,948 INFO L93 Difference]: Finished difference Result 113 states and 163 transitions. [2025-02-05 16:13:31,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:13:31,949 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2025-02-05 16:13:31,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:31,950 INFO L225 Difference]: With dead ends: 113 [2025-02-05 16:13:31,951 INFO L226 Difference]: Without dead ends: 111 [2025-02-05 16:13:31,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:13:31,953 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:31,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 576 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:13:31,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-05 16:13:31,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-02-05 16:13:31,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.4545454545454546) internal successors, (160), 110 states have internal predecessors, (160), 0 states have call successors, (0), 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-05 16:13:31,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 160 transitions. [2025-02-05 16:13:31,960 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 160 transitions. Word has length 42 [2025-02-05 16:13:31,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:31,960 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 160 transitions. [2025-02-05 16:13:31,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 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-05 16:13:31,960 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 160 transitions. [2025-02-05 16:13:31,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 16:13:31,961 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:31,961 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:31,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:13:31,961 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:31,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:31,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1790997230, now seen corresponding path program 1 times [2025-02-05 16:13:31,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:31,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414231712] [2025-02-05 16:13:31,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:31,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:31,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 16:13:31,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 16:13:31,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:31,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:32,057 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-05 16:13:32,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:32,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414231712] [2025-02-05 16:13:32,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414231712] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:32,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:32,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:32,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32044052] [2025-02-05 16:13:32,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:32,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:32,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:32,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:32,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:32,059 INFO L87 Difference]: Start difference. First operand 111 states and 160 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:32,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:32,077 INFO L93 Difference]: Finished difference Result 272 states and 409 transitions. [2025-02-05 16:13:32,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:32,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-02-05 16:13:32,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:32,079 INFO L225 Difference]: With dead ends: 272 [2025-02-05 16:13:32,080 INFO L226 Difference]: Without dead ends: 184 [2025-02-05 16:13:32,081 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-05 16:13:32,081 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 39 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:32,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 149 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:32,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-02-05 16:13:32,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2025-02-05 16:13:32,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 1.4804469273743017) internal successors, (265), 179 states have internal predecessors, (265), 0 states have call successors, (0), 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-05 16:13:32,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 265 transitions. [2025-02-05 16:13:32,093 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 265 transitions. Word has length 43 [2025-02-05 16:13:32,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:32,093 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 265 transitions. [2025-02-05 16:13:32,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:32,094 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 265 transitions. [2025-02-05 16:13:32,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 16:13:32,098 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:32,098 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:32,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:13:32,099 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:32,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:32,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1349128319, now seen corresponding path program 1 times [2025-02-05 16:13:32,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:32,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026611519] [2025-02-05 16:13:32,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:32,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:32,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 16:13:32,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 16:13:32,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:32,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:32,170 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-05 16:13:32,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:32,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026611519] [2025-02-05 16:13:32,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026611519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:32,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:32,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:32,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880563718] [2025-02-05 16:13:32,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:32,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:32,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:32,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:32,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:32,173 INFO L87 Difference]: Start difference. First operand 180 states and 265 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:32,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:32,193 INFO L93 Difference]: Finished difference Result 462 states and 693 transitions. [2025-02-05 16:13:32,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:32,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-02-05 16:13:32,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:32,195 INFO L225 Difference]: With dead ends: 462 [2025-02-05 16:13:32,195 INFO L226 Difference]: Without dead ends: 305 [2025-02-05 16:13:32,196 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-05 16:13:32,196 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 47 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:32,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 175 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:32,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-02-05 16:13:32,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2025-02-05 16:13:32,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 1.4768211920529801) internal successors, (446), 302 states have internal predecessors, (446), 0 states have call successors, (0), 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-05 16:13:32,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 446 transitions. [2025-02-05 16:13:32,217 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 446 transitions. Word has length 44 [2025-02-05 16:13:32,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:32,217 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 446 transitions. [2025-02-05 16:13:32,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:32,217 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 446 transitions. [2025-02-05 16:13:32,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 16:13:32,218 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:32,218 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:32,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:13:32,218 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:32,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:32,219 INFO L85 PathProgramCache]: Analyzing trace with hash 190452429, now seen corresponding path program 1 times [2025-02-05 16:13:32,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:32,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627509405] [2025-02-05 16:13:32,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:32,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:32,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 16:13:32,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 16:13:32,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:32,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:32,269 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-05 16:13:32,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:32,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627509405] [2025-02-05 16:13:32,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627509405] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:32,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:32,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:32,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748491742] [2025-02-05 16:13:32,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:32,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:32,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:32,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:32,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:32,271 INFO L87 Difference]: Start difference. First operand 303 states and 446 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:32,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:32,294 INFO L93 Difference]: Finished difference Result 799 states and 1180 transitions. [2025-02-05 16:13:32,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:32,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-02-05 16:13:32,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:32,297 INFO L225 Difference]: With dead ends: 799 [2025-02-05 16:13:32,297 INFO L226 Difference]: Without dead ends: 519 [2025-02-05 16:13:32,298 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-05 16:13:32,298 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 51 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:32,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 188 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:32,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-02-05 16:13:32,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 517. [2025-02-05 16:13:32,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 516 states have (on average 1.449612403100775) internal successors, (748), 516 states have internal predecessors, (748), 0 states have call successors, (0), 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-05 16:13:32,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 748 transitions. [2025-02-05 16:13:32,317 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 748 transitions. Word has length 44 [2025-02-05 16:13:32,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:32,317 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 748 transitions. [2025-02-05 16:13:32,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:32,317 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 748 transitions. [2025-02-05 16:13:32,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 16:13:32,321 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:32,321 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:32,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:13:32,322 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:32,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:32,322 INFO L85 PathProgramCache]: Analyzing trace with hash 940063400, now seen corresponding path program 1 times [2025-02-05 16:13:32,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:32,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146377290] [2025-02-05 16:13:32,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:32,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:32,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 16:13:32,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 16:13:32,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:32,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:32,367 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-05 16:13:32,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:32,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146377290] [2025-02-05 16:13:32,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146377290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:32,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:32,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:32,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151901782] [2025-02-05 16:13:32,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:32,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:32,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:32,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:32,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:32,369 INFO L87 Difference]: Start difference. First operand 517 states and 748 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:32,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:32,392 INFO L93 Difference]: Finished difference Result 1004 states and 1466 transitions. [2025-02-05 16:13:32,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:32,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-02-05 16:13:32,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:32,396 INFO L225 Difference]: With dead ends: 1004 [2025-02-05 16:13:32,396 INFO L226 Difference]: Without dead ends: 721 [2025-02-05 16:13:32,397 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-05 16:13:32,397 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 52 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:32,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 197 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:32,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2025-02-05 16:13:32,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 719. [2025-02-05 16:13:32,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 718 states have (on average 1.434540389972145) internal successors, (1030), 718 states have internal predecessors, (1030), 0 states have call successors, (0), 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-05 16:13:32,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1030 transitions. [2025-02-05 16:13:32,419 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1030 transitions. Word has length 45 [2025-02-05 16:13:32,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:32,419 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 1030 transitions. [2025-02-05 16:13:32,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:32,419 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1030 transitions. [2025-02-05 16:13:32,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:13:32,422 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:32,422 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:32,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:13:32,423 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:32,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:32,423 INFO L85 PathProgramCache]: Analyzing trace with hash -442786963, now seen corresponding path program 1 times [2025-02-05 16:13:32,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:32,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477659155] [2025-02-05 16:13:32,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:32,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:32,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:13:32,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:13:32,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:32,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:32,570 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 16:13:32,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:32,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477659155] [2025-02-05 16:13:32,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477659155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:32,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:32,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:13:32,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931296758] [2025-02-05 16:13:32,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:32,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:13:32,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:32,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:13:32,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:13:32,571 INFO L87 Difference]: Start difference. First operand 719 states and 1030 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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-05 16:13:32,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:32,640 INFO L93 Difference]: Finished difference Result 1659 states and 2418 transitions. [2025-02-05 16:13:32,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:13:32,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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 63 [2025-02-05 16:13:32,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:32,645 INFO L225 Difference]: With dead ends: 1659 [2025-02-05 16:13:32,645 INFO L226 Difference]: Without dead ends: 1305 [2025-02-05 16:13:32,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:13:32,646 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 243 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:32,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 382 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:32,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2025-02-05 16:13:32,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1059. [2025-02-05 16:13:32,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 1058 states have (on average 1.438563327032136) internal successors, (1522), 1058 states have internal predecessors, (1522), 0 states have call successors, (0), 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-05 16:13:32,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1522 transitions. [2025-02-05 16:13:32,672 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1522 transitions. Word has length 63 [2025-02-05 16:13:32,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:32,672 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1522 transitions. [2025-02-05 16:13:32,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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-05 16:13:32,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1522 transitions. [2025-02-05 16:13:32,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:13:32,673 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:32,673 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:32,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:13:32,673 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:32,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:32,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1601462853, now seen corresponding path program 1 times [2025-02-05 16:13:32,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:32,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088729704] [2025-02-05 16:13:32,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:32,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:32,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:13:32,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:13:32,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:32,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:32,752 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 16:13:32,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:32,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088729704] [2025-02-05 16:13:32,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088729704] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:32,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:32,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:13:32,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629086836] [2025-02-05 16:13:32,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:32,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:13:32,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:32,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:13:32,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:13:32,753 INFO L87 Difference]: Start difference. First operand 1059 states and 1522 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:32,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:32,815 INFO L93 Difference]: Finished difference Result 1999 states and 2910 transitions. [2025-02-05 16:13:32,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:13:32,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-02-05 16:13:32,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:32,821 INFO L225 Difference]: With dead ends: 1999 [2025-02-05 16:13:32,821 INFO L226 Difference]: Without dead ends: 1645 [2025-02-05 16:13:32,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:13:32,822 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 236 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:32,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 402 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:32,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2025-02-05 16:13:32,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1399. [2025-02-05 16:13:32,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1399 states, 1398 states have (on average 1.4406294706723892) internal successors, (2014), 1398 states have internal predecessors, (2014), 0 states have call successors, (0), 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-05 16:13:32,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 2014 transitions. [2025-02-05 16:13:32,853 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 2014 transitions. Word has length 63 [2025-02-05 16:13:32,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:32,853 INFO L471 AbstractCegarLoop]: Abstraction has 1399 states and 2014 transitions. [2025-02-05 16:13:32,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:32,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 2014 transitions. [2025-02-05 16:13:32,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:13:32,854 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:32,854 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:32,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:13:32,854 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:32,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:32,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1225264506, now seen corresponding path program 1 times [2025-02-05 16:13:32,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:32,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350061099] [2025-02-05 16:13:32,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:32,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:32,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:13:32,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:13:32,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:32,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:32,947 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:32,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:32,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350061099] [2025-02-05 16:13:32,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350061099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:32,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:32,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:32,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432941946] [2025-02-05 16:13:32,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:32,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:32,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:32,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:32,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:32,948 INFO L87 Difference]: Start difference. First operand 1399 states and 2014 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:32,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:32,976 INFO L93 Difference]: Finished difference Result 2775 states and 4004 transitions. [2025-02-05 16:13:32,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:32,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-02-05 16:13:32,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:32,982 INFO L225 Difference]: With dead ends: 2775 [2025-02-05 16:13:32,983 INFO L226 Difference]: Without dead ends: 1401 [2025-02-05 16:13:32,984 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-05 16:13:32,986 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 42 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:32,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 188 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:32,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2025-02-05 16:13:33,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1399. [2025-02-05 16:13:33,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1399 states, 1398 states have (on average 1.4234620886981402) internal successors, (1990), 1398 states have internal predecessors, (1990), 0 states have call successors, (0), 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-05 16:13:33,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 1990 transitions. [2025-02-05 16:13:33,019 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 1990 transitions. Word has length 64 [2025-02-05 16:13:33,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:33,022 INFO L471 AbstractCegarLoop]: Abstraction has 1399 states and 1990 transitions. [2025-02-05 16:13:33,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:33,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1990 transitions. [2025-02-05 16:13:33,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:13:33,023 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:33,024 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:33,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:13:33,024 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:33,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:33,024 INFO L85 PathProgramCache]: Analyzing trace with hash 925626893, now seen corresponding path program 1 times [2025-02-05 16:13:33,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:33,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959311348] [2025-02-05 16:13:33,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:33,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:33,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:13:33,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:13:33,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:33,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:33,105 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:33,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:33,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959311348] [2025-02-05 16:13:33,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959311348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:33,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:33,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:33,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129033284] [2025-02-05 16:13:33,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:33,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:33,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:33,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:33,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:33,106 INFO L87 Difference]: Start difference. First operand 1399 states and 1990 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:33,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:33,127 INFO L93 Difference]: Finished difference Result 2089 states and 2974 transitions. [2025-02-05 16:13:33,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:33,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-02-05 16:13:33,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:33,129 INFO L225 Difference]: With dead ends: 2089 [2025-02-05 16:13:33,129 INFO L226 Difference]: Without dead ends: 715 [2025-02-05 16:13:33,131 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-05 16:13:33,131 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 36 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:33,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 169 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:33,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2025-02-05 16:13:33,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 713. [2025-02-05 16:13:33,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 712 states have (on average 1.398876404494382) internal successors, (996), 712 states have internal predecessors, (996), 0 states have call successors, (0), 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-05 16:13:33,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 996 transitions. [2025-02-05 16:13:33,146 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 996 transitions. Word has length 64 [2025-02-05 16:13:33,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:33,146 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 996 transitions. [2025-02-05 16:13:33,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:33,146 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 996 transitions. [2025-02-05 16:13:33,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:13:33,147 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:33,147 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:33,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:13:33,147 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:33,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:33,147 INFO L85 PathProgramCache]: Analyzing trace with hash 306649120, now seen corresponding path program 1 times [2025-02-05 16:13:33,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:33,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954608156] [2025-02-05 16:13:33,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:33,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:33,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:13:33,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:13:33,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:33,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:33,494 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:33,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:33,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954608156] [2025-02-05 16:13:33,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954608156] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:13:33,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997332348] [2025-02-05 16:13:33,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:33,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:13:33,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:13:33,497 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-05 16:13:33,499 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-05 16:13:33,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:13:33,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:13:33,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:33,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:33,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 16:13:33,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:13:33,948 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:33,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:13:34,255 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:34,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997332348] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:13:34,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:13:34,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 8] total 20 [2025-02-05 16:13:34,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68711101] [2025-02-05 16:13:34,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:13:34,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 16:13:34,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:34,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 16:13:34,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2025-02-05 16:13:34,258 INFO L87 Difference]: Start difference. First operand 713 states and 996 transitions. Second operand has 20 states, 20 states have (on average 9.25) internal successors, (185), 20 states have internal predecessors, (185), 0 states have call successors, (0), 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-05 16:13:38,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:38,792 INFO L93 Difference]: Finished difference Result 7344 states and 10215 transitions. [2025-02-05 16:13:38,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2025-02-05 16:13:38,793 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 9.25) internal successors, (185), 20 states have internal predecessors, (185), 0 states have call successors, (0), 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 64 [2025-02-05 16:13:38,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:38,811 INFO L225 Difference]: With dead ends: 7344 [2025-02-05 16:13:38,811 INFO L226 Difference]: Without dead ends: 6862 [2025-02-05 16:13:38,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8715 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3340, Invalid=19010, Unknown=0, NotChecked=0, Total=22350 [2025-02-05 16:13:38,820 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 2948 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2948 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:38,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2948 Valid, 1280 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:13:38,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6862 states. [2025-02-05 16:13:38,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6862 to 5274. [2025-02-05 16:13:38,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5274 states, 5273 states have (on average 1.3686705860041721) internal successors, (7217), 5273 states have internal predecessors, (7217), 0 states have call successors, (0), 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-05 16:13:38,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5274 states to 5274 states and 7217 transitions. [2025-02-05 16:13:38,949 INFO L78 Accepts]: Start accepts. Automaton has 5274 states and 7217 transitions. Word has length 64 [2025-02-05 16:13:38,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:38,950 INFO L471 AbstractCegarLoop]: Abstraction has 5274 states and 7217 transitions. [2025-02-05 16:13:38,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.25) internal successors, (185), 20 states have internal predecessors, (185), 0 states have call successors, (0), 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-05 16:13:38,950 INFO L276 IsEmpty]: Start isEmpty. Operand 5274 states and 7217 transitions. [2025-02-05 16:13:38,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:13:38,951 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:38,951 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:38,958 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-05 16:13:39,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-05 16:13:39,152 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:39,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:39,152 INFO L85 PathProgramCache]: Analyzing trace with hash -147437684, now seen corresponding path program 1 times [2025-02-05 16:13:39,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:39,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149535148] [2025-02-05 16:13:39,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:39,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:39,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:13:39,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:13:39,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:39,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:39,220 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:13:39,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:39,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149535148] [2025-02-05 16:13:39,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149535148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:39,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:39,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:13:39,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902294224] [2025-02-05 16:13:39,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:39,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:13:39,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:39,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:13:39,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:13:39,222 INFO L87 Difference]: Start difference. First operand 5274 states and 7217 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:39,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:39,332 INFO L93 Difference]: Finished difference Result 8884 states and 12250 transitions. [2025-02-05 16:13:39,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:13:39,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-05 16:13:39,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:39,350 INFO L225 Difference]: With dead ends: 8884 [2025-02-05 16:13:39,350 INFO L226 Difference]: Without dead ends: 7705 [2025-02-05 16:13:39,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:13:39,352 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 229 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:39,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 427 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:39,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7705 states. [2025-02-05 16:13:39,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7705 to 6446. [2025-02-05 16:13:39,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6446 states, 6445 states have (on average 1.3663304887509697) internal successors, (8806), 6445 states have internal predecessors, (8806), 0 states have call successors, (0), 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-05 16:13:39,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6446 states to 6446 states and 8806 transitions. [2025-02-05 16:13:39,470 INFO L78 Accepts]: Start accepts. Automaton has 6446 states and 8806 transitions. Word has length 65 [2025-02-05 16:13:39,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:39,470 INFO L471 AbstractCegarLoop]: Abstraction has 6446 states and 8806 transitions. [2025-02-05 16:13:39,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:39,471 INFO L276 IsEmpty]: Start isEmpty. Operand 6446 states and 8806 transitions. [2025-02-05 16:13:39,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:13:39,472 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:39,473 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:39,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:13:39,473 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:39,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:39,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1497130742, now seen corresponding path program 1 times [2025-02-05 16:13:39,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:39,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406827484] [2025-02-05 16:13:39,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:39,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:39,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:13:39,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:13:39,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:39,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:39,540 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-05 16:13:39,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:39,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406827484] [2025-02-05 16:13:39,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406827484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:39,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:39,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:39,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405317628] [2025-02-05 16:13:39,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:39,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:39,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:39,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:39,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:39,543 INFO L87 Difference]: Start difference. First operand 6446 states and 8806 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:39,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:39,590 INFO L93 Difference]: Finished difference Result 9412 states and 12767 transitions. [2025-02-05 16:13:39,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:39,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-05 16:13:39,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:39,598 INFO L225 Difference]: With dead ends: 9412 [2025-02-05 16:13:39,598 INFO L226 Difference]: Without dead ends: 2991 [2025-02-05 16:13:39,604 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-05 16:13:39,605 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 24 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:39,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:39,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2025-02-05 16:13:39,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 2529. [2025-02-05 16:13:39,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2529 states, 2528 states have (on average 1.321993670886076) internal successors, (3342), 2528 states have internal predecessors, (3342), 0 states have call successors, (0), 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-05 16:13:39,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2529 states to 2529 states and 3342 transitions. [2025-02-05 16:13:39,652 INFO L78 Accepts]: Start accepts. Automaton has 2529 states and 3342 transitions. Word has length 66 [2025-02-05 16:13:39,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:39,653 INFO L471 AbstractCegarLoop]: Abstraction has 2529 states and 3342 transitions. [2025-02-05 16:13:39,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:13:39,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2529 states and 3342 transitions. [2025-02-05 16:13:39,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:13:39,653 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:39,654 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:39,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:13:39,654 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:39,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:39,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1905616524, now seen corresponding path program 1 times [2025-02-05 16:13:39,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:39,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298912860] [2025-02-05 16:13:39,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:39,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:39,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:13:39,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:13:39,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:39,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:39,943 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:39,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:39,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298912860] [2025-02-05 16:13:39,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298912860] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:13:39,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572393147] [2025-02-05 16:13:39,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:39,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:13:39,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:13:39,946 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-05 16:13:39,948 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-05 16:13:39,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:13:40,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:13:40,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:40,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:40,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-05 16:13:40,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:13:40,951 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:40,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:13:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:41,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572393147] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:13:41,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:13:41,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 31 [2025-02-05 16:13:41,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157577811] [2025-02-05 16:13:41,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:13:41,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-05 16:13:41,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:41,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-05 16:13:41,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=742, Unknown=0, NotChecked=0, Total=930 [2025-02-05 16:13:41,895 INFO L87 Difference]: Start difference. First operand 2529 states and 3342 transitions. Second operand has 31 states, 31 states have (on average 6.0) internal successors, (186), 31 states have internal predecessors, (186), 0 states have call successors, (0), 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-05 16:13:43,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:43,606 INFO L93 Difference]: Finished difference Result 15732 states and 20742 transitions. [2025-02-05 16:13:43,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-02-05 16:13:43,607 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 6.0) internal successors, (186), 31 states have internal predecessors, (186), 0 states have call successors, (0), 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 68 [2025-02-05 16:13:43,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:43,626 INFO L225 Difference]: With dead ends: 15732 [2025-02-05 16:13:43,626 INFO L226 Difference]: Without dead ends: 13235 [2025-02-05 16:13:43,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1598 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1355, Invalid=4195, Unknown=0, NotChecked=0, Total=5550 [2025-02-05 16:13:43,630 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 2274 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2274 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:43,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2274 Valid, 934 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:13:43,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13235 states. [2025-02-05 16:13:43,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13235 to 10529. [2025-02-05 16:13:43,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10529 states, 10528 states have (on average 1.2998670212765957) internal successors, (13685), 10528 states have internal predecessors, (13685), 0 states have call successors, (0), 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-05 16:13:43,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10529 states to 10529 states and 13685 transitions. [2025-02-05 16:13:43,846 INFO L78 Accepts]: Start accepts. Automaton has 10529 states and 13685 transitions. Word has length 68 [2025-02-05 16:13:43,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:43,847 INFO L471 AbstractCegarLoop]: Abstraction has 10529 states and 13685 transitions. [2025-02-05 16:13:43,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 6.0) internal successors, (186), 31 states have internal predecessors, (186), 0 states have call successors, (0), 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-05 16:13:43,847 INFO L276 IsEmpty]: Start isEmpty. Operand 10529 states and 13685 transitions. [2025-02-05 16:13:43,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:13:43,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:43,848 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:43,854 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-05 16:13:44,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 16:13:44,048 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:44,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:44,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1329234744, now seen corresponding path program 1 times [2025-02-05 16:13:44,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:44,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712943197] [2025-02-05 16:13:44,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:44,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:44,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:13:44,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:13:44,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:44,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:44,307 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:44,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:44,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712943197] [2025-02-05 16:13:44,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712943197] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:13:44,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101076523] [2025-02-05 16:13:44,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:44,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:13:44,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:13:44,309 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-05 16:13:44,311 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-05 16:13:44,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:13:44,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:13:44,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:44,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:44,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 16:13:44,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:13:44,685 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:44,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:13:45,034 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:45,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101076523] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:13:45,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:13:45,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-02-05 16:13:45,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110124876] [2025-02-05 16:13:45,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:13:45,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 16:13:45,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:45,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 16:13:45,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2025-02-05 16:13:45,036 INFO L87 Difference]: Start difference. First operand 10529 states and 13685 transitions. Second operand has 22 states, 22 states have (on average 6.590909090909091) internal successors, (145), 21 states have internal predecessors, (145), 0 states have call successors, (0), 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-05 16:13:45,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:45,677 INFO L93 Difference]: Finished difference Result 32063 states and 41874 transitions. [2025-02-05 16:13:45,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:13:45,677 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.590909090909091) internal successors, (145), 21 states have internal predecessors, (145), 0 states have call successors, (0), 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 68 [2025-02-05 16:13:45,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:45,711 INFO L225 Difference]: With dead ends: 32063 [2025-02-05 16:13:45,711 INFO L226 Difference]: Without dead ends: 22433 [2025-02-05 16:13:45,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=301, Invalid=821, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 16:13:45,719 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 1044 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:45,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 498 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:13:45,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22433 states. [2025-02-05 16:13:46,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22433 to 20489. [2025-02-05 16:13:46,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20489 states, 20488 states have (on average 1.2917317454119484) internal successors, (26465), 20488 states have internal predecessors, (26465), 0 states have call successors, (0), 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-05 16:13:46,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20489 states to 20489 states and 26465 transitions. [2025-02-05 16:13:46,165 INFO L78 Accepts]: Start accepts. Automaton has 20489 states and 26465 transitions. Word has length 68 [2025-02-05 16:13:46,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:46,166 INFO L471 AbstractCegarLoop]: Abstraction has 20489 states and 26465 transitions. [2025-02-05 16:13:46,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.590909090909091) internal successors, (145), 21 states have internal predecessors, (145), 0 states have call successors, (0), 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-05 16:13:46,166 INFO L276 IsEmpty]: Start isEmpty. Operand 20489 states and 26465 transitions. [2025-02-05 16:13:46,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:13:46,167 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:46,168 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:46,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 16:13:46,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:13:46,372 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:46,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:46,372 INFO L85 PathProgramCache]: Analyzing trace with hash -2086582979, now seen corresponding path program 1 times [2025-02-05 16:13:46,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:46,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293288959] [2025-02-05 16:13:46,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:46,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:46,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:13:46,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:13:46,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:46,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:46,403 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:46,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:46,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293288959] [2025-02-05 16:13:46,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293288959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:46,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:46,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:46,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384090930] [2025-02-05 16:13:46,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:46,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:46,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:46,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:46,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:46,404 INFO L87 Difference]: Start difference. First operand 20489 states and 26465 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-05 16:13:47,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:47,037 INFO L93 Difference]: Finished difference Result 53306 states and 68716 transitions. [2025-02-05 16:13:47,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:47,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-02-05 16:13:47,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:47,085 INFO L225 Difference]: With dead ends: 53306 [2025-02-05 16:13:47,085 INFO L226 Difference]: Without dead ends: 33149 [2025-02-05 16:13:47,102 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-05 16:13:47,103 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 35 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:47,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 209 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:47,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33149 states. [2025-02-05 16:13:47,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33149 to 30688. [2025-02-05 16:13:47,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30688 states, 30687 states have (on average 1.273601199204875) internal successors, (39083), 30687 states have internal predecessors, (39083), 0 states have call successors, (0), 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-05 16:13:47,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30688 states to 30688 states and 39083 transitions. [2025-02-05 16:13:47,882 INFO L78 Accepts]: Start accepts. Automaton has 30688 states and 39083 transitions. Word has length 69 [2025-02-05 16:13:47,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:47,882 INFO L471 AbstractCegarLoop]: Abstraction has 30688 states and 39083 transitions. [2025-02-05 16:13:47,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-05 16:13:47,883 INFO L276 IsEmpty]: Start isEmpty. Operand 30688 states and 39083 transitions. [2025-02-05 16:13:47,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:13:47,884 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:47,884 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:47,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:13:47,884 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:47,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:47,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1813200969, now seen corresponding path program 1 times [2025-02-05 16:13:47,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:47,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083274066] [2025-02-05 16:13:47,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:47,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:47,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:13:47,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:13:47,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:47,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:47,918 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:47,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:47,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083274066] [2025-02-05 16:13:47,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083274066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:47,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:47,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:47,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283169437] [2025-02-05 16:13:47,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:47,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:47,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:47,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:47,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:47,920 INFO L87 Difference]: Start difference. First operand 30688 states and 39083 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-05 16:13:48,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:48,675 INFO L93 Difference]: Finished difference Result 75076 states and 95238 transitions. [2025-02-05 16:13:48,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:48,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-02-05 16:13:48,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:48,738 INFO L225 Difference]: With dead ends: 75076 [2025-02-05 16:13:48,738 INFO L226 Difference]: Without dead ends: 45096 [2025-02-05 16:13:48,755 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-05 16:13:48,755 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 41 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:48,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 176 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:48,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45096 states. [2025-02-05 16:13:50,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45096 to 45094. [2025-02-05 16:13:50,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45094 states, 45093 states have (on average 1.2505488656775996) internal successors, (56391), 45093 states have internal predecessors, (56391), 0 states have call successors, (0), 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-05 16:13:50,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45094 states to 45094 states and 56391 transitions. [2025-02-05 16:13:50,139 INFO L78 Accepts]: Start accepts. Automaton has 45094 states and 56391 transitions. Word has length 69 [2025-02-05 16:13:50,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:50,139 INFO L471 AbstractCegarLoop]: Abstraction has 45094 states and 56391 transitions. [2025-02-05 16:13:50,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-05 16:13:50,140 INFO L276 IsEmpty]: Start isEmpty. Operand 45094 states and 56391 transitions. [2025-02-05 16:13:50,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:13:50,142 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:50,142 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:50,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:13:50,142 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:50,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:50,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1279164647, now seen corresponding path program 1 times [2025-02-05 16:13:50,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:50,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400596947] [2025-02-05 16:13:50,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:50,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:50,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:13:50,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:13:50,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:50,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:50,181 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:50,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:50,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400596947] [2025-02-05 16:13:50,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400596947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:50,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:50,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:50,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363319805] [2025-02-05 16:13:50,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:50,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:50,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:50,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:50,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:50,183 INFO L87 Difference]: Start difference. First operand 45094 states and 56391 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-05 16:13:51,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:51,059 INFO L93 Difference]: Finished difference Result 84135 states and 105016 transitions. [2025-02-05 16:13:51,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:51,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-02-05 16:13:51,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:51,108 INFO L225 Difference]: With dead ends: 84135 [2025-02-05 16:13:51,109 INFO L226 Difference]: Without dead ends: 42222 [2025-02-05 16:13:51,132 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-05 16:13:51,132 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 38 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:51,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 179 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:51,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42222 states. [2025-02-05 16:13:52,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42222 to 42220. [2025-02-05 16:13:52,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42220 states, 42219 states have (on average 1.2212274094601956) internal successors, (51559), 42219 states have internal predecessors, (51559), 0 states have call successors, (0), 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-05 16:13:52,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42220 states to 42220 states and 51559 transitions. [2025-02-05 16:13:52,104 INFO L78 Accepts]: Start accepts. Automaton has 42220 states and 51559 transitions. Word has length 69 [2025-02-05 16:13:52,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:52,104 INFO L471 AbstractCegarLoop]: Abstraction has 42220 states and 51559 transitions. [2025-02-05 16:13:52,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-05 16:13:52,104 INFO L276 IsEmpty]: Start isEmpty. Operand 42220 states and 51559 transitions. [2025-02-05 16:13:52,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:13:52,106 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:52,106 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:52,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:13:52,107 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:52,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:52,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1581880841, now seen corresponding path program 1 times [2025-02-05 16:13:52,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:52,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195483297] [2025-02-05 16:13:52,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:52,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:52,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:13:52,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:13:52,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:52,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:52,133 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:52,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:52,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195483297] [2025-02-05 16:13:52,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195483297] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:52,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:52,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:52,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176224400] [2025-02-05 16:13:52,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:52,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:52,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:52,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:52,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:52,135 INFO L87 Difference]: Start difference. First operand 42220 states and 51559 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-05 16:13:52,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:52,741 INFO L93 Difference]: Finished difference Result 54198 states and 65871 transitions. [2025-02-05 16:13:52,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:52,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-02-05 16:13:52,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:52,776 INFO L225 Difference]: With dead ends: 54198 [2025-02-05 16:13:52,776 INFO L226 Difference]: Without dead ends: 33019 [2025-02-05 16:13:52,784 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-05 16:13:52,784 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 35 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:52,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 200 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:52,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33019 states. [2025-02-05 16:13:53,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33019 to 33017. [2025-02-05 16:13:53,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33017 states, 33016 states have (on average 1.2001150957111704) internal successors, (39623), 33016 states have internal predecessors, (39623), 0 states have call successors, (0), 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-05 16:13:53,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33017 states to 33017 states and 39623 transitions. [2025-02-05 16:13:53,627 INFO L78 Accepts]: Start accepts. Automaton has 33017 states and 39623 transitions. Word has length 69 [2025-02-05 16:13:53,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:53,628 INFO L471 AbstractCegarLoop]: Abstraction has 33017 states and 39623 transitions. [2025-02-05 16:13:53,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-05 16:13:53,628 INFO L276 IsEmpty]: Start isEmpty. Operand 33017 states and 39623 transitions. [2025-02-05 16:13:53,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:13:53,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:53,631 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:53,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:13:53,631 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:53,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:53,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1971337967, now seen corresponding path program 1 times [2025-02-05 16:13:53,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:53,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685180616] [2025-02-05 16:13:53,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:53,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:53,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:13:53,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:13:53,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:53,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:53,667 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:53,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:53,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685180616] [2025-02-05 16:13:53,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685180616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:53,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:53,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:53,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340310703] [2025-02-05 16:13:53,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:53,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:53,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:53,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:53,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:53,669 INFO L87 Difference]: Start difference. First operand 33017 states and 39623 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-05 16:13:54,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:54,413 INFO L93 Difference]: Finished difference Result 49185 states and 58853 transitions. [2025-02-05 16:13:54,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:54,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-02-05 16:13:54,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:54,447 INFO L225 Difference]: With dead ends: 49185 [2025-02-05 16:13:54,447 INFO L226 Difference]: Without dead ends: 28129 [2025-02-05 16:13:54,466 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-05 16:13:54,467 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 35 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:54,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 223 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:54,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28129 states. [2025-02-05 16:13:55,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28129 to 25447. [2025-02-05 16:13:55,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25447 states, 25446 states have (on average 1.1817574471429695) internal successors, (30071), 25446 states have internal predecessors, (30071), 0 states have call successors, (0), 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-05 16:13:55,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25447 states to 25447 states and 30071 transitions. [2025-02-05 16:13:55,472 INFO L78 Accepts]: Start accepts. Automaton has 25447 states and 30071 transitions. Word has length 69 [2025-02-05 16:13:55,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:55,472 INFO L471 AbstractCegarLoop]: Abstraction has 25447 states and 30071 transitions. [2025-02-05 16:13:55,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-05 16:13:55,472 INFO L276 IsEmpty]: Start isEmpty. Operand 25447 states and 30071 transitions. [2025-02-05 16:13:55,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:13:55,474 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:55,474 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:55,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:13:55,474 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:55,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:55,475 INFO L85 PathProgramCache]: Analyzing trace with hash 83096843, now seen corresponding path program 1 times [2025-02-05 16:13:55,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:55,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885070019] [2025-02-05 16:13:55,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:55,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:55,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:13:55,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:13:55,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:55,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:55,500 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:55,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:55,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885070019] [2025-02-05 16:13:55,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885070019] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:55,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:55,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:55,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989395567] [2025-02-05 16:13:55,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:55,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:55,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:55,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:55,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:55,502 INFO L87 Difference]: Start difference. First operand 25447 states and 30071 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-05 16:13:55,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:55,921 INFO L93 Difference]: Finished difference Result 37762 states and 44537 transitions. [2025-02-05 16:13:55,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:55,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-02-05 16:13:55,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:55,947 INFO L225 Difference]: With dead ends: 37762 [2025-02-05 16:13:55,948 INFO L226 Difference]: Without dead ends: 23490 [2025-02-05 16:13:55,962 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-05 16:13:55,962 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 38 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:55,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 217 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:55,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23490 states. [2025-02-05 16:13:56,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23490 to 22611. [2025-02-05 16:13:56,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22611 states, 22610 states have (on average 1.1661654135338346) internal successors, (26367), 22610 states have internal predecessors, (26367), 0 states have call successors, (0), 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-05 16:13:56,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22611 states to 22611 states and 26367 transitions. [2025-02-05 16:13:56,493 INFO L78 Accepts]: Start accepts. Automaton has 22611 states and 26367 transitions. Word has length 69 [2025-02-05 16:13:56,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:56,493 INFO L471 AbstractCegarLoop]: Abstraction has 22611 states and 26367 transitions. [2025-02-05 16:13:56,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-05 16:13:56,493 INFO L276 IsEmpty]: Start isEmpty. Operand 22611 states and 26367 transitions. [2025-02-05 16:13:56,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:13:56,494 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:56,494 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:56,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:13:56,495 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:56,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:56,495 INFO L85 PathProgramCache]: Analyzing trace with hash 2003056614, now seen corresponding path program 1 times [2025-02-05 16:13:56,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:56,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779987418] [2025-02-05 16:13:56,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:56,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:56,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:13:56,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:13:56,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:56,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:56,554 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:56,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:56,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779987418] [2025-02-05 16:13:56,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779987418] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:13:56,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372328444] [2025-02-05 16:13:56,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:56,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:13:56,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:13:56,556 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-05 16:13:56,558 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-05 16:13:56,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:13:56,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:13:56,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:56,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:56,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 16:13:56,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:13:56,754 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:56,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:13:56,820 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:56,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372328444] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:13:56,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:13:56,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-02-05 16:13:56,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044085963] [2025-02-05 16:13:56,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:13:56,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 16:13:56,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:56,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 16:13:56,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:13:56,822 INFO L87 Difference]: Start difference. First operand 22611 states and 26367 transitions. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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-05 16:13:57,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:57,259 INFO L93 Difference]: Finished difference Result 27855 states and 32550 transitions. [2025-02-05 16:13:57,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:13:57,260 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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 70 [2025-02-05 16:13:57,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:57,286 INFO L225 Difference]: With dead ends: 27855 [2025-02-05 16:13:57,286 INFO L226 Difference]: Without dead ends: 23781 [2025-02-05 16:13:57,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 130 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:13:57,295 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 267 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:57,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 239 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:57,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23781 states. [2025-02-05 16:13:57,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23781 to 23314. [2025-02-05 16:13:57,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23314 states, 23313 states have (on average 1.1654012782567666) internal successors, (27169), 23313 states have internal predecessors, (27169), 0 states have call successors, (0), 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-05 16:13:57,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23314 states to 23314 states and 27169 transitions. [2025-02-05 16:13:57,861 INFO L78 Accepts]: Start accepts. Automaton has 23314 states and 27169 transitions. Word has length 70 [2025-02-05 16:13:57,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:57,861 INFO L471 AbstractCegarLoop]: Abstraction has 23314 states and 27169 transitions. [2025-02-05 16:13:57,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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-05 16:13:57,861 INFO L276 IsEmpty]: Start isEmpty. Operand 23314 states and 27169 transitions. [2025-02-05 16:13:57,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:13:57,862 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:57,862 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:57,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 16:13:58,063 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,SelfDestructingSolverStorable23 [2025-02-05 16:13:58,063 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:58,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:58,063 INFO L85 PathProgramCache]: Analyzing trace with hash 52756359, now seen corresponding path program 1 times [2025-02-05 16:13:58,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:58,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413382328] [2025-02-05 16:13:58,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:58,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:58,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:13:58,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:13:58,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:58,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 16:13:58,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:58,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413382328] [2025-02-05 16:13:58,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413382328] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:13:58,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:13:58,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:13:58,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42093761] [2025-02-05 16:13:58,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:13:58,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:13:58,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:13:58,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:13:58,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:13:58,090 INFO L87 Difference]: Start difference. First operand 23314 states and 27169 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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-05 16:13:58,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:13:58,454 INFO L93 Difference]: Finished difference Result 31449 states and 36620 transitions. [2025-02-05 16:13:58,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:13:58,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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 70 [2025-02-05 16:13:58,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:13:58,474 INFO L225 Difference]: With dead ends: 31449 [2025-02-05 16:13:58,474 INFO L226 Difference]: Without dead ends: 23239 [2025-02-05 16:13:58,481 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-05 16:13:58,482 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 53 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:13:58,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 156 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:13:58,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23239 states. [2025-02-05 16:13:59,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23239 to 22139. [2025-02-05 16:13:59,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22139 states, 22138 states have (on average 1.1638811094046435) internal successors, (25766), 22138 states have internal predecessors, (25766), 0 states have call successors, (0), 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-05 16:13:59,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22139 states to 22139 states and 25766 transitions. [2025-02-05 16:13:59,196 INFO L78 Accepts]: Start accepts. Automaton has 22139 states and 25766 transitions. Word has length 70 [2025-02-05 16:13:59,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:13:59,196 INFO L471 AbstractCegarLoop]: Abstraction has 22139 states and 25766 transitions. [2025-02-05 16:13:59,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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-05 16:13:59,196 INFO L276 IsEmpty]: Start isEmpty. Operand 22139 states and 25766 transitions. [2025-02-05 16:13:59,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:13:59,198 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:13:59,198 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:13:59,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:13:59,198 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:13:59,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:13:59,198 INFO L85 PathProgramCache]: Analyzing trace with hash -586503566, now seen corresponding path program 1 times [2025-02-05 16:13:59,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:13:59,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660463271] [2025-02-05 16:13:59,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:59,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:13:59,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:13:59,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:13:59,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:59,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:59,747 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:13:59,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:13:59,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660463271] [2025-02-05 16:13:59,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660463271] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:13:59,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902059137] [2025-02-05 16:13:59,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:13:59,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:13:59,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:13:59,750 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-05 16:13:59,750 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-05 16:13:59,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:13:59,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:13:59,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:13:59,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:13:59,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 16:13:59,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:14:00,291 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:00,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:14:00,986 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:00,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902059137] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:14:00,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:14:00,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-02-05 16:14:00,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152899817] [2025-02-05 16:14:00,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:14:00,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-05 16:14:00,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:00,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-05 16:14:00,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=945, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 16:14:00,987 INFO L87 Difference]: Start difference. First operand 22139 states and 25766 transitions. Second operand has 33 states, 33 states have (on average 5.696969696969697) internal successors, (188), 33 states have internal predecessors, (188), 0 states have call successors, (0), 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-05 16:14:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:06,633 INFO L93 Difference]: Finished difference Result 45790 states and 53150 transitions. [2025-02-05 16:14:06,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2025-02-05 16:14:06,633 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 5.696969696969697) internal successors, (188), 33 states have internal predecessors, (188), 0 states have call successors, (0), 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 70 [2025-02-05 16:14:06,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:06,671 INFO L225 Difference]: With dead ends: 45790 [2025-02-05 16:14:06,672 INFO L226 Difference]: Without dead ends: 30562 [2025-02-05 16:14:06,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7191 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3819, Invalid=16773, Unknown=0, NotChecked=0, Total=20592 [2025-02-05 16:14:06,692 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 4725 mSDsluCounter, 2050 mSDsCounter, 0 mSdLazyCounter, 1771 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4725 SdHoareTripleChecker+Valid, 2165 SdHoareTripleChecker+Invalid, 1864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:06,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4725 Valid, 2165 Invalid, 1864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1771 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:14:06,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30562 states. [2025-02-05 16:14:07,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30562 to 18566. [2025-02-05 16:14:07,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18566 states, 18565 states have (on average 1.1592782116886615) internal successors, (21522), 18565 states have internal predecessors, (21522), 0 states have call successors, (0), 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-05 16:14:07,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18566 states to 18566 states and 21522 transitions. [2025-02-05 16:14:07,372 INFO L78 Accepts]: Start accepts. Automaton has 18566 states and 21522 transitions. Word has length 70 [2025-02-05 16:14:07,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:07,373 INFO L471 AbstractCegarLoop]: Abstraction has 18566 states and 21522 transitions. [2025-02-05 16:14:07,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.696969696969697) internal successors, (188), 33 states have internal predecessors, (188), 0 states have call successors, (0), 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-05 16:14:07,373 INFO L276 IsEmpty]: Start isEmpty. Operand 18566 states and 21522 transitions. [2025-02-05 16:14:07,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 16:14:07,379 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:07,379 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:14:07,386 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-05 16:14:07,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-05 16:14:07,579 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:07,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:07,580 INFO L85 PathProgramCache]: Analyzing trace with hash -2009451728, now seen corresponding path program 1 times [2025-02-05 16:14:07,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:07,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215458043] [2025-02-05 16:14:07,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:07,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:07,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 16:14:07,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 16:14:07,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:07,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:08,678 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 24 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:08,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:08,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215458043] [2025-02-05 16:14:08,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215458043] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:14:08,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790934049] [2025-02-05 16:14:08,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:08,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:14:08,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:14:08,681 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-05 16:14:08,682 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-05 16:14:08,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 16:14:08,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 16:14:08,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:08,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:08,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 16:14:08,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:14:09,403 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 48 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:09,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:14:11,136 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 33 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:11,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790934049] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:14:11,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:14:11,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 12] total 41 [2025-02-05 16:14:11,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854489248] [2025-02-05 16:14:11,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:14:11,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-02-05 16:14:11,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:11,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-02-05 16:14:11,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1496, Unknown=0, NotChecked=0, Total=1640 [2025-02-05 16:14:11,138 INFO L87 Difference]: Start difference. First operand 18566 states and 21522 transitions. Second operand has 41 states, 41 states have (on average 7.463414634146342) internal successors, (306), 41 states have internal predecessors, (306), 0 states have call successors, (0), 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-05 16:14:19,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:19,283 INFO L93 Difference]: Finished difference Result 49215 states and 56931 transitions. [2025-02-05 16:14:19,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2025-02-05 16:14:19,283 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 7.463414634146342) internal successors, (306), 41 states have internal predecessors, (306), 0 states have call successors, (0), 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 113 [2025-02-05 16:14:19,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:19,321 INFO L225 Difference]: With dead ends: 49215 [2025-02-05 16:14:19,322 INFO L226 Difference]: Without dead ends: 42890 [2025-02-05 16:14:19,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7866 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=4890, Invalid=18980, Unknown=0, NotChecked=0, Total=23870 [2025-02-05 16:14:19,335 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 3786 mSDsluCounter, 1955 mSDsCounter, 0 mSdLazyCounter, 1870 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3786 SdHoareTripleChecker+Valid, 2068 SdHoareTripleChecker+Invalid, 2043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:19,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3786 Valid, 2068 Invalid, 2043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1870 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:14:19,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42890 states. [2025-02-05 16:14:20,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42890 to 25834. [2025-02-05 16:14:20,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25834 states, 25833 states have (on average 1.1600665815042774) internal successors, (29968), 25833 states have internal predecessors, (29968), 0 states have call successors, (0), 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-05 16:14:20,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25834 states to 25834 states and 29968 transitions. [2025-02-05 16:14:20,120 INFO L78 Accepts]: Start accepts. Automaton has 25834 states and 29968 transitions. Word has length 113 [2025-02-05 16:14:20,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:20,121 INFO L471 AbstractCegarLoop]: Abstraction has 25834 states and 29968 transitions. [2025-02-05 16:14:20,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 7.463414634146342) internal successors, (306), 41 states have internal predecessors, (306), 0 states have call successors, (0), 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-05 16:14:20,121 INFO L276 IsEmpty]: Start isEmpty. Operand 25834 states and 29968 transitions. [2025-02-05 16:14:20,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 16:14:20,126 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:20,126 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:14:20,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 16:14:20,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-05 16:14:20,331 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:20,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:20,331 INFO L85 PathProgramCache]: Analyzing trace with hash 314126138, now seen corresponding path program 1 times [2025-02-05 16:14:20,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:20,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763559260] [2025-02-05 16:14:20,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:20,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:20,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 16:14:20,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 16:14:20,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:20,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:20,835 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 36 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:20,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:20,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763559260] [2025-02-05 16:14:20,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763559260] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:14:20,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363998929] [2025-02-05 16:14:20,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:20,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:14:20,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:14:20,838 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:14:20,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 16:14:20,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 16:14:20,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 16:14:20,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:20,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:20,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-05 16:14:20,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:14:21,476 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 40 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:21,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:14:22,537 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 36 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:22,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363998929] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:14:22,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:14:22,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 29 [2025-02-05 16:14:22,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930848803] [2025-02-05 16:14:22,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:14:22,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 16:14:22,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:22,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 16:14:22,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2025-02-05 16:14:22,538 INFO L87 Difference]: Start difference. First operand 25834 states and 29968 transitions. Second operand has 30 states, 30 states have (on average 8.966666666666667) internal successors, (269), 29 states have internal predecessors, (269), 0 states have call successors, (0), 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-05 16:14:25,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:25,533 INFO L93 Difference]: Finished difference Result 46514 states and 53821 transitions. [2025-02-05 16:14:25,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-02-05 16:14:25,533 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 8.966666666666667) internal successors, (269), 29 states have internal predecessors, (269), 0 states have call successors, (0), 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 114 [2025-02-05 16:14:25,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:25,562 INFO L225 Difference]: With dead ends: 46514 [2025-02-05 16:14:25,562 INFO L226 Difference]: Without dead ends: 30807 [2025-02-05 16:14:25,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1755 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1477, Invalid=5833, Unknown=0, NotChecked=0, Total=7310 [2025-02-05 16:14:25,575 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 1301 mSDsluCounter, 2011 mSDsCounter, 0 mSdLazyCounter, 1876 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1301 SdHoareTripleChecker+Valid, 2199 SdHoareTripleChecker+Invalid, 1917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:25,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1301 Valid, 2199 Invalid, 1917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1876 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:14:25,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30807 states. [2025-02-05 16:14:26,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30807 to 20542. [2025-02-05 16:14:26,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20542 states, 20541 states have (on average 1.1494571831945863) internal successors, (23611), 20541 states have internal predecessors, (23611), 0 states have call successors, (0), 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-05 16:14:26,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20542 states to 20542 states and 23611 transitions. [2025-02-05 16:14:26,296 INFO L78 Accepts]: Start accepts. Automaton has 20542 states and 23611 transitions. Word has length 114 [2025-02-05 16:14:26,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:26,296 INFO L471 AbstractCegarLoop]: Abstraction has 20542 states and 23611 transitions. [2025-02-05 16:14:26,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.966666666666667) internal successors, (269), 29 states have internal predecessors, (269), 0 states have call successors, (0), 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-05 16:14:26,297 INFO L276 IsEmpty]: Start isEmpty. Operand 20542 states and 23611 transitions. [2025-02-05 16:14:26,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 16:14:26,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:26,301 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:14:26,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 16:14:26,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:14:26,501 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:26,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:26,502 INFO L85 PathProgramCache]: Analyzing trace with hash 332874411, now seen corresponding path program 1 times [2025-02-05 16:14:26,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:26,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285823624] [2025-02-05 16:14:26,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:26,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:26,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 16:14:26,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 16:14:26,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:26,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 34 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:26,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:26,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285823624] [2025-02-05 16:14:26,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285823624] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:14:26,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921280065] [2025-02-05 16:14:26,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:26,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:14:26,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:14:26,906 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:14:26,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 16:14:26,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 16:14:27,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 16:14:27,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:27,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:27,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 16:14:27,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:14:27,603 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 49 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:27,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:14:28,636 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 34 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:28,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921280065] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:14:28,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:14:28,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 11] total 35 [2025-02-05 16:14:28,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354432371] [2025-02-05 16:14:28,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:14:28,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-05 16:14:28,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:28,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-05 16:14:28,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1069, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 16:14:28,638 INFO L87 Difference]: Start difference. First operand 20542 states and 23611 transitions. Second operand has 35 states, 35 states have (on average 8.228571428571428) internal successors, (288), 35 states have internal predecessors, (288), 0 states have call successors, (0), 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-05 16:14:32,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:32,834 INFO L93 Difference]: Finished difference Result 65162 states and 74944 transitions. [2025-02-05 16:14:32,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-02-05 16:14:32,834 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 8.228571428571428) internal successors, (288), 35 states have internal predecessors, (288), 0 states have call successors, (0), 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 114 [2025-02-05 16:14:32,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:32,894 INFO L225 Difference]: With dead ends: 65162 [2025-02-05 16:14:32,895 INFO L226 Difference]: Without dead ends: 56566 [2025-02-05 16:14:32,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 208 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2623 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1662, Invalid=8238, Unknown=0, NotChecked=0, Total=9900 [2025-02-05 16:14:32,913 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 3356 mSDsluCounter, 2570 mSDsCounter, 0 mSdLazyCounter, 1548 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3356 SdHoareTripleChecker+Valid, 2740 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:32,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3356 Valid, 2740 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1548 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:14:32,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56566 states. [2025-02-05 16:14:34,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56566 to 24888. [2025-02-05 16:14:34,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24888 states, 24887 states have (on average 1.1448145618194239) internal successors, (28491), 24887 states have internal predecessors, (28491), 0 states have call successors, (0), 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-05 16:14:34,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24888 states to 24888 states and 28491 transitions. [2025-02-05 16:14:34,142 INFO L78 Accepts]: Start accepts. Automaton has 24888 states and 28491 transitions. Word has length 114 [2025-02-05 16:14:34,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:34,143 INFO L471 AbstractCegarLoop]: Abstraction has 24888 states and 28491 transitions. [2025-02-05 16:14:34,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 8.228571428571428) internal successors, (288), 35 states have internal predecessors, (288), 0 states have call successors, (0), 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-05 16:14:34,143 INFO L276 IsEmpty]: Start isEmpty. Operand 24888 states and 28491 transitions. [2025-02-05 16:14:34,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 16:14:34,147 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:34,148 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:14:34,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-05 16:14:34,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-05 16:14:34,348 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:34,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:34,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1928420847, now seen corresponding path program 1 times [2025-02-05 16:14:34,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:34,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262812728] [2025-02-05 16:14:34,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:34,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:34,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 16:14:34,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 16:14:34,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:34,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:34,957 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 32 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:34,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:34,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262812728] [2025-02-05 16:14:34,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262812728] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:14:34,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080803659] [2025-02-05 16:14:34,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:34,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:14:34,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:14:34,959 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:14:34,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 16:14:35,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 16:14:35,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 16:14:35,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:35,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:35,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-05 16:14:35,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:14:36,092 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 48 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:36,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:14:37,840 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 37 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:37,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080803659] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:14:37,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:14:37,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 13] total 40 [2025-02-05 16:14:37,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112946553] [2025-02-05 16:14:37,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:14:37,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-02-05 16:14:37,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:37,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-02-05 16:14:37,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1385, Unknown=0, NotChecked=0, Total=1560 [2025-02-05 16:14:37,841 INFO L87 Difference]: Start difference. First operand 24888 states and 28491 transitions. Second operand has 40 states, 40 states have (on average 7.25) internal successors, (290), 40 states have internal predecessors, (290), 0 states have call successors, (0), 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-05 16:14:41,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:41,529 INFO L93 Difference]: Finished difference Result 43937 states and 50475 transitions. [2025-02-05 16:14:41,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-02-05 16:14:41,530 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 7.25) internal successors, (290), 40 states have internal predecessors, (290), 0 states have call successors, (0), 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 114 [2025-02-05 16:14:41,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:41,574 INFO L225 Difference]: With dead ends: 43937 [2025-02-05 16:14:41,574 INFO L226 Difference]: Without dead ends: 37272 [2025-02-05 16:14:41,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1297, Invalid=5183, Unknown=0, NotChecked=0, Total=6480 [2025-02-05 16:14:41,586 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 2283 mSDsluCounter, 2266 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2283 SdHoareTripleChecker+Valid, 2404 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:41,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2283 Valid, 2404 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1539 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:14:41,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37272 states. [2025-02-05 16:14:42,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37272 to 26600. [2025-02-05 16:14:42,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26600 states, 26599 states have (on average 1.146396481070717) internal successors, (30493), 26599 states have internal predecessors, (30493), 0 states have call successors, (0), 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-05 16:14:42,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26600 states to 26600 states and 30493 transitions. [2025-02-05 16:14:42,761 INFO L78 Accepts]: Start accepts. Automaton has 26600 states and 30493 transitions. Word has length 114 [2025-02-05 16:14:42,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:42,761 INFO L471 AbstractCegarLoop]: Abstraction has 26600 states and 30493 transitions. [2025-02-05 16:14:42,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 7.25) internal successors, (290), 40 states have internal predecessors, (290), 0 states have call successors, (0), 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-05 16:14:42,761 INFO L276 IsEmpty]: Start isEmpty. Operand 26600 states and 30493 transitions. [2025-02-05 16:14:42,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 16:14:42,766 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:42,766 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:14:42,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-05 16:14:42,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:14:42,967 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:42,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:42,968 INFO L85 PathProgramCache]: Analyzing trace with hash -411535797, now seen corresponding path program 1 times [2025-02-05 16:14:42,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:42,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201400187] [2025-02-05 16:14:42,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:42,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:42,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 16:14:42,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 16:14:42,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:42,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:43,411 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 26 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:43,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:43,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201400187] [2025-02-05 16:14:43,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201400187] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:14:43,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490526428] [2025-02-05 16:14:43,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:43,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:14:43,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:14:43,414 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:14:43,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 16:14:43,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 16:14:43,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 16:14:43,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:43,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:43,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 16:14:43,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:14:44,320 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 47 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:44,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:14:44,958 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 47 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:44,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490526428] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:14:44,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:14:44,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 29 [2025-02-05 16:14:44,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917834568] [2025-02-05 16:14:44,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:14:44,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-05 16:14:44,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:44,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-05 16:14:44,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2025-02-05 16:14:44,959 INFO L87 Difference]: Start difference. First operand 26600 states and 30493 transitions. Second operand has 29 states, 29 states have (on average 9.620689655172415) internal successors, (279), 29 states have internal predecessors, (279), 0 states have call successors, (0), 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-05 16:14:49,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:49,405 INFO L93 Difference]: Finished difference Result 60120 states and 68990 transitions. [2025-02-05 16:14:49,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-02-05 16:14:49,405 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 9.620689655172415) internal successors, (279), 29 states have internal predecessors, (279), 0 states have call successors, (0), 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 115 [2025-02-05 16:14:49,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:49,445 INFO L225 Difference]: With dead ends: 60120 [2025-02-05 16:14:49,445 INFO L226 Difference]: Without dead ends: 40476 [2025-02-05 16:14:49,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2062 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1547, Invalid=6643, Unknown=0, NotChecked=0, Total=8190 [2025-02-05 16:14:49,466 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1749 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 1773 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1749 SdHoareTripleChecker+Valid, 1924 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:49,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1749 Valid, 1924 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1773 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:14:49,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40476 states. [2025-02-05 16:14:50,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40476 to 18398. [2025-02-05 16:14:50,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18398 states, 18397 states have (on average 1.1376311355112247) internal successors, (20929), 18397 states have internal predecessors, (20929), 0 states have call successors, (0), 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-05 16:14:50,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18398 states to 18398 states and 20929 transitions. [2025-02-05 16:14:50,563 INFO L78 Accepts]: Start accepts. Automaton has 18398 states and 20929 transitions. Word has length 115 [2025-02-05 16:14:50,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:50,563 INFO L471 AbstractCegarLoop]: Abstraction has 18398 states and 20929 transitions. [2025-02-05 16:14:50,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.620689655172415) internal successors, (279), 29 states have internal predecessors, (279), 0 states have call successors, (0), 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-05 16:14:50,563 INFO L276 IsEmpty]: Start isEmpty. Operand 18398 states and 20929 transitions. [2025-02-05 16:14:50,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 16:14:50,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:50,567 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:14:50,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-05 16:14:50,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:14:50,768 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:50,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:50,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1188658367, now seen corresponding path program 1 times [2025-02-05 16:14:50,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:50,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242568400] [2025-02-05 16:14:50,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:50,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:50,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 16:14:50,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 16:14:50,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:50,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:51,329 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 33 proven. 51 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 16:14:51,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:51,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242568400] [2025-02-05 16:14:51,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242568400] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:14:51,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090738683] [2025-02-05 16:14:51,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:51,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:14:51,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:14:51,334 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:14:51,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 16:14:51,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 16:14:51,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 16:14:51,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:51,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:51,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 16:14:51,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:14:51,868 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 52 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-05 16:14:51,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:14:53,028 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 52 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-05 16:14:53,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090738683] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:14:53,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:14:53,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2025-02-05 16:14:53,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401972010] [2025-02-05 16:14:53,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:14:53,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-05 16:14:53,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:53,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-05 16:14:53,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2025-02-05 16:14:53,029 INFO L87 Difference]: Start difference. First operand 18398 states and 20929 transitions. Second operand has 31 states, 31 states have (on average 7.483870967741935) internal successors, (232), 31 states have internal predecessors, (232), 0 states have call successors, (0), 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-05 16:14:54,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:54,864 INFO L93 Difference]: Finished difference Result 26791 states and 30508 transitions. [2025-02-05 16:14:54,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 16:14:54,864 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 7.483870967741935) internal successors, (232), 31 states have internal predecessors, (232), 0 states have call successors, (0), 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 115 [2025-02-05 16:14:54,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:54,884 INFO L225 Difference]: With dead ends: 26791 [2025-02-05 16:14:54,884 INFO L226 Difference]: Without dead ends: 22748 [2025-02-05 16:14:54,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=543, Invalid=1619, Unknown=0, NotChecked=0, Total=2162 [2025-02-05 16:14:54,888 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 1157 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:54,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 748 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:14:54,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22748 states.