./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-36.i --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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-36.i -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 08d675ba4148739e9e7cf1bbda146cfc1e7cae9e235e349f1daedec05eaa7d10 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:34:43,520 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:34:43,581 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:34:43,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:34:43,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:34:43,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:34:43,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:34:43,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:34:43,616 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:34:43,616 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:34:43,617 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:34:43,617 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:34:43,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:34:43,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:34:43,617 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:34:43,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:34:43,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:34:43,617 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:34:43,618 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:34:43,618 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:34:43,618 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:34:43,618 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:34:43,618 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:34:43,618 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:34:43,618 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:34:43,619 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:34:43,619 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:34:43,619 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:34:43,619 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:34:43,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:34:43,619 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:34:43,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:34:43,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:34:43,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:34:43,620 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:34:43,620 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:34:43,620 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:34:43,620 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:34:43,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:34:43,620 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:34:43,620 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:34:43,620 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:34:43,620 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:34:43,620 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 -> 08d675ba4148739e9e7cf1bbda146cfc1e7cae9e235e349f1daedec05eaa7d10 [2025-02-05 21:34:43,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:34:43,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:34:43,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:34:43,872 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:34:43,873 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:34:43,873 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-36.i [2025-02-05 21:34:44,968 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbe78be76/fa9f88f2f0a645859cf10a023da4003a/FLAGf978cd988 [2025-02-05 21:34:45,228 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:34:45,228 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-36.i [2025-02-05 21:34:45,235 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbe78be76/fa9f88f2f0a645859cf10a023da4003a/FLAGf978cd988 [2025-02-05 21:34:45,245 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbe78be76/fa9f88f2f0a645859cf10a023da4003a [2025-02-05 21:34:45,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:34:45,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:34:45,249 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:34:45,249 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:34:45,253 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:34:45,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:34:45" (1/1) ... [2025-02-05 21:34:45,256 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@230811b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:45, skipping insertion in model container [2025-02-05 21:34:45,256 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:34:45" (1/1) ... [2025-02-05 21:34:45,280 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:34:45,371 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-36.i[916,929] [2025-02-05 21:34:45,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:34:45,494 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:34:45,503 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-36.i[916,929] [2025-02-05 21:34:45,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:34:45,581 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:34:45,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:45 WrapperNode [2025-02-05 21:34:45,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:34:45,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:34:45,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:34:45,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:34:45,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:45" (1/1) ... [2025-02-05 21:34:45,603 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:45" (1/1) ... [2025-02-05 21:34:45,637 INFO L138 Inliner]: procedures = 26, calls = 105, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 612 [2025-02-05 21:34:45,637 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:34:45,638 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:34:45,638 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:34:45,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:34:45,644 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:45" (1/1) ... [2025-02-05 21:34:45,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:45" (1/1) ... [2025-02-05 21:34:45,649 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:45" (1/1) ... [2025-02-05 21:34:45,666 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 21:34:45,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:45" (1/1) ... [2025-02-05 21:34:45,666 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:45" (1/1) ... [2025-02-05 21:34:45,680 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:45" (1/1) ... [2025-02-05 21:34:45,688 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:45" (1/1) ... [2025-02-05 21:34:45,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:45" (1/1) ... [2025-02-05 21:34:45,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:45" (1/1) ... [2025-02-05 21:34:45,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:34:45,701 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:34:45,701 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:34:45,701 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:34:45,702 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:45" (1/1) ... [2025-02-05 21:34:45,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:34:45,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:34:45,733 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 21:34:45,742 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 21:34:45,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:34:45,762 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:34:45,762 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:34:45,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:34:45,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:34:45,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:34:45,860 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:34:45,862 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:34:46,548 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-05 21:34:46,548 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:34:46,566 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:34:46,566 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-05 21:34:46,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:34:46 BoogieIcfgContainer [2025-02-05 21:34:46,567 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:34:46,568 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:34:46,568 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:34:46,571 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:34:46,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:34:45" (1/3) ... [2025-02-05 21:34:46,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133cc94d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:34:46, skipping insertion in model container [2025-02-05 21:34:46,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:34:45" (2/3) ... [2025-02-05 21:34:46,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133cc94d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:34:46, skipping insertion in model container [2025-02-05 21:34:46,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:34:46" (3/3) ... [2025-02-05 21:34:46,573 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-36.i [2025-02-05 21:34:46,582 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:34:46,584 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-36.i that has 2 procedures, 262 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:34:46,622 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:34:46,629 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;@61f768d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:34:46,629 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:34:46,632 INFO L276 IsEmpty]: Start isEmpty. Operand has 262 states, 167 states have (on average 1.4910179640718564) internal successors, (249), 168 states have internal predecessors, (249), 92 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-05 21:34:46,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-02-05 21:34:46,650 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:34:46,651 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:46,651 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:34:46,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:34:46,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1322637351, now seen corresponding path program 1 times [2025-02-05 21:34:46,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:34:46,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992938192] [2025-02-05 21:34:46,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:46,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:34:46,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-02-05 21:34:46,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-02-05 21:34:46,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:46,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:47,160 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 16562 trivial. 0 not checked. [2025-02-05 21:34:47,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:47,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992938192] [2025-02-05 21:34:47,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992938192] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:34:47,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855911783] [2025-02-05 21:34:47,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:47,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:34:47,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:34:47,170 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 21:34:47,182 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 21:34:47,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-02-05 21:34:47,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-02-05 21:34:47,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:47,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:47,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 1249 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:34:47,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:34:47,481 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 16562 trivial. 0 not checked. [2025-02-05 21:34:47,482 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:34:47,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855911783] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:34:47,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:34:47,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:34:47,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511968724] [2025-02-05 21:34:47,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:34:47,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:34:47,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:47,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:34:47,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:34:47,502 INFO L87 Difference]: Start difference. First operand has 262 states, 167 states have (on average 1.4910179640718564) internal successors, (249), 168 states have internal predecessors, (249), 92 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) Second operand has 2 states, 2 states have (on average 59.5) internal successors, (119), 2 states have internal predecessors, (119), 2 states have call successors, (92), 2 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 2 states have call successors, (92) [2025-02-05 21:34:47,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:34:47,580 INFO L93 Difference]: Finished difference Result 514 states and 947 transitions. [2025-02-05 21:34:47,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:34:47,582 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 59.5) internal successors, (119), 2 states have internal predecessors, (119), 2 states have call successors, (92), 2 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 2 states have call successors, (92) Word has length 574 [2025-02-05 21:34:47,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:34:47,587 INFO L225 Difference]: With dead ends: 514 [2025-02-05 21:34:47,587 INFO L226 Difference]: Without dead ends: 255 [2025-02-05 21:34:47,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 575 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 21:34:47,592 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:34:47,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 406 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:34:47,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-02-05 21:34:47,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2025-02-05 21:34:47,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 161 states have (on average 1.453416149068323) internal successors, (234), 161 states have internal predecessors, (234), 92 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-05 21:34:47,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 418 transitions. [2025-02-05 21:34:47,663 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 418 transitions. Word has length 574 [2025-02-05 21:34:47,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:34:47,665 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 418 transitions. [2025-02-05 21:34:47,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 59.5) internal successors, (119), 2 states have internal predecessors, (119), 2 states have call successors, (92), 2 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 2 states have call successors, (92) [2025-02-05 21:34:47,666 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 418 transitions. [2025-02-05 21:34:47,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-02-05 21:34:47,675 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:34:47,675 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:47,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 21:34:47,879 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,SelfDestructingSolverStorable0 [2025-02-05 21:34:47,879 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:34:47,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:34:47,880 INFO L85 PathProgramCache]: Analyzing trace with hash -24983932, now seen corresponding path program 1 times [2025-02-05 21:34:47,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:34:47,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53685941] [2025-02-05 21:34:47,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:47,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:34:47,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-02-05 21:34:47,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-02-05 21:34:47,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:47,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:48,560 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-02-05 21:34:48,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:48,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53685941] [2025-02-05 21:34:48,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53685941] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:34:48,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:34:48,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:34:48,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152913832] [2025-02-05 21:34:48,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:34:48,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:34:48,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:48,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:34:48,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:34:48,563 INFO L87 Difference]: Start difference. First operand 255 states and 418 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-02-05 21:34:48,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:34:48,651 INFO L93 Difference]: Finished difference Result 657 states and 1078 transitions. [2025-02-05 21:34:48,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:34:48,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 574 [2025-02-05 21:34:48,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:34:48,657 INFO L225 Difference]: With dead ends: 657 [2025-02-05 21:34:48,659 INFO L226 Difference]: Without dead ends: 405 [2025-02-05 21:34:48,661 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 21:34:48,662 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 208 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:34:48,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 894 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:34:48,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-02-05 21:34:48,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 402. [2025-02-05 21:34:48,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 269 states have (on average 1.479553903345725) internal successors, (398), 270 states have internal predecessors, (398), 130 states have call successors, (130), 2 states have call predecessors, (130), 2 states have return successors, (130), 129 states have call predecessors, (130), 130 states have call successors, (130) [2025-02-05 21:34:48,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 658 transitions. [2025-02-05 21:34:48,721 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 658 transitions. Word has length 574 [2025-02-05 21:34:48,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:34:48,723 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 658 transitions. [2025-02-05 21:34:48,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-02-05 21:34:48,724 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 658 transitions. [2025-02-05 21:34:48,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-02-05 21:34:48,733 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:34:48,733 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:48,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:34:48,733 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:34:48,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:34:48,735 INFO L85 PathProgramCache]: Analyzing trace with hash -535518109, now seen corresponding path program 1 times [2025-02-05 21:34:48,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:34:48,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736736705] [2025-02-05 21:34:48,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:48,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:34:48,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-02-05 21:34:48,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-02-05 21:34:48,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:48,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:49,287 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-02-05 21:34:49,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:49,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736736705] [2025-02-05 21:34:49,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736736705] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:34:49,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:34:49,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:34:49,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758700470] [2025-02-05 21:34:49,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:34:49,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:34:49,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:49,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:34:49,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:34:49,289 INFO L87 Difference]: Start difference. First operand 402 states and 658 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-02-05 21:34:49,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:34:49,408 INFO L93 Difference]: Finished difference Result 1200 states and 1968 transitions. [2025-02-05 21:34:49,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:34:49,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 574 [2025-02-05 21:34:49,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:34:49,416 INFO L225 Difference]: With dead ends: 1200 [2025-02-05 21:34:49,416 INFO L226 Difference]: Without dead ends: 801 [2025-02-05 21:34:49,418 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 21:34:49,418 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 234 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:34:49,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 801 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:34:49,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2025-02-05 21:34:49,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 799. [2025-02-05 21:34:49,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 534 states have (on average 1.4794007490636705) internal successors, (790), 536 states have internal predecessors, (790), 260 states have call successors, (260), 4 states have call predecessors, (260), 4 states have return successors, (260), 258 states have call predecessors, (260), 260 states have call successors, (260) [2025-02-05 21:34:49,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1310 transitions. [2025-02-05 21:34:49,543 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1310 transitions. Word has length 574 [2025-02-05 21:34:49,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:34:49,544 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1310 transitions. [2025-02-05 21:34:49,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-02-05 21:34:49,545 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1310 transitions. [2025-02-05 21:34:49,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-02-05 21:34:49,550 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:34:49,550 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:49,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:34:49,551 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:34:49,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:34:49,551 INFO L85 PathProgramCache]: Analyzing trace with hash -602524862, now seen corresponding path program 1 times [2025-02-05 21:34:49,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:34:49,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466533710] [2025-02-05 21:34:49,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:49,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:34:49,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-02-05 21:34:49,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-02-05 21:34:49,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:49,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:50,055 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-02-05 21:34:50,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:50,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466533710] [2025-02-05 21:34:50,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466533710] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:34:50,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:34:50,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:34:50,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303203379] [2025-02-05 21:34:50,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:34:50,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:34:50,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:50,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:34:50,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:34:50,058 INFO L87 Difference]: Start difference. First operand 799 states and 1310 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-02-05 21:34:50,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:34:50,462 INFO L93 Difference]: Finished difference Result 3023 states and 4975 transitions. [2025-02-05 21:34:50,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:34:50,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 574 [2025-02-05 21:34:50,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:34:50,473 INFO L225 Difference]: With dead ends: 3023 [2025-02-05 21:34:50,473 INFO L226 Difference]: Without dead ends: 2227 [2025-02-05 21:34:50,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:34:50,475 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 892 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:34:50,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 1577 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:34:50,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2025-02-05 21:34:50,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 1905. [2025-02-05 21:34:50,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1905 states, 1384 states have (on average 1.51878612716763) internal successors, (2102), 1394 states have internal predecessors, (2102), 508 states have call successors, (508), 12 states have call predecessors, (508), 12 states have return successors, (508), 498 states have call predecessors, (508), 508 states have call successors, (508) [2025-02-05 21:34:50,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1905 states and 3118 transitions. [2025-02-05 21:34:50,631 INFO L78 Accepts]: Start accepts. Automaton has 1905 states and 3118 transitions. Word has length 574 [2025-02-05 21:34:50,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:34:50,632 INFO L471 AbstractCegarLoop]: Abstraction has 1905 states and 3118 transitions. [2025-02-05 21:34:50,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-02-05 21:34:50,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1905 states and 3118 transitions. [2025-02-05 21:34:50,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-02-05 21:34:50,635 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:34:50,636 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:50,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:34:50,636 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:34:50,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:34:50,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1206150241, now seen corresponding path program 1 times [2025-02-05 21:34:50,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:34:50,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080443400] [2025-02-05 21:34:50,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:50,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:34:50,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-02-05 21:34:50,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-02-05 21:34:50,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:50,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:52,123 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-02-05 21:34:52,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:52,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080443400] [2025-02-05 21:34:52,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080443400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:34:52,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:34:52,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 21:34:52,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936023283] [2025-02-05 21:34:52,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:34:52,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 21:34:52,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:52,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 21:34:52,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-05 21:34:52,125 INFO L87 Difference]: Start difference. First operand 1905 states and 3118 transitions. Second operand has 12 states, 12 states have (on average 9.75) internal successors, (117), 12 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-02-05 21:34:56,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:34:56,103 INFO L93 Difference]: Finished difference Result 19603 states and 31776 transitions. [2025-02-05 21:34:56,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 21:34:56,104 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.75) internal successors, (117), 12 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 574 [2025-02-05 21:34:56,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:34:56,199 INFO L225 Difference]: With dead ends: 19603 [2025-02-05 21:34:56,200 INFO L226 Difference]: Without dead ends: 17701 [2025-02-05 21:34:56,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2025-02-05 21:34:56,214 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 4025 mSDsluCounter, 3835 mSDsCounter, 0 mSdLazyCounter, 2376 mSolverCounterSat, 1141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4025 SdHoareTripleChecker+Valid, 4588 SdHoareTripleChecker+Invalid, 3517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1141 IncrementalHoareTripleChecker+Valid, 2376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:34:56,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4025 Valid, 4588 Invalid, 3517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1141 Valid, 2376 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 21:34:56,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17701 states. [2025-02-05 21:34:57,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17701 to 10469. [2025-02-05 21:34:57,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10469 states, 7574 states have (on average 1.502508581991022) internal successors, (11380), 7646 states have internal predecessors, (11380), 2816 states have call successors, (2816), 78 states have call predecessors, (2816), 78 states have return successors, (2816), 2744 states have call predecessors, (2816), 2816 states have call successors, (2816) [2025-02-05 21:34:57,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10469 states to 10469 states and 17012 transitions. [2025-02-05 21:34:57,123 INFO L78 Accepts]: Start accepts. Automaton has 10469 states and 17012 transitions. Word has length 574 [2025-02-05 21:34:57,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:34:57,126 INFO L471 AbstractCegarLoop]: Abstraction has 10469 states and 17012 transitions. [2025-02-05 21:34:57,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.75) internal successors, (117), 12 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-02-05 21:34:57,126 INFO L276 IsEmpty]: Start isEmpty. Operand 10469 states and 17012 transitions. [2025-02-05 21:34:57,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-02-05 21:34:57,135 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:34:57,135 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:57,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:34:57,136 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:34:57,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:34:57,136 INFO L85 PathProgramCache]: Analyzing trace with hash 744150014, now seen corresponding path program 1 times [2025-02-05 21:34:57,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:34:57,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749825950] [2025-02-05 21:34:57,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:57,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:34:57,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-02-05 21:34:57,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-02-05 21:34:57,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:57,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:57,641 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-02-05 21:34:57,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:57,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749825950] [2025-02-05 21:34:57,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749825950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:34:57,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:34:57,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:34:57,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007623059] [2025-02-05 21:34:57,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:34:57,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:34:57,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:57,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:34:57,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:34:57,643 INFO L87 Difference]: Start difference. First operand 10469 states and 17012 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-02-05 21:34:58,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:34:58,097 INFO L93 Difference]: Finished difference Result 21087 states and 34249 transitions. [2025-02-05 21:34:58,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:34:58,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 574 [2025-02-05 21:34:58,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:34:58,141 INFO L225 Difference]: With dead ends: 21087 [2025-02-05 21:34:58,142 INFO L226 Difference]: Without dead ends: 10621 [2025-02-05 21:34:58,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:34:58,166 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 0 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:34:58,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1193 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:34:58,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10621 states. [2025-02-05 21:34:58,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10621 to 10621. [2025-02-05 21:34:58,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10621 states, 7726 states have (on average 1.4926223142635258) internal successors, (11532), 7798 states have internal predecessors, (11532), 2816 states have call successors, (2816), 78 states have call predecessors, (2816), 78 states have return successors, (2816), 2744 states have call predecessors, (2816), 2816 states have call successors, (2816) [2025-02-05 21:34:58,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10621 states to 10621 states and 17164 transitions. [2025-02-05 21:34:58,765 INFO L78 Accepts]: Start accepts. Automaton has 10621 states and 17164 transitions. Word has length 574 [2025-02-05 21:34:58,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:34:58,766 INFO L471 AbstractCegarLoop]: Abstraction has 10621 states and 17164 transitions. [2025-02-05 21:34:58,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-02-05 21:34:58,766 INFO L276 IsEmpty]: Start isEmpty. Operand 10621 states and 17164 transitions. [2025-02-05 21:34:58,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-02-05 21:34:58,774 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:34:58,775 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:34:58,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:34:58,775 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:34:58,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:34:58,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1790496837, now seen corresponding path program 1 times [2025-02-05 21:34:58,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:34:58,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624952920] [2025-02-05 21:34:58,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:34:58,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:34:58,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-02-05 21:34:58,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-02-05 21:34:58,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:34:58,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:34:59,383 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-02-05 21:34:59,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:34:59,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624952920] [2025-02-05 21:34:59,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624952920] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:34:59,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:34:59,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:34:59,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011671312] [2025-02-05 21:34:59,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:34:59,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:34:59,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:34:59,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:34:59,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:34:59,385 INFO L87 Difference]: Start difference. First operand 10621 states and 17164 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-02-05 21:35:00,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:00,835 INFO L93 Difference]: Finished difference Result 26297 states and 42583 transitions. [2025-02-05 21:35:00,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:35:00,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 576 [2025-02-05 21:35:00,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:00,893 INFO L225 Difference]: With dead ends: 26297 [2025-02-05 21:35:00,893 INFO L226 Difference]: Without dead ends: 15679 [2025-02-05 21:35:00,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:35:00,921 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 591 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:00,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 1032 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:35:00,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15679 states. [2025-02-05 21:35:01,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15679 to 10957. [2025-02-05 21:35:01,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10957 states, 8640 states have (on average 1.5328703703703703) internal successors, (13244), 8694 states have internal predecessors, (13244), 2256 states have call successors, (2256), 60 states have call predecessors, (2256), 60 states have return successors, (2256), 2202 states have call predecessors, (2256), 2256 states have call successors, (2256) [2025-02-05 21:35:01,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10957 states to 10957 states and 17756 transitions. [2025-02-05 21:35:01,452 INFO L78 Accepts]: Start accepts. Automaton has 10957 states and 17756 transitions. Word has length 576 [2025-02-05 21:35:01,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:01,454 INFO L471 AbstractCegarLoop]: Abstraction has 10957 states and 17756 transitions. [2025-02-05 21:35:01,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-02-05 21:35:01,454 INFO L276 IsEmpty]: Start isEmpty. Operand 10957 states and 17756 transitions. [2025-02-05 21:35:01,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-02-05 21:35:01,463 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:01,464 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:35:01,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:35:01,464 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:01,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:01,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1259705978, now seen corresponding path program 1 times [2025-02-05 21:35:01,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:01,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003639323] [2025-02-05 21:35:01,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:01,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:01,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-02-05 21:35:01,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-02-05 21:35:01,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:01,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:02,096 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 96 proven. 177 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-02-05 21:35:02,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:02,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003639323] [2025-02-05 21:35:02,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003639323] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:35:02,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600487797] [2025-02-05 21:35:02,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:02,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:35:02,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:35:02,102 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 21:35:02,103 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 21:35:02,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-02-05 21:35:02,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-02-05 21:35:02,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:02,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:02,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 1252 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 21:35:02,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:35:03,397 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 8307 proven. 117 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-02-05 21:35:03,398 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:35:04,336 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 156 proven. 117 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-02-05 21:35:04,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600487797] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:35:04,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:35:04,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 10] total 22 [2025-02-05 21:35:04,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192522784] [2025-02-05 21:35:04,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:35:04,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 21:35:04,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:04,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 21:35:04,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2025-02-05 21:35:04,340 INFO L87 Difference]: Start difference. First operand 10957 states and 17756 transitions. Second operand has 22 states, 22 states have (on average 13.681818181818182) internal successors, (301), 22 states have internal predecessors, (301), 6 states have call successors, (276), 3 states have call predecessors, (276), 6 states have return successors, (276), 6 states have call predecessors, (276), 6 states have call successors, (276) [2025-02-05 21:35:11,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:11,006 INFO L93 Difference]: Finished difference Result 23007 states and 37230 transitions. [2025-02-05 21:35:11,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-02-05 21:35:11,007 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 13.681818181818182) internal successors, (301), 22 states have internal predecessors, (301), 6 states have call successors, (276), 3 states have call predecessors, (276), 6 states have return successors, (276), 6 states have call predecessors, (276), 6 states have call successors, (276) Word has length 576 [2025-02-05 21:35:11,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:11,057 INFO L225 Difference]: With dead ends: 23007 [2025-02-05 21:35:11,057 INFO L226 Difference]: Without dead ends: 12053 [2025-02-05 21:35:11,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1244 GetRequests, 1153 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2729 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1545, Invalid=7011, Unknown=0, NotChecked=0, Total=8556 [2025-02-05 21:35:11,080 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 6000 mSDsluCounter, 4857 mSDsCounter, 0 mSdLazyCounter, 5898 mSolverCounterSat, 3639 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6035 SdHoareTripleChecker+Valid, 5463 SdHoareTripleChecker+Invalid, 9537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3639 IncrementalHoareTripleChecker+Valid, 5898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:11,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6035 Valid, 5463 Invalid, 9537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3639 Valid, 5898 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-02-05 21:35:11,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12053 states. [2025-02-05 21:35:11,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12053 to 8255. [2025-02-05 21:35:11,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8255 states, 6154 states have (on average 1.515437114072148) internal successors, (9326), 6198 states have internal predecessors, (9326), 2018 states have call successors, (2018), 82 states have call predecessors, (2018), 82 states have return successors, (2018), 1974 states have call predecessors, (2018), 2018 states have call successors, (2018) [2025-02-05 21:35:11,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8255 states to 8255 states and 13362 transitions. [2025-02-05 21:35:11,938 INFO L78 Accepts]: Start accepts. Automaton has 8255 states and 13362 transitions. Word has length 576 [2025-02-05 21:35:11,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:11,939 INFO L471 AbstractCegarLoop]: Abstraction has 8255 states and 13362 transitions. [2025-02-05 21:35:11,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 13.681818181818182) internal successors, (301), 22 states have internal predecessors, (301), 6 states have call successors, (276), 3 states have call predecessors, (276), 6 states have return successors, (276), 6 states have call predecessors, (276), 6 states have call successors, (276) [2025-02-05 21:35:11,939 INFO L276 IsEmpty]: Start isEmpty. Operand 8255 states and 13362 transitions. [2025-02-05 21:35:11,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-02-05 21:35:11,947 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:11,947 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:35:11,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 21:35:12,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:35:12,148 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:12,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:12,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1816660906, now seen corresponding path program 1 times [2025-02-05 21:35:12,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:12,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050463214] [2025-02-05 21:35:12,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:12,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:12,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-02-05 21:35:12,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-02-05 21:35:12,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:12,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:12,424 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-02-05 21:35:12,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:12,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050463214] [2025-02-05 21:35:12,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050463214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:35:12,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:35:12,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:35:12,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108941161] [2025-02-05 21:35:12,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:35:12,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:35:12,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:12,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:35:12,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:35:12,427 INFO L87 Difference]: Start difference. First operand 8255 states and 13362 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-02-05 21:35:13,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:13,070 INFO L93 Difference]: Finished difference Result 19527 states and 31518 transitions. [2025-02-05 21:35:13,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:35:13,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 576 [2025-02-05 21:35:13,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:13,106 INFO L225 Difference]: With dead ends: 19527 [2025-02-05 21:35:13,106 INFO L226 Difference]: Without dead ends: 11275 [2025-02-05 21:35:13,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:35:13,126 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 398 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:13,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 845 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:35:13,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11275 states. [2025-02-05 21:35:13,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11275 to 11249. [2025-02-05 21:35:13,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11249 states, 8332 states have (on average 1.5036005760921747) internal successors, (12528), 8400 states have internal predecessors, (12528), 2786 states have call successors, (2786), 130 states have call predecessors, (2786), 130 states have return successors, (2786), 2718 states have call predecessors, (2786), 2786 states have call successors, (2786) [2025-02-05 21:35:13,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11249 states to 11249 states and 18100 transitions. [2025-02-05 21:35:13,699 INFO L78 Accepts]: Start accepts. Automaton has 11249 states and 18100 transitions. Word has length 576 [2025-02-05 21:35:13,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:13,699 INFO L471 AbstractCegarLoop]: Abstraction has 11249 states and 18100 transitions. [2025-02-05 21:35:13,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-02-05 21:35:13,700 INFO L276 IsEmpty]: Start isEmpty. Operand 11249 states and 18100 transitions. [2025-02-05 21:35:13,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-02-05 21:35:13,708 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:13,708 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:35:13,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:35:13,708 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:13,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:13,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1553256647, now seen corresponding path program 1 times [2025-02-05 21:35:13,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:13,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418803482] [2025-02-05 21:35:13,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:13,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:13,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-02-05 21:35:13,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-02-05 21:35:13,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:13,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:14,388 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-02-05 21:35:14,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:14,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418803482] [2025-02-05 21:35:14,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418803482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:35:14,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:35:14,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 21:35:14,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496849524] [2025-02-05 21:35:14,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:35:14,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 21:35:14,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:14,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 21:35:14,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:35:14,390 INFO L87 Difference]: Start difference. First operand 11249 states and 18100 transitions. Second operand has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 2 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 2 states have call predecessors, (92), 2 states have call successors, (92) [2025-02-05 21:35:18,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:18,866 INFO L93 Difference]: Finished difference Result 48123 states and 76890 transitions. [2025-02-05 21:35:18,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 21:35:18,871 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 2 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 2 states have call predecessors, (92), 2 states have call successors, (92) Word has length 576 [2025-02-05 21:35:18,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:18,972 INFO L225 Difference]: With dead ends: 48123 [2025-02-05 21:35:18,972 INFO L226 Difference]: Without dead ends: 36877 [2025-02-05 21:35:19,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-02-05 21:35:19,002 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 2385 mSDsluCounter, 2099 mSDsCounter, 0 mSdLazyCounter, 1639 mSolverCounterSat, 937 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2385 SdHoareTripleChecker+Valid, 2643 SdHoareTripleChecker+Invalid, 2576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 937 IncrementalHoareTripleChecker+Valid, 1639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:19,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2385 Valid, 2643 Invalid, 2576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [937 Valid, 1639 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 21:35:19,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36877 states. [2025-02-05 21:35:20,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36877 to 17927. [2025-02-05 21:35:20,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17927 states, 13274 states have (on average 1.4887750489679072) internal successors, (19762), 13382 states have internal predecessors, (19762), 4354 states have call successors, (4354), 298 states have call predecessors, (4354), 298 states have return successors, (4354), 4246 states have call predecessors, (4354), 4354 states have call successors, (4354) [2025-02-05 21:35:21,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17927 states to 17927 states and 28470 transitions. [2025-02-05 21:35:21,066 INFO L78 Accepts]: Start accepts. Automaton has 17927 states and 28470 transitions. Word has length 576 [2025-02-05 21:35:21,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:21,069 INFO L471 AbstractCegarLoop]: Abstraction has 17927 states and 28470 transitions. [2025-02-05 21:35:21,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 11 states have internal predecessors, (119), 2 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 2 states have call predecessors, (92), 2 states have call successors, (92) [2025-02-05 21:35:21,070 INFO L276 IsEmpty]: Start isEmpty. Operand 17927 states and 28470 transitions. [2025-02-05 21:35:21,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-02-05 21:35:21,102 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:21,102 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:35:21,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:35:21,103 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:21,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:21,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1108906650, now seen corresponding path program 1 times [2025-02-05 21:35:21,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:21,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541477958] [2025-02-05 21:35:21,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:21,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:21,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-02-05 21:35:21,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-02-05 21:35:21,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:21,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:22,647 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-02-05 21:35:22,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:22,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541477958] [2025-02-05 21:35:22,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541477958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:35:22,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:35:22,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 21:35:22,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518798064] [2025-02-05 21:35:22,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:35:22,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:35:22,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:22,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:35:22,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:35:22,653 INFO L87 Difference]: Start difference. First operand 17927 states and 28470 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-02-05 21:35:25,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:25,615 INFO L93 Difference]: Finished difference Result 42511 states and 67923 transitions. [2025-02-05 21:35:25,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:35:25,616 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 576 [2025-02-05 21:35:25,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:25,702 INFO L225 Difference]: With dead ends: 42511 [2025-02-05 21:35:25,702 INFO L226 Difference]: Without dead ends: 24583 [2025-02-05 21:35:25,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:35:25,745 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 808 mSDsluCounter, 1866 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 2334 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:25,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 2334 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 21:35:25,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24583 states. [2025-02-05 21:35:26,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24583 to 11237. [2025-02-05 21:35:26,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11237 states, 8610 states have (on average 1.516608594657375) internal successors, (13058), 8670 states have internal predecessors, (13058), 2452 states have call successors, (2452), 174 states have call predecessors, (2452), 174 states have return successors, (2452), 2392 states have call predecessors, (2452), 2452 states have call successors, (2452) [2025-02-05 21:35:26,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11237 states to 11237 states and 17962 transitions. [2025-02-05 21:35:26,822 INFO L78 Accepts]: Start accepts. Automaton has 11237 states and 17962 transitions. Word has length 576 [2025-02-05 21:35:26,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:26,823 INFO L471 AbstractCegarLoop]: Abstraction has 11237 states and 17962 transitions. [2025-02-05 21:35:26,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-02-05 21:35:26,823 INFO L276 IsEmpty]: Start isEmpty. Operand 11237 states and 17962 transitions. [2025-02-05 21:35:26,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-02-05 21:35:26,834 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:26,834 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:35:26,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:35:26,834 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:26,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:26,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1784913685, now seen corresponding path program 1 times [2025-02-05 21:35:26,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:26,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061384187] [2025-02-05 21:35:26,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:26,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:26,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-02-05 21:35:27,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-02-05 21:35:27,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:27,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:27,703 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 177 proven. 96 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-02-05 21:35:27,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:27,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061384187] [2025-02-05 21:35:27,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061384187] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:35:27,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827610831] [2025-02-05 21:35:27,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:27,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:35:27,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:35:27,708 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 21:35:27,710 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 21:35:27,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-02-05 21:35:27,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-02-05 21:35:27,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:27,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:27,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 1252 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 21:35:27,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:35:28,219 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 7407 proven. 87 refuted. 0 times theorem prover too weak. 9250 trivial. 0 not checked. [2025-02-05 21:35:28,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:35:28,546 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 186 proven. 87 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-02-05 21:35:28,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827610831] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:35:28,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:35:28,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2025-02-05 21:35:28,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415981561] [2025-02-05 21:35:28,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:35:28,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 21:35:28,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:28,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 21:35:28,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-02-05 21:35:28,549 INFO L87 Difference]: Start difference. First operand 11237 states and 17962 transitions. Second operand has 15 states, 15 states have (on average 12.133333333333333) internal successors, (182), 15 states have internal predecessors, (182), 3 states have call successors, (153), 2 states have call predecessors, (153), 4 states have return successors, (155), 3 states have call predecessors, (155), 3 states have call successors, (155) [2025-02-05 21:35:34,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:34,597 INFO L93 Difference]: Finished difference Result 50055 states and 78463 transitions. [2025-02-05 21:35:34,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-05 21:35:34,599 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 12.133333333333333) internal successors, (182), 15 states have internal predecessors, (182), 3 states have call successors, (153), 2 states have call predecessors, (153), 4 states have return successors, (155), 3 states have call predecessors, (155), 3 states have call successors, (155) Word has length 576 [2025-02-05 21:35:34,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:34,818 INFO L225 Difference]: With dead ends: 50055 [2025-02-05 21:35:34,818 INFO L226 Difference]: Without dead ends: 38821 [2025-02-05 21:35:34,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1197 GetRequests, 1150 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=537, Invalid=1625, Unknown=0, NotChecked=0, Total=2162 [2025-02-05 21:35:34,845 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 1595 mSDsluCounter, 2136 mSDsCounter, 0 mSdLazyCounter, 2872 mSolverCounterSat, 1069 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1596 SdHoareTripleChecker+Valid, 2515 SdHoareTripleChecker+Invalid, 3941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1069 IncrementalHoareTripleChecker+Valid, 2872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:34,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1596 Valid, 2515 Invalid, 3941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1069 Valid, 2872 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 21:35:34,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38821 states. [2025-02-05 21:35:36,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38821 to 20747. [2025-02-05 21:35:36,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20747 states, 16264 states have (on average 1.5033202164289228) internal successors, (24450), 16372 states have internal predecessors, (24450), 4170 states have call successors, (4170), 312 states have call predecessors, (4170), 312 states have return successors, (4170), 4062 states have call predecessors, (4170), 4170 states have call successors, (4170) [2025-02-05 21:35:36,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20747 states to 20747 states and 32790 transitions. [2025-02-05 21:35:36,859 INFO L78 Accepts]: Start accepts. Automaton has 20747 states and 32790 transitions. Word has length 576 [2025-02-05 21:35:36,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:36,859 INFO L471 AbstractCegarLoop]: Abstraction has 20747 states and 32790 transitions. [2025-02-05 21:35:36,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 12.133333333333333) internal successors, (182), 15 states have internal predecessors, (182), 3 states have call successors, (153), 2 states have call predecessors, (153), 4 states have return successors, (155), 3 states have call predecessors, (155), 3 states have call successors, (155) [2025-02-05 21:35:36,860 INFO L276 IsEmpty]: Start isEmpty. Operand 20747 states and 32790 transitions. [2025-02-05 21:35:36,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-02-05 21:35:36,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:36,871 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:35:36,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 21:35:37,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:35:37,072 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:37,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:37,073 INFO L85 PathProgramCache]: Analyzing trace with hash -152109686, now seen corresponding path program 1 times [2025-02-05 21:35:37,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:37,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894043821] [2025-02-05 21:35:37,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:37,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:37,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-02-05 21:35:37,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-02-05 21:35:37,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:37,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:37,458 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 177 proven. 96 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-02-05 21:35:37,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:37,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894043821] [2025-02-05 21:35:37,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894043821] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:35:37,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758267351] [2025-02-05 21:35:37,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:37,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:35:37,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:35:37,462 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 21:35:37,463 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 21:35:37,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-02-05 21:35:37,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-02-05 21:35:37,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:37,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:37,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 1250 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 21:35:37,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:35:38,695 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 7761 proven. 96 refuted. 0 times theorem prover too weak. 8887 trivial. 0 not checked. [2025-02-05 21:35:38,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:35:39,161 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 177 proven. 96 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-02-05 21:35:39,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758267351] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:35:39,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:35:39,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 16 [2025-02-05 21:35:39,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456036305] [2025-02-05 21:35:39,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:35:39,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 21:35:39,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:39,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 21:35:39,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-02-05 21:35:39,166 INFO L87 Difference]: Start difference. First operand 20747 states and 32790 transitions. Second operand has 16 states, 16 states have (on average 15.25) internal successors, (244), 16 states have internal predecessors, (244), 5 states have call successors, (276), 3 states have call predecessors, (276), 6 states have return successors, (276), 5 states have call predecessors, (276), 5 states have call successors, (276) [2025-02-05 21:35:42,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:42,646 INFO L93 Difference]: Finished difference Result 47055 states and 74476 transitions. [2025-02-05 21:35:42,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 21:35:42,647 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 15.25) internal successors, (244), 16 states have internal predecessors, (244), 5 states have call successors, (276), 3 states have call predecessors, (276), 6 states have return successors, (276), 5 states have call predecessors, (276), 5 states have call successors, (276) Word has length 576 [2025-02-05 21:35:42,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:42,723 INFO L225 Difference]: With dead ends: 47055 [2025-02-05 21:35:42,724 INFO L226 Difference]: Without dead ends: 26311 [2025-02-05 21:35:42,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1163 GetRequests, 1143 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2025-02-05 21:35:42,755 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 859 mSDsluCounter, 2565 mSDsCounter, 0 mSdLazyCounter, 2305 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 2958 SdHoareTripleChecker+Invalid, 2467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 2305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:42,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1009 Valid, 2958 Invalid, 2467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 2305 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 21:35:42,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26311 states. [2025-02-05 21:35:45,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26311 to 18031. [2025-02-05 21:35:45,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18031 states, 14006 states have (on average 1.4976438669141796) internal successors, (20976), 14102 states have internal predecessors, (20976), 3742 states have call successors, (3742), 282 states have call predecessors, (3742), 282 states have return successors, (3742), 3646 states have call predecessors, (3742), 3742 states have call successors, (3742) [2025-02-05 21:35:45,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18031 states to 18031 states and 28460 transitions. [2025-02-05 21:35:45,179 INFO L78 Accepts]: Start accepts. Automaton has 18031 states and 28460 transitions. Word has length 576 [2025-02-05 21:35:45,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:35:45,180 INFO L471 AbstractCegarLoop]: Abstraction has 18031 states and 28460 transitions. [2025-02-05 21:35:45,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 15.25) internal successors, (244), 16 states have internal predecessors, (244), 5 states have call successors, (276), 3 states have call predecessors, (276), 6 states have return successors, (276), 5 states have call predecessors, (276), 5 states have call successors, (276) [2025-02-05 21:35:45,180 INFO L276 IsEmpty]: Start isEmpty. Operand 18031 states and 28460 transitions. [2025-02-05 21:35:45,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2025-02-05 21:35:45,194 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:35:45,194 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:35:45,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 21:35:45,401 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,SelfDestructingSolverStorable12 [2025-02-05 21:35:45,401 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:35:45,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:35:45,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1434266578, now seen corresponding path program 1 times [2025-02-05 21:35:45,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:35:45,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466649274] [2025-02-05 21:35:45,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:35:45,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:35:45,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-02-05 21:35:45,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-02-05 21:35:45,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:35:45,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:35:46,060 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-02-05 21:35:46,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:35:46,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466649274] [2025-02-05 21:35:46,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466649274] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:35:46,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:35:46,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:35:46,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929902321] [2025-02-05 21:35:46,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:35:46,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:35:46,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:35:46,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:35:46,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:35:46,062 INFO L87 Difference]: Start difference. First operand 18031 states and 28460 transitions. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-02-05 21:35:53,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:35:53,333 INFO L93 Difference]: Finished difference Result 81157 states and 127964 transitions. [2025-02-05 21:35:53,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:35:53,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 577 [2025-02-05 21:35:53,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:35:53,548 INFO L225 Difference]: With dead ends: 81157 [2025-02-05 21:35:53,548 INFO L226 Difference]: Without dead ends: 72379 [2025-02-05 21:35:53,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:35:53,578 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 1695 mSDsluCounter, 1868 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 501 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1695 SdHoareTripleChecker+Valid, 2535 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 501 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 21:35:53,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1695 Valid, 2535 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [501 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 21:35:53,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72379 states.