./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e5878b7d2af5fd4b66050c0dbed52215fb6ea8477622dc26391a98be7bc7f1ca --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:15:46,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:15:46,528 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:15:46,534 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:15:46,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:15:46,556 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:15:46,556 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:15:46,556 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:15:46,558 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:15:46,558 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:15:46,558 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:15:46,559 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:15:46,559 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:15:46,559 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:15:46,559 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:15:46,559 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:15:46,560 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:15:46,560 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:15:46,560 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:15:46,560 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:15:46,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:15:46,560 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:15:46,560 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:15:46,560 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:15:46,560 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:15:46,560 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:15:46,560 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:15:46,560 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:15:46,560 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:15:46,560 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:15:46,560 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:15:46,560 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:15:46,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:15:46,560 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:15:46,560 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:15:46,560 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:15:46,560 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:15:46,560 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:15:46,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:15:46,560 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:15:46,561 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:15:46,561 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:15:46,561 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:15:46,561 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 -> e5878b7d2af5fd4b66050c0dbed52215fb6ea8477622dc26391a98be7bc7f1ca [2025-02-05 16:15:46,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:15:46,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:15:46,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:15:46,780 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:15:46,780 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:15:46,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2025-02-05 16:15:47,920 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b39a02c68/f6f3262da05f41ccb28d51997e776a35/FLAG0561141c3 [2025-02-05 16:15:48,291 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:15:48,291 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2025-02-05 16:15:48,307 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b39a02c68/f6f3262da05f41ccb28d51997e776a35/FLAG0561141c3 [2025-02-05 16:15:48,555 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b39a02c68/f6f3262da05f41ccb28d51997e776a35 [2025-02-05 16:15:48,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:15:48,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:15:48,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:15:48,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:15:48,561 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:15:48,562 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:15:48" (1/1) ... [2025-02-05 16:15:48,562 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11f39a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:48, skipping insertion in model container [2025-02-05 16:15:48,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:15:48" (1/1) ... [2025-02-05 16:15:48,574 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:15:48,727 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c[6117,6130] [2025-02-05 16:15:48,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:15:48,737 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:15:48,759 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c[6117,6130] [2025-02-05 16:15:48,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:15:48,777 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:15:48,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:48 WrapperNode [2025-02-05 16:15:48,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:15:48,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:15:48,778 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:15:48,778 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:15:48,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:48" (1/1) ... [2025-02-05 16:15:48,798 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:48" (1/1) ... [2025-02-05 16:15:48,829 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 217 [2025-02-05 16:15:48,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:15:48,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:15:48,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:15:48,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:15:48,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:48" (1/1) ... [2025-02-05 16:15:48,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:48" (1/1) ... [2025-02-05 16:15:48,838 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:48" (1/1) ... [2025-02-05 16:15:48,851 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 16:15:48,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:48" (1/1) ... [2025-02-05 16:15:48,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:48" (1/1) ... [2025-02-05 16:15:48,855 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:48" (1/1) ... [2025-02-05 16:15:48,855 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:48" (1/1) ... [2025-02-05 16:15:48,856 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:48" (1/1) ... [2025-02-05 16:15:48,856 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:48" (1/1) ... [2025-02-05 16:15:48,857 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:15:48,858 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:15:48,858 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:15:48,858 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:15:48,859 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:48" (1/1) ... [2025-02-05 16:15:48,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:15:48,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:15:48,887 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:15:48,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:15:48,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:15:48,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:15:48,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:15:48,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:15:48,971 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:15:48,973 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:15:49,234 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-02-05 16:15:49,235 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:15:49,243 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:15:49,243 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:15:49,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:15:49 BoogieIcfgContainer [2025-02-05 16:15:49,243 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:15:49,245 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:15:49,245 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:15:49,248 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:15:49,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:15:48" (1/3) ... [2025-02-05 16:15:49,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e047c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:15:49, skipping insertion in model container [2025-02-05 16:15:49,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:48" (2/3) ... [2025-02-05 16:15:49,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e047c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:15:49, skipping insertion in model container [2025-02-05 16:15:49,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:15:49" (3/3) ... [2025-02-05 16:15:49,250 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2025-02-05 16:15:49,259 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:15:49,260 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c that has 1 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 16:15:49,305 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:15:49,316 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;@52cbda00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:15:49,317 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:15:49,319 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 53 states have (on average 1.6981132075471699) internal successors, (90), 54 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:49,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 16:15:49,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:49,330 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:49,330 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:49,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:49,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1809136177, now seen corresponding path program 1 times [2025-02-05 16:15:49,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:49,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880793377] [2025-02-05 16:15:49,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:49,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:49,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 16:15:49,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 16:15:49,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:49,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:49,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:49,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:49,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880793377] [2025-02-05 16:15:49,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880793377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:49,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:49,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 16:15:49,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427855262] [2025-02-05 16:15:49,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:49,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 16:15:49,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:49,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 16:15:49,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:15:49,569 INFO L87 Difference]: Start difference. First operand has 55 states, 53 states have (on average 1.6981132075471699) internal successors, (90), 54 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:49,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:49,595 INFO L93 Difference]: Finished difference Result 86 states and 140 transitions. [2025-02-05 16:15:49,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 16:15:49,597 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-05 16:15:49,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:49,606 INFO L225 Difference]: With dead ends: 86 [2025-02-05 16:15:49,606 INFO L226 Difference]: Without dead ends: 52 [2025-02-05 16:15:49,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:15:49,610 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:49,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:49,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-05 16:15:49,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-02-05 16:15:49,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.6666666666666667) internal successors, (85), 51 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:49,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 85 transitions. [2025-02-05 16:15:49,631 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 85 transitions. Word has length 19 [2025-02-05 16:15:49,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:49,631 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 85 transitions. [2025-02-05 16:15:49,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:49,632 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 85 transitions. [2025-02-05 16:15:49,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 16:15:49,632 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:49,632 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:49,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:15:49,633 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:49,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:49,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1303577552, now seen corresponding path program 1 times [2025-02-05 16:15:49,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:49,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743807421] [2025-02-05 16:15:49,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:49,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:49,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 16:15:49,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 16:15:49,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:49,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:49,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:49,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:49,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743807421] [2025-02-05 16:15:49,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743807421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:49,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:49,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:15:49,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957197354] [2025-02-05 16:15:49,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:49,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:15:49,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:49,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:15:49,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:15:49,869 INFO L87 Difference]: Start difference. First operand 52 states and 85 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:49,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:49,905 INFO L93 Difference]: Finished difference Result 86 states and 136 transitions. [2025-02-05 16:15:49,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:15:49,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-05 16:15:49,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:49,906 INFO L225 Difference]: With dead ends: 86 [2025-02-05 16:15:49,907 INFO L226 Difference]: Without dead ends: 52 [2025-02-05 16:15:49,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:15:49,910 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:49,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:49,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-05 16:15:49,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-02-05 16:15:49,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 51 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:49,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 69 transitions. [2025-02-05 16:15:49,914 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 69 transitions. Word has length 19 [2025-02-05 16:15:49,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:49,914 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 69 transitions. [2025-02-05 16:15:49,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:49,914 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2025-02-05 16:15:49,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-05 16:15:49,915 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:49,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:49,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:15:49,915 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:49,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:49,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1708524963, now seen corresponding path program 1 times [2025-02-05 16:15:49,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:49,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297992566] [2025-02-05 16:15:49,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:49,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:49,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 16:15:49,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 16:15:49,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:49,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:50,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:50,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:50,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297992566] [2025-02-05 16:15:50,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297992566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:50,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:50,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:15:50,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56055401] [2025-02-05 16:15:50,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:50,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:15:50,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:50,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:15:50,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:15:50,060 INFO L87 Difference]: Start difference. First operand 52 states and 69 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:50,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:50,167 INFO L93 Difference]: Finished difference Result 232 states and 351 transitions. [2025-02-05 16:15:50,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:15:50,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-02-05 16:15:50,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:50,169 INFO L225 Difference]: With dead ends: 232 [2025-02-05 16:15:50,169 INFO L226 Difference]: Without dead ends: 202 [2025-02-05 16:15:50,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:15:50,170 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 272 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:50,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 426 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:15:50,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-05 16:15:50,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 80. [2025-02-05 16:15:50,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.4303797468354431) internal successors, (113), 79 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:50,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 113 transitions. [2025-02-05 16:15:50,181 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 113 transitions. Word has length 34 [2025-02-05 16:15:50,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:50,181 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 113 transitions. [2025-02-05 16:15:50,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:50,182 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 113 transitions. [2025-02-05 16:15:50,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 16:15:50,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:50,182 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:50,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:15:50,183 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:50,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:50,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1959631714, now seen corresponding path program 1 times [2025-02-05 16:15:50,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:50,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165570478] [2025-02-05 16:15:50,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:50,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:50,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 16:15:50,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 16:15:50,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:50,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:50,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:50,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:50,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165570478] [2025-02-05 16:15:50,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165570478] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:50,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:50,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:50,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979478128] [2025-02-05 16:15:50,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:50,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:50,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:50,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:50,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:50,236 INFO L87 Difference]: Start difference. First operand 80 states and 113 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:50,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:50,250 INFO L93 Difference]: Finished difference Result 185 states and 276 transitions. [2025-02-05 16:15:50,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:50,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-02-05 16:15:50,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:50,251 INFO L225 Difference]: With dead ends: 185 [2025-02-05 16:15:50,252 INFO L226 Difference]: Without dead ends: 127 [2025-02-05 16:15:50,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:50,252 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 27 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:50,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 109 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:50,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-05 16:15:50,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2025-02-05 16:15:50,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.4596774193548387) internal successors, (181), 124 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:50,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 181 transitions. [2025-02-05 16:15:50,262 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 181 transitions. Word has length 36 [2025-02-05 16:15:50,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:50,262 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 181 transitions. [2025-02-05 16:15:50,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:50,263 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 181 transitions. [2025-02-05 16:15:50,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 16:15:50,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:50,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:50,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:15:50,264 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:50,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:50,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1927308479, now seen corresponding path program 1 times [2025-02-05 16:15:50,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:50,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415437265] [2025-02-05 16:15:50,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:50,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:50,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 16:15:50,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 16:15:50,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:50,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:50,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:50,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:50,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415437265] [2025-02-05 16:15:50,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415437265] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:50,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:50,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:15:50,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554744007] [2025-02-05 16:15:50,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:50,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:15:50,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:50,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:15:50,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:15:50,405 INFO L87 Difference]: Start difference. First operand 125 states and 181 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:50,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:50,456 INFO L93 Difference]: Finished difference Result 230 states and 341 transitions. [2025-02-05 16:15:50,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:15:50,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-02-05 16:15:50,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:50,457 INFO L225 Difference]: With dead ends: 230 [2025-02-05 16:15:50,457 INFO L226 Difference]: Without dead ends: 127 [2025-02-05 16:15:50,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:15:50,458 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 36 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:50,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 193 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:50,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-05 16:15:50,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2025-02-05 16:15:50,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.4435483870967742) internal successors, (179), 124 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:50,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 179 transitions. [2025-02-05 16:15:50,464 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 179 transitions. Word has length 36 [2025-02-05 16:15:50,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:50,465 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 179 transitions. [2025-02-05 16:15:50,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:50,465 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 179 transitions. [2025-02-05 16:15:50,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 16:15:50,465 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:50,466 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:50,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:15:50,466 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:50,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:50,466 INFO L85 PathProgramCache]: Analyzing trace with hash 413517028, now seen corresponding path program 1 times [2025-02-05 16:15:50,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:50,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708508291] [2025-02-05 16:15:50,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:50,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:50,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 16:15:50,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 16:15:50,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:50,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:50,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:50,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:50,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708508291] [2025-02-05 16:15:50,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708508291] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:50,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:50,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:15:50,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148726955] [2025-02-05 16:15:50,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:50,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:15:50,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:50,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:15:50,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:15:50,608 INFO L87 Difference]: Start difference. First operand 125 states and 179 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:50,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:50,625 INFO L93 Difference]: Finished difference Result 133 states and 188 transitions. [2025-02-05 16:15:50,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:15:50,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-02-05 16:15:50,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:50,626 INFO L225 Difference]: With dead ends: 133 [2025-02-05 16:15:50,626 INFO L226 Difference]: Without dead ends: 131 [2025-02-05 16:15:50,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:15:50,627 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:50,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 255 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:50,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-05 16:15:50,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-02-05 16:15:50,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.4153846153846155) internal successors, (184), 130 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:50,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 184 transitions. [2025-02-05 16:15:50,632 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 184 transitions. Word has length 37 [2025-02-05 16:15:50,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:50,633 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 184 transitions. [2025-02-05 16:15:50,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:50,633 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 184 transitions. [2025-02-05 16:15:50,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 16:15:50,634 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:50,634 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:50,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:15:50,634 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:50,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:50,634 INFO L85 PathProgramCache]: Analyzing trace with hash -2107304257, now seen corresponding path program 1 times [2025-02-05 16:15:50,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:50,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225430540] [2025-02-05 16:15:50,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:50,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:50,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 16:15:50,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 16:15:50,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:50,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:50,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:50,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:50,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225430540] [2025-02-05 16:15:50,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225430540] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:50,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:50,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:50,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99232308] [2025-02-05 16:15:50,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:50,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:50,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:50,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:50,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:50,672 INFO L87 Difference]: Start difference. First operand 131 states and 184 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:50,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:50,683 INFO L93 Difference]: Finished difference Result 253 states and 365 transitions. [2025-02-05 16:15:50,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:50,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-02-05 16:15:50,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:50,684 INFO L225 Difference]: With dead ends: 253 [2025-02-05 16:15:50,684 INFO L226 Difference]: Without dead ends: 189 [2025-02-05 16:15:50,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:50,685 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 37 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:50,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 149 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:50,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-02-05 16:15:50,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2025-02-05 16:15:50,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 1.424731182795699) internal successors, (265), 186 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:50,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 265 transitions. [2025-02-05 16:15:50,692 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 265 transitions. Word has length 38 [2025-02-05 16:15:50,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:50,692 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 265 transitions. [2025-02-05 16:15:50,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:50,692 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 265 transitions. [2025-02-05 16:15:50,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 16:15:50,693 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:50,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:50,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:15:50,693 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:50,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:50,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1692128385, now seen corresponding path program 1 times [2025-02-05 16:15:50,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:50,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879087778] [2025-02-05 16:15:50,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:50,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:50,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 16:15:50,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 16:15:50,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:50,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:50,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:50,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:50,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879087778] [2025-02-05 16:15:50,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879087778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:50,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:50,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:50,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468187491] [2025-02-05 16:15:50,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:50,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:50,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:50,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:50,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:50,730 INFO L87 Difference]: Start difference. First operand 187 states and 265 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:50,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:50,744 INFO L93 Difference]: Finished difference Result 489 states and 705 transitions. [2025-02-05 16:15:50,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:50,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-02-05 16:15:50,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:50,746 INFO L225 Difference]: With dead ends: 489 [2025-02-05 16:15:50,746 INFO L226 Difference]: Without dead ends: 326 [2025-02-05 16:15:50,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:50,747 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 35 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:50,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 155 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:50,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-02-05 16:15:50,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2025-02-05 16:15:50,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 1.414860681114551) internal successors, (457), 323 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:50,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 457 transitions. [2025-02-05 16:15:50,758 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 457 transitions. Word has length 38 [2025-02-05 16:15:50,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:50,758 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 457 transitions. [2025-02-05 16:15:50,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:50,758 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 457 transitions. [2025-02-05 16:15:50,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 16:15:50,759 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:50,759 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:50,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:15:50,759 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:50,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:50,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2116120639, now seen corresponding path program 1 times [2025-02-05 16:15:50,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:50,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059151684] [2025-02-05 16:15:50,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:50,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:50,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 16:15:50,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 16:15:50,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:50,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:50,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:50,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:50,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059151684] [2025-02-05 16:15:50,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059151684] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:50,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:50,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:50,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301207423] [2025-02-05 16:15:50,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:50,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:50,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:50,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:50,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:50,813 INFO L87 Difference]: Start difference. First operand 324 states and 457 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:50,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:50,834 INFO L93 Difference]: Finished difference Result 876 states and 1239 transitions. [2025-02-05 16:15:50,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:50,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-02-05 16:15:50,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:50,838 INFO L225 Difference]: With dead ends: 876 [2025-02-05 16:15:50,839 INFO L226 Difference]: Without dead ends: 576 [2025-02-05 16:15:50,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:50,841 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 33 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:50,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 157 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:50,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-02-05 16:15:50,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 574. [2025-02-05 16:15:50,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 573 states have (on average 1.3839441535776615) internal successors, (793), 573 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:50,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 793 transitions. [2025-02-05 16:15:50,864 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 793 transitions. Word has length 38 [2025-02-05 16:15:50,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:50,864 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 793 transitions. [2025-02-05 16:15:50,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:50,864 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 793 transitions. [2025-02-05 16:15:50,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 16:15:50,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:50,866 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:50,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:15:50,866 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:50,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:50,866 INFO L85 PathProgramCache]: Analyzing trace with hash 447497045, now seen corresponding path program 1 times [2025-02-05 16:15:50,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:50,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013443288] [2025-02-05 16:15:50,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:50,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:50,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 16:15:50,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 16:15:50,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:50,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:50,961 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:15:50,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:50,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013443288] [2025-02-05 16:15:50,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013443288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:50,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:50,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:15:50,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095444501] [2025-02-05 16:15:50,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:50,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:15:50,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:50,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:15:50,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:15:50,963 INFO L87 Difference]: Start difference. First operand 574 states and 793 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:51,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:51,041 INFO L93 Difference]: Finished difference Result 2206 states and 3069 transitions. [2025-02-05 16:15:51,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:15:51,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-02-05 16:15:51,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:51,047 INFO L225 Difference]: With dead ends: 2206 [2025-02-05 16:15:51,047 INFO L226 Difference]: Without dead ends: 1804 [2025-02-05 16:15:51,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:15:51,048 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 161 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:51,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 282 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:51,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2025-02-05 16:15:51,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1050. [2025-02-05 16:15:51,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 1049 states have (on average 1.3813155386081983) internal successors, (1449), 1049 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:51,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1449 transitions. [2025-02-05 16:15:51,090 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1449 transitions. Word has length 53 [2025-02-05 16:15:51,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:51,090 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1449 transitions. [2025-02-05 16:15:51,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:51,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1449 transitions. [2025-02-05 16:15:51,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 16:15:51,091 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:51,092 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:51,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:15:51,092 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:51,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:51,092 INFO L85 PathProgramCache]: Analyzing trace with hash 862672917, now seen corresponding path program 1 times [2025-02-05 16:15:51,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:51,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604200462] [2025-02-05 16:15:51,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:51,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:51,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 16:15:51,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 16:15:51,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:51,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:15:51,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:51,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604200462] [2025-02-05 16:15:51,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604200462] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:51,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:51,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:15:51,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305034616] [2025-02-05 16:15:51,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:51,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:15:51,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:51,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:15:51,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:15:51,209 INFO L87 Difference]: Start difference. First operand 1050 states and 1449 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:51,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:51,311 INFO L93 Difference]: Finished difference Result 2754 states and 3829 transitions. [2025-02-05 16:15:51,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:15:51,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-02-05 16:15:51,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:51,318 INFO L225 Difference]: With dead ends: 2754 [2025-02-05 16:15:51,318 INFO L226 Difference]: Without dead ends: 2204 [2025-02-05 16:15:51,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:15:51,322 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 161 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:51,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 279 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:51,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204 states. [2025-02-05 16:15:51,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204 to 1798. [2025-02-05 16:15:51,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 1797 states have (on average 1.3784084585420144) internal successors, (2477), 1797 states have internal predecessors, (2477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:51,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 2477 transitions. [2025-02-05 16:15:51,393 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 2477 transitions. Word has length 53 [2025-02-05 16:15:51,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:51,394 INFO L471 AbstractCegarLoop]: Abstraction has 1798 states and 2477 transitions. [2025-02-05 16:15:51,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:51,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2477 transitions. [2025-02-05 16:15:51,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 16:15:51,395 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:51,395 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:51,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:15:51,396 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:51,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:51,397 INFO L85 PathProgramCache]: Analyzing trace with hash 375954645, now seen corresponding path program 1 times [2025-02-05 16:15:51,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:51,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715751816] [2025-02-05 16:15:51,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:51,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:51,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 16:15:51,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 16:15:51,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:51,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:51,494 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 16:15:51,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:51,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715751816] [2025-02-05 16:15:51,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715751816] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:51,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:51,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:15:51,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903287792] [2025-02-05 16:15:51,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:51,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:15:51,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:51,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:15:51,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:15:51,497 INFO L87 Difference]: Start difference. First operand 1798 states and 2477 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:51,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:51,612 INFO L93 Difference]: Finished difference Result 3302 states and 4585 transitions. [2025-02-05 16:15:51,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:15:51,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-02-05 16:15:51,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:51,621 INFO L225 Difference]: With dead ends: 3302 [2025-02-05 16:15:51,621 INFO L226 Difference]: Without dead ends: 2752 [2025-02-05 16:15:51,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:15:51,623 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 167 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:51,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 280 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:51,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2025-02-05 16:15:51,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 2346. [2025-02-05 16:15:51,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2346 states, 2345 states have (on average 1.378678038379531) internal successors, (3233), 2345 states have internal predecessors, (3233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:51,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 3233 transitions. [2025-02-05 16:15:51,707 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 3233 transitions. Word has length 53 [2025-02-05 16:15:51,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:51,707 INFO L471 AbstractCegarLoop]: Abstraction has 2346 states and 3233 transitions. [2025-02-05 16:15:51,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:51,708 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 3233 transitions. [2025-02-05 16:15:51,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 16:15:51,708 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:51,708 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:51,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:15:51,709 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:51,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:51,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1516353032, now seen corresponding path program 1 times [2025-02-05 16:15:51,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:51,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382624810] [2025-02-05 16:15:51,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:51,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:51,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 16:15:51,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 16:15:51,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:51,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:51,777 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:51,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:51,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382624810] [2025-02-05 16:15:51,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382624810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:51,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:51,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:51,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856662572] [2025-02-05 16:15:51,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:51,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:51,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:51,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:51,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:51,778 INFO L87 Difference]: Start difference. First operand 2346 states and 3233 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:51,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:51,859 INFO L93 Difference]: Finished difference Result 4670 states and 6443 transitions. [2025-02-05 16:15:51,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:51,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-02-05 16:15:51,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:51,865 INFO L225 Difference]: With dead ends: 4670 [2025-02-05 16:15:51,865 INFO L226 Difference]: Without dead ends: 2348 [2025-02-05 16:15:51,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:51,867 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 29 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:51,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 144 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:51,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2025-02-05 16:15:51,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2346. [2025-02-05 16:15:51,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2346 states, 2345 states have (on average 1.3573560767590618) internal successors, (3183), 2345 states have internal predecessors, (3183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:51,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 3183 transitions. [2025-02-05 16:15:51,923 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 3183 transitions. Word has length 54 [2025-02-05 16:15:51,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:51,923 INFO L471 AbstractCegarLoop]: Abstraction has 2346 states and 3183 transitions. [2025-02-05 16:15:51,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:51,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 3183 transitions. [2025-02-05 16:15:51,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 16:15:51,924 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:51,924 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:51,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:15:51,924 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:51,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:51,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1252661555, now seen corresponding path program 1 times [2025-02-05 16:15:51,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:51,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186477269] [2025-02-05 16:15:51,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:51,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:51,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 16:15:51,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 16:15:51,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:51,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:51,993 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:51,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:51,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186477269] [2025-02-05 16:15:51,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186477269] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:51,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:51,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:51,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862126178] [2025-02-05 16:15:51,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:51,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:51,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:51,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:51,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:51,995 INFO L87 Difference]: Start difference. First operand 2346 states and 3183 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:52,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:52,023 INFO L93 Difference]: Finished difference Result 3265 states and 4443 transitions. [2025-02-05 16:15:52,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:52,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-02-05 16:15:52,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:52,027 INFO L225 Difference]: With dead ends: 3265 [2025-02-05 16:15:52,027 INFO L226 Difference]: Without dead ends: 943 [2025-02-05 16:15:52,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:52,031 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 23 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:52,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 141 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:52,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2025-02-05 16:15:52,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 935. [2025-02-05 16:15:52,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 934 states have (on average 1.3468950749464668) internal successors, (1258), 934 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:52,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1258 transitions. [2025-02-05 16:15:52,054 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1258 transitions. Word has length 55 [2025-02-05 16:15:52,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:52,054 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1258 transitions. [2025-02-05 16:15:52,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:52,054 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1258 transitions. [2025-02-05 16:15:52,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 16:15:52,056 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:52,056 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:52,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:15:52,056 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:52,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:52,057 INFO L85 PathProgramCache]: Analyzing trace with hash -498144001, now seen corresponding path program 1 times [2025-02-05 16:15:52,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:52,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14420113] [2025-02-05 16:15:52,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:52,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:52,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 16:15:52,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 16:15:52,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:52,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:52,116 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:52,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:52,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14420113] [2025-02-05 16:15:52,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14420113] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:52,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:52,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:52,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371246672] [2025-02-05 16:15:52,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:52,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:52,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:52,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:52,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:52,117 INFO L87 Difference]: Start difference. First operand 935 states and 1258 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:52,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:52,133 INFO L93 Difference]: Finished difference Result 1389 states and 1872 transitions. [2025-02-05 16:15:52,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:52,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-02-05 16:15:52,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:52,135 INFO L225 Difference]: With dead ends: 1389 [2025-02-05 16:15:52,135 INFO L226 Difference]: Without dead ends: 487 [2025-02-05 16:15:52,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:52,137 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 25 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:52,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 120 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:52,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-02-05 16:15:52,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 485. [2025-02-05 16:15:52,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 1.3161157024793388) internal successors, (637), 484 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:52,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 637 transitions. [2025-02-05 16:15:52,149 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 637 transitions. Word has length 56 [2025-02-05 16:15:52,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:52,149 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 637 transitions. [2025-02-05 16:15:52,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:52,149 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 637 transitions. [2025-02-05 16:15:52,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 16:15:52,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:52,150 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:52,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:15:52,150 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:52,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:52,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1553446618, now seen corresponding path program 1 times [2025-02-05 16:15:52,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:52,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744209780] [2025-02-05 16:15:52,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:52,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:52,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 16:15:52,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 16:15:52,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:52,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:52,604 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:52,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:52,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744209780] [2025-02-05 16:15:52,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744209780] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:15:52,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732989901] [2025-02-05 16:15:52,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:52,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:15:52,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:15:52,607 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:15:52,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:15:52,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 16:15:52,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 16:15:52,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:52,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:52,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 16:15:52,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:15:52,841 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:15:52,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:15:52,968 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:15:52,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732989901] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:15:52,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:15:52,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 4] total 16 [2025-02-05 16:15:52,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529885062] [2025-02-05 16:15:52,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:15:52,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 16:15:52,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:52,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 16:15:52,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-02-05 16:15:52,970 INFO L87 Difference]: Start difference. First operand 485 states and 637 transitions. Second operand has 16 states, 16 states have (on average 9.875) internal successors, (158), 16 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:53,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:53,907 INFO L93 Difference]: Finished difference Result 2493 states and 3258 transitions. [2025-02-05 16:15:53,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-05 16:15:53,907 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.875) internal successors, (158), 16 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-02-05 16:15:53,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:53,912 INFO L225 Difference]: With dead ends: 2493 [2025-02-05 16:15:53,912 INFO L226 Difference]: Without dead ends: 2041 [2025-02-05 16:15:53,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=362, Invalid=1278, Unknown=0, NotChecked=0, Total=1640 [2025-02-05 16:15:53,914 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 945 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:53,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 515 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:15:53,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2041 states. [2025-02-05 16:15:53,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2041 to 1923. [2025-02-05 16:15:53,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1923 states, 1922 states have (on average 1.2580645161290323) internal successors, (2418), 1922 states have internal predecessors, (2418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:53,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 2418 transitions. [2025-02-05 16:15:53,963 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 2418 transitions. Word has length 58 [2025-02-05 16:15:53,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:53,963 INFO L471 AbstractCegarLoop]: Abstraction has 1923 states and 2418 transitions. [2025-02-05 16:15:53,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.875) internal successors, (158), 16 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:53,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 2418 transitions. [2025-02-05 16:15:53,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 16:15:53,964 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:53,964 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:53,974 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 16:15:54,168 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,SelfDestructingSolverStorable15 [2025-02-05 16:15:54,169 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:54,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:54,169 INFO L85 PathProgramCache]: Analyzing trace with hash -690750486, now seen corresponding path program 1 times [2025-02-05 16:15:54,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:54,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486619979] [2025-02-05 16:15:54,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:54,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:54,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 16:15:54,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 16:15:54,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:54,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:54,525 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:54,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:54,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486619979] [2025-02-05 16:15:54,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486619979] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:15:54,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851143848] [2025-02-05 16:15:54,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:54,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:15:54,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:15:54,527 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:15:54,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:15:54,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 16:15:54,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 16:15:54,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:54,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:54,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-05 16:15:54,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:15:55,083 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:55,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:15:55,753 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:55,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851143848] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:15:55,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:15:55,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 30 [2025-02-05 16:15:55,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082660914] [2025-02-05 16:15:55,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:15:55,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 16:15:55,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:55,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 16:15:55,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=693, Unknown=0, NotChecked=0, Total=870 [2025-02-05 16:15:55,755 INFO L87 Difference]: Start difference. First operand 1923 states and 2418 transitions. Second operand has 30 states, 30 states have (on average 5.3) internal successors, (159), 30 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:56,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:56,266 INFO L93 Difference]: Finished difference Result 5260 states and 6658 transitions. [2025-02-05 16:15:56,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 16:15:56,267 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.3) internal successors, (159), 30 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-02-05 16:15:56,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:56,276 INFO L225 Difference]: With dead ends: 5260 [2025-02-05 16:15:56,276 INFO L226 Difference]: Without dead ends: 3773 [2025-02-05 16:15:56,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=470, Invalid=1422, Unknown=0, NotChecked=0, Total=1892 [2025-02-05 16:15:56,278 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 700 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:56,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 483 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:15:56,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3773 states. [2025-02-05 16:15:56,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3773 to 3707. [2025-02-05 16:15:56,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3707 states, 3706 states have (on average 1.2393416082029143) internal successors, (4593), 3706 states have internal predecessors, (4593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:56,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 4593 transitions. [2025-02-05 16:15:56,356 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 4593 transitions. Word has length 59 [2025-02-05 16:15:56,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:56,356 INFO L471 AbstractCegarLoop]: Abstraction has 3707 states and 4593 transitions. [2025-02-05 16:15:56,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.3) internal successors, (159), 30 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:56,357 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 4593 transitions. [2025-02-05 16:15:56,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 16:15:56,357 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:56,357 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:56,364 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 16:15:56,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-05 16:15:56,558 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:56,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:56,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1590986250, now seen corresponding path program 1 times [2025-02-05 16:15:56,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:56,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250461045] [2025-02-05 16:15:56,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:56,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:56,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 16:15:56,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 16:15:56,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:56,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:56,806 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:56,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:56,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250461045] [2025-02-05 16:15:56,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250461045] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:15:56,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122395691] [2025-02-05 16:15:56,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:56,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:15:56,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:15:56,809 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:15:56,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 16:15:56,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 16:15:56,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 16:15:56,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:56,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:56,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 16:15:56,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:15:57,223 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:57,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:15:57,593 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:57,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122395691] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:15:57,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:15:57,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-02-05 16:15:57,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756972336] [2025-02-05 16:15:57,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:15:57,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 16:15:57,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:57,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 16:15:57,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2025-02-05 16:15:57,595 INFO L87 Difference]: Start difference. First operand 3707 states and 4593 transitions. Second operand has 22 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 21 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:58,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:58,073 INFO L93 Difference]: Finished difference Result 10406 states and 13012 transitions. [2025-02-05 16:15:58,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:15:58,073 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 21 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-02-05 16:15:58,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:58,089 INFO L225 Difference]: With dead ends: 10406 [2025-02-05 16:15:58,089 INFO L226 Difference]: Without dead ends: 7368 [2025-02-05 16:15:58,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=273, Invalid=783, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 16:15:58,093 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 596 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:58,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 409 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:15:58,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7368 states. [2025-02-05 16:15:58,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7368 to 7252. [2025-02-05 16:15:58,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7252 states, 7251 states have (on average 1.225348227830644) internal successors, (8885), 7251 states have internal predecessors, (8885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:58,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7252 states to 7252 states and 8885 transitions. [2025-02-05 16:15:58,242 INFO L78 Accepts]: Start accepts. Automaton has 7252 states and 8885 transitions. Word has length 59 [2025-02-05 16:15:58,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:58,243 INFO L471 AbstractCegarLoop]: Abstraction has 7252 states and 8885 transitions. [2025-02-05 16:15:58,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 21 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:58,243 INFO L276 IsEmpty]: Start isEmpty. Operand 7252 states and 8885 transitions. [2025-02-05 16:15:58,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 16:15:58,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:58,244 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:58,257 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 16:15:58,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:15:58,444 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:58,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:58,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1951007715, now seen corresponding path program 1 times [2025-02-05 16:15:58,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:58,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856193691] [2025-02-05 16:15:58,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:58,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:58,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 16:15:58,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 16:15:58,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:58,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:59,524 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:59,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:59,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856193691] [2025-02-05 16:15:59,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856193691] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:15:59,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592071721] [2025-02-05 16:15:59,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:59,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:15:59,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:15:59,528 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:15:59,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 16:15:59,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 16:15:59,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 16:15:59,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:59,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:59,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 16:15:59,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:16:00,287 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:00,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:16:01,391 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:01,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592071721] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:16:01,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:16:01,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 13] total 44 [2025-02-05 16:16:01,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27088550] [2025-02-05 16:16:01,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:16:01,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-02-05 16:16:01,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:16:01,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-02-05 16:16:01,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1737, Unknown=0, NotChecked=0, Total=1892 [2025-02-05 16:16:01,393 INFO L87 Difference]: Start difference. First operand 7252 states and 8885 transitions. Second operand has 44 states, 44 states have (on average 3.5) internal successors, (154), 44 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:16:08,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:16:08,044 INFO L93 Difference]: Finished difference Result 12385 states and 15231 transitions. [2025-02-05 16:16:08,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-02-05 16:16:08,044 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.5) internal successors, (154), 44 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-02-05 16:16:08,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:16:08,061 INFO L225 Difference]: With dead ends: 12385 [2025-02-05 16:16:08,061 INFO L226 Difference]: Without dead ends: 8903 [2025-02-05 16:16:08,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3113 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=2468, Invalid=9742, Unknown=0, NotChecked=0, Total=12210 [2025-02-05 16:16:08,068 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 2905 mSDsluCounter, 2403 mSDsCounter, 0 mSdLazyCounter, 2105 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2905 SdHoareTripleChecker+Valid, 2516 SdHoareTripleChecker+Invalid, 2218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 2105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:16:08,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2905 Valid, 2516 Invalid, 2218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 2105 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 16:16:08,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8903 states. [2025-02-05 16:16:08,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8903 to 6095. [2025-02-05 16:16:08,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6095 states, 6094 states have (on average 1.2190679356744338) internal successors, (7429), 6094 states have internal predecessors, (7429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:16:08,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6095 states to 6095 states and 7429 transitions. [2025-02-05 16:16:08,266 INFO L78 Accepts]: Start accepts. Automaton has 6095 states and 7429 transitions. Word has length 60 [2025-02-05 16:16:08,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:16:08,266 INFO L471 AbstractCegarLoop]: Abstraction has 6095 states and 7429 transitions. [2025-02-05 16:16:08,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.5) internal successors, (154), 44 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:16:08,267 INFO L276 IsEmpty]: Start isEmpty. Operand 6095 states and 7429 transitions. [2025-02-05 16:16:08,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 16:16:08,267 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:16:08,267 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:16:08,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 16:16:08,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:16:08,474 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:16:08,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:16:08,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1133059932, now seen corresponding path program 1 times [2025-02-05 16:16:08,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:16:08,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288234226] [2025-02-05 16:16:08,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:16:08,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:16:08,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 16:16:08,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 16:16:08,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:16:08,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:16:08,948 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:08,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:16:08,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288234226] [2025-02-05 16:16:08,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288234226] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:16:08,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174776225] [2025-02-05 16:16:08,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:16:08,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:16:08,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:16:08,953 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:16:08,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 16:16:08,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 16:16:09,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 16:16:09,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:16:09,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:16:09,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-05 16:16:09,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:16:10,309 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:10,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:16:11,577 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:11,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174776225] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:16:11,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:16:11,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 17] total 43 [2025-02-05 16:16:11,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054733882] [2025-02-05 16:16:11,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:16:11,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-02-05 16:16:11,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:16:11,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-02-05 16:16:11,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1553, Unknown=0, NotChecked=0, Total=1806 [2025-02-05 16:16:11,579 INFO L87 Difference]: Start difference. First operand 6095 states and 7429 transitions. Second operand has 43 states, 43 states have (on average 3.697674418604651) internal successors, (159), 43 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:16:21,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:16:21,513 INFO L93 Difference]: Finished difference Result 10929 states and 13475 transitions. [2025-02-05 16:16:21,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2025-02-05 16:16:21,514 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.697674418604651) internal successors, (159), 43 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-02-05 16:16:21,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:16:21,524 INFO L225 Difference]: With dead ends: 10929 [2025-02-05 16:16:21,524 INFO L226 Difference]: Without dead ends: 6474 [2025-02-05 16:16:21,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6555 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=3887, Invalid=14203, Unknown=0, NotChecked=0, Total=18090 [2025-02-05 16:16:21,529 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 1561 mSDsluCounter, 1794 mSDsCounter, 0 mSdLazyCounter, 1877 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1561 SdHoareTripleChecker+Valid, 1884 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:16:21,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1561 Valid, 1884 Invalid, 1937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1877 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 16:16:21,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6474 states. [2025-02-05 16:16:21,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6474 to 5054. [2025-02-05 16:16:21,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5054 states, 5053 states have (on average 1.2291707896299229) internal successors, (6211), 5053 states have internal predecessors, (6211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:16:21,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5054 states to 5054 states and 6211 transitions. [2025-02-05 16:16:21,698 INFO L78 Accepts]: Start accepts. Automaton has 5054 states and 6211 transitions. Word has length 60 [2025-02-05 16:16:21,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:16:21,698 INFO L471 AbstractCegarLoop]: Abstraction has 5054 states and 6211 transitions. [2025-02-05 16:16:21,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.697674418604651) internal successors, (159), 43 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:16:21,699 INFO L276 IsEmpty]: Start isEmpty. Operand 5054 states and 6211 transitions. [2025-02-05 16:16:21,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 16:16:21,700 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:16:21,700 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:16:21,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 16:16:21,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:16:21,901 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:16:21,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:16:21,901 INFO L85 PathProgramCache]: Analyzing trace with hash 100282772, now seen corresponding path program 1 times [2025-02-05 16:16:21,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:16:21,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651132067] [2025-02-05 16:16:21,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:16:21,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:16:21,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 16:16:21,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 16:16:21,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:16:21,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:16:22,392 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:22,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:16:22,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651132067] [2025-02-05 16:16:22,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651132067] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:16:22,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671105873] [2025-02-05 16:16:22,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:16:22,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:16:22,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:16:22,400 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:16:22,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 16:16:22,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 16:16:22,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 16:16:22,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:16:22,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:16:22,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-05 16:16:22,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:16:23,848 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 24 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:23,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:16:26,682 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 24 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:26,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671105873] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:16:26,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:16:26,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 22] total 54 [2025-02-05 16:16:26,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074290136] [2025-02-05 16:16:26,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:16:26,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-02-05 16:16:26,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:16:26,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-02-05 16:16:26,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=2547, Unknown=0, NotChecked=0, Total=2862 [2025-02-05 16:16:26,684 INFO L87 Difference]: Start difference. First operand 5054 states and 6211 transitions. Second operand has 54 states, 54 states have (on average 5.111111111111111) internal successors, (276), 54 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:16:43,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:16:43,098 INFO L93 Difference]: Finished difference Result 9502 states and 11801 transitions. [2025-02-05 16:16:43,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2025-02-05 16:16:43,099 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.111111111111111) internal successors, (276), 54 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-02-05 16:16:43,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:16:43,108 INFO L225 Difference]: With dead ends: 9502 [2025-02-05 16:16:43,109 INFO L226 Difference]: Without dead ends: 7697 [2025-02-05 16:16:43,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9085 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=5355, Invalid=25095, Unknown=0, NotChecked=0, Total=30450 [2025-02-05 16:16:43,114 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 2882 mSDsluCounter, 2603 mSDsCounter, 0 mSdLazyCounter, 2753 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2882 SdHoareTripleChecker+Valid, 2715 SdHoareTripleChecker+Invalid, 2929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 2753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:16:43,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2882 Valid, 2715 Invalid, 2929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 2753 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 16:16:43,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7697 states. [2025-02-05 16:16:43,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7697 to 6025. [2025-02-05 16:16:43,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6025 states, 6024 states have (on average 1.2197875166002656) internal successors, (7348), 6024 states have internal predecessors, (7348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:16:43,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6025 states to 6025 states and 7348 transitions. [2025-02-05 16:16:43,376 INFO L78 Accepts]: Start accepts. Automaton has 6025 states and 7348 transitions. Word has length 98 [2025-02-05 16:16:43,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:16:43,376 INFO L471 AbstractCegarLoop]: Abstraction has 6025 states and 7348 transitions. [2025-02-05 16:16:43,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.111111111111111) internal successors, (276), 54 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:16:43,377 INFO L276 IsEmpty]: Start isEmpty. Operand 6025 states and 7348 transitions. [2025-02-05 16:16:43,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 16:16:43,379 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:16:43,379 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:16:43,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 16:16:43,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-02-05 16:16:43,579 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:16:43,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:16:43,580 INFO L85 PathProgramCache]: Analyzing trace with hash 703234937, now seen corresponding path program 1 times [2025-02-05 16:16:43,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:16:43,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460365318] [2025-02-05 16:16:43,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:16:43,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:16:43,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 16:16:43,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 16:16:43,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:16:43,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:16:44,222 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 34 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:44,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:16:44,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460365318] [2025-02-05 16:16:44,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460365318] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:16:44,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178613967] [2025-02-05 16:16:44,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:16:44,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:16:44,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:16:44,228 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:16:44,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 16:16:44,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 16:16:44,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 16:16:44,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:16:44,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:16:44,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-05 16:16:44,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:16:45,820 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 16 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:45,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:16:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 16 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:48,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178613967] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:16:48,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:16:48,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25, 26] total 68 [2025-02-05 16:16:48,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125981382] [2025-02-05 16:16:48,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:16:48,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-02-05 16:16:48,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:16:48,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-02-05 16:16:48,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=4236, Unknown=0, NotChecked=0, Total=4556 [2025-02-05 16:16:48,764 INFO L87 Difference]: Start difference. First operand 6025 states and 7348 transitions. Second operand has 68 states, 68 states have (on average 4.161764705882353) internal successors, (283), 68 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:23,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:23,230 INFO L93 Difference]: Finished difference Result 23891 states and 29198 transitions. [2025-02-05 16:17:23,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2025-02-05 16:17:23,230 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 4.161764705882353) internal successors, (283), 68 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-02-05 16:17:23,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:23,252 INFO L225 Difference]: With dead ends: 23891 [2025-02-05 16:17:23,253 INFO L226 Difference]: Without dead ends: 20827 [2025-02-05 16:17:23,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21377 ImplicationChecksByTransitivity, 32.8s TimeCoverageRelationStatistics Valid=7657, Invalid=55093, Unknown=0, NotChecked=0, Total=62750 [2025-02-05 16:17:23,260 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 9194 mSDsluCounter, 4511 mSDsCounter, 0 mSdLazyCounter, 3761 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9194 SdHoareTripleChecker+Valid, 4681 SdHoareTripleChecker+Invalid, 4182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 3761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:23,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9194 Valid, 4681 Invalid, 4182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 3761 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 16:17:23,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20827 states. [2025-02-05 16:17:23,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20827 to 9795. [2025-02-05 16:17:23,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9795 states, 9794 states have (on average 1.216254849908107) internal successors, (11912), 9794 states have internal predecessors, (11912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:23,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9795 states to 9795 states and 11912 transitions. [2025-02-05 16:17:23,823 INFO L78 Accepts]: Start accepts. Automaton has 9795 states and 11912 transitions. Word has length 99 [2025-02-05 16:17:23,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:23,823 INFO L471 AbstractCegarLoop]: Abstraction has 9795 states and 11912 transitions. [2025-02-05 16:17:23,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 4.161764705882353) internal successors, (283), 68 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:23,823 INFO L276 IsEmpty]: Start isEmpty. Operand 9795 states and 11912 transitions. [2025-02-05 16:17:23,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 16:17:23,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:23,825 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:17:23,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 16:17:24,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:17:24,029 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:24,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:24,031 INFO L85 PathProgramCache]: Analyzing trace with hash -506580488, now seen corresponding path program 1 times [2025-02-05 16:17:24,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:24,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579510529] [2025-02-05 16:17:24,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:24,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:24,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 16:17:24,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 16:17:24,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:24,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat