./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_loop_v.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.sw_loop_v.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 7e5038cf4746b0d33da8db40d97242789791fda4fe0e15050faace48f6985f4f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:00:43,354 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:00:43,408 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 20:00:43,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:00:43,414 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:00:43,435 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:00:43,436 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:00:43,437 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:00:43,437 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:00:43,437 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:00:43,437 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:00:43,438 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:00:43,438 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:00:43,438 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:00:43,438 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:00:43,438 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:00:43,438 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:00:43,438 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:00:43,438 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:00:43,438 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:00:43,438 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:00:43,438 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:00:43,438 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:00:43,438 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:00:43,438 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:00:43,438 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:00:43,439 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:00:43,439 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:00:43,439 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:00:43,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:00:43,439 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:00:43,439 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:00:43,439 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:00:43,439 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:00:43,439 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:00:43,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:00:43,439 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:00:43,439 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:00:43,439 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:00:43,439 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:00:43,439 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7e5038cf4746b0d33da8db40d97242789791fda4fe0e15050faace48f6985f4f [2025-02-05 20:00:43,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:00:43,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:00:43,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:00:43,683 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:00:43,683 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:00:43,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_loop_v.c [2025-02-05 20:00:44,843 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f2a327daa/a59fc792359d4b1aac9ad0815cda806c/FLAG1ab122ab6 [2025-02-05 20:00:45,174 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:00:45,178 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_loop_v.c [2025-02-05 20:00:45,187 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f2a327daa/a59fc792359d4b1aac9ad0815cda806c/FLAG1ab122ab6 [2025-02-05 20:00:45,440 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f2a327daa/a59fc792359d4b1aac9ad0815cda806c [2025-02-05 20:00:45,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:00:45,443 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:00:45,444 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:00:45,444 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:00:45,446 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:00:45,447 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:00:45" (1/1) ... [2025-02-05 20:00:45,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26d6927d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:45, skipping insertion in model container [2025-02-05 20:00:45,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:00:45" (1/1) ... [2025-02-05 20:00:45,470 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:00:45,570 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/hardware-verification-bv/btor2c-lazyMod.sw_loop_v.c[1249,1262] [2025-02-05 20:00:45,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:00:45,664 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:00:45,670 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/hardware-verification-bv/btor2c-lazyMod.sw_loop_v.c[1249,1262] [2025-02-05 20:00:45,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:00:45,757 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:00:45,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:45 WrapperNode [2025-02-05 20:00:45,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:00:45,758 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:00:45,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:00:45,759 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:00:45,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:45" (1/1) ... [2025-02-05 20:00:45,778 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:45" (1/1) ... [2025-02-05 20:00:45,852 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1012 [2025-02-05 20:00:45,853 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:00:45,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:00:45,854 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:00:45,854 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:00:45,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:45" (1/1) ... [2025-02-05 20:00:45,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:45" (1/1) ... [2025-02-05 20:00:45,879 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:45" (1/1) ... [2025-02-05 20:00:45,908 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 20:00:45,908 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:45" (1/1) ... [2025-02-05 20:00:45,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:45" (1/1) ... [2025-02-05 20:00:45,933 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:45" (1/1) ... [2025-02-05 20:00:45,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:45" (1/1) ... [2025-02-05 20:00:45,949 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:45" (1/1) ... [2025-02-05 20:00:45,957 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:45" (1/1) ... [2025-02-05 20:00:45,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:00:45,975 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:00:45,975 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:00:45,975 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:00:45,975 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:45" (1/1) ... [2025-02-05 20:00:45,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:00:45,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:00:46,001 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 20:00:46,005 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 20:00:46,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:00:46,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:00:46,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:00:46,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:00:46,138 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:00:46,139 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:00:47,072 INFO L? ?]: Removed 647 outVars from TransFormulas that were not future-live. [2025-02-05 20:00:47,073 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:00:47,131 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:00:47,133 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:00:47,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:00:47 BoogieIcfgContainer [2025-02-05 20:00:47,134 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:00:47,135 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:00:47,135 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:00:47,139 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:00:47,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:00:45" (1/3) ... [2025-02-05 20:00:47,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c536f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:00:47, skipping insertion in model container [2025-02-05 20:00:47,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:00:45" (2/3) ... [2025-02-05 20:00:47,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c536f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:00:47, skipping insertion in model container [2025-02-05 20:00:47,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:00:47" (3/3) ... [2025-02-05 20:00:47,141 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.sw_loop_v.c [2025-02-05 20:00:47,151 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:00:47,153 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.sw_loop_v.c that has 1 procedures, 298 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:00:47,189 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:00:47,197 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;@27fc93d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:00:47,197 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:00:47,200 INFO L276 IsEmpty]: Start isEmpty. Operand has 298 states, 296 states have (on average 1.4966216216216217) internal successors, (443), 297 states have internal predecessors, (443), 0 states have call successors, (0), 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 20:00:47,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 20:00:47,204 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:47,204 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] [2025-02-05 20:00:47,205 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:47,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:47,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1458086393, now seen corresponding path program 1 times [2025-02-05 20:00:47,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:47,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753043202] [2025-02-05 20:00:47,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:47,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:47,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 20:00:47,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 20:00:47,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:47,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:47,593 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 20:00:47,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:47,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753043202] [2025-02-05 20:00:47,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753043202] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:47,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:47,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:00:47,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650151385] [2025-02-05 20:00:47,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:47,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:00:47,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:47,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:00:47,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:00:47,614 INFO L87 Difference]: Start difference. First operand has 298 states, 296 states have (on average 1.4966216216216217) internal successors, (443), 297 states have internal predecessors, (443), 0 states have call successors, (0), 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 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:47,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:47,797 INFO L93 Difference]: Finished difference Result 557 states and 831 transitions. [2025-02-05 20:00:47,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:00:47,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-02-05 20:00:47,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:47,805 INFO L225 Difference]: With dead ends: 557 [2025-02-05 20:00:47,805 INFO L226 Difference]: Without dead ends: 297 [2025-02-05 20:00:47,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:00:47,809 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 0 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:47,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1090 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:00:47,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-02-05 20:00:47,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2025-02-05 20:00:47,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.489864864864865) internal successors, (441), 296 states have internal predecessors, (441), 0 states have call successors, (0), 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 20:00:47,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 441 transitions. [2025-02-05 20:00:47,847 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 441 transitions. Word has length 27 [2025-02-05 20:00:47,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:47,847 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 441 transitions. [2025-02-05 20:00:47,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:47,848 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 441 transitions. [2025-02-05 20:00:47,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-05 20:00:47,850 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:47,850 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] [2025-02-05 20:00:47,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 20:00:47,850 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:47,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:47,851 INFO L85 PathProgramCache]: Analyzing trace with hash 2048641645, now seen corresponding path program 1 times [2025-02-05 20:00:47,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:47,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547589917] [2025-02-05 20:00:47,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:47,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:47,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-05 20:00:47,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 20:00:47,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:47,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:47,986 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 20:00:47,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:47,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547589917] [2025-02-05 20:00:47,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547589917] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:47,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:47,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:00:47,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941272475] [2025-02-05 20:00:47,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:47,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:00:47,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:47,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:00:47,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:00:47,988 INFO L87 Difference]: Start difference. First operand 297 states and 441 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 20:00:48,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:48,136 INFO L93 Difference]: Finished difference Result 558 states and 829 transitions. [2025-02-05 20:00:48,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:00:48,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-02-05 20:00:48,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:48,138 INFO L225 Difference]: With dead ends: 558 [2025-02-05 20:00:48,138 INFO L226 Difference]: Without dead ends: 299 [2025-02-05 20:00:48,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:00:48,139 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 0 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:48,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1087 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:00:48,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-02-05 20:00:48,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2025-02-05 20:00:48,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.4865771812080537) internal successors, (443), 298 states have internal predecessors, (443), 0 states have call successors, (0), 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 20:00:48,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 443 transitions. [2025-02-05 20:00:48,154 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 443 transitions. Word has length 28 [2025-02-05 20:00:48,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:48,154 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 443 transitions. [2025-02-05 20:00:48,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 20:00:48,155 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 443 transitions. [2025-02-05 20:00:48,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 20:00:48,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:48,156 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] [2025-02-05 20:00:48,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:00:48,156 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:48,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:48,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1014891202, now seen corresponding path program 1 times [2025-02-05 20:00:48,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:48,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678312187] [2025-02-05 20:00:48,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:48,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:48,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 20:00:48,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 20:00:48,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:48,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:48,319 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 20:00:48,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:48,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678312187] [2025-02-05 20:00:48,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678312187] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:48,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:48,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:00:48,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598190576] [2025-02-05 20:00:48,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:48,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:00:48,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:48,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:00:48,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:00:48,321 INFO L87 Difference]: Start difference. First operand 299 states and 443 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:48,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:48,564 INFO L93 Difference]: Finished difference Result 795 states and 1180 transitions. [2025-02-05 20:00:48,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:00:48,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-05 20:00:48,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:48,567 INFO L225 Difference]: With dead ends: 795 [2025-02-05 20:00:48,567 INFO L226 Difference]: Without dead ends: 534 [2025-02-05 20:00:48,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:48,568 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 1117 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:48,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 1060 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:48,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-02-05 20:00:48,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 301. [2025-02-05 20:00:48,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.4833333333333334) internal successors, (445), 300 states have internal predecessors, (445), 0 states have call successors, (0), 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 20:00:48,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 445 transitions. [2025-02-05 20:00:48,579 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 445 transitions. Word has length 29 [2025-02-05 20:00:48,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:48,579 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 445 transitions. [2025-02-05 20:00:48,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:48,579 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 445 transitions. [2025-02-05 20:00:48,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-05 20:00:48,583 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:48,583 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:00:48,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:00:48,583 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:48,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:48,584 INFO L85 PathProgramCache]: Analyzing trace with hash -162977166, now seen corresponding path program 1 times [2025-02-05 20:00:48,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:48,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494653679] [2025-02-05 20:00:48,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:48,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:48,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 20:00:48,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 20:00:48,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:48,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:49,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:49,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:49,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494653679] [2025-02-05 20:00:49,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494653679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:49,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:49,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:00:49,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057471735] [2025-02-05 20:00:49,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:49,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:00:49,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:49,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:00:49,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:00:49,446 INFO L87 Difference]: Start difference. First operand 301 states and 445 transitions. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 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 20:00:49,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:49,688 INFO L93 Difference]: Finished difference Result 778 states and 1154 transitions. [2025-02-05 20:00:49,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:00:49,689 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 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 158 [2025-02-05 20:00:49,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:49,691 INFO L225 Difference]: With dead ends: 778 [2025-02-05 20:00:49,691 INFO L226 Difference]: Without dead ends: 517 [2025-02-05 20:00:49,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:00:49,696 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 1048 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:49,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 1312 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:49,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-02-05 20:00:49,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 326. [2025-02-05 20:00:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.4738461538461538) internal successors, (479), 325 states have internal predecessors, (479), 0 states have call successors, (0), 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 20:00:49,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 479 transitions. [2025-02-05 20:00:49,711 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 479 transitions. Word has length 158 [2025-02-05 20:00:49,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:49,711 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 479 transitions. [2025-02-05 20:00:49,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 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 20:00:49,714 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 479 transitions. [2025-02-05 20:00:49,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 20:00:49,717 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:49,717 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:00:49,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 20:00:49,717 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:49,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:49,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1757927362, now seen corresponding path program 1 times [2025-02-05 20:00:49,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:49,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595329343] [2025-02-05 20:00:49,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:49,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:49,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 20:00:49,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 20:00:49,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:49,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:50,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:50,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595329343] [2025-02-05 20:00:50,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595329343] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:50,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:50,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:00:50,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881309923] [2025-02-05 20:00:50,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:50,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:00:50,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:50,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:00:50,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:00:50,140 INFO L87 Difference]: Start difference. First operand 326 states and 479 transitions. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 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 20:00:50,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:50,332 INFO L93 Difference]: Finished difference Result 780 states and 1155 transitions. [2025-02-05 20:00:50,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:00:50,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 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 159 [2025-02-05 20:00:50,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:50,334 INFO L225 Difference]: With dead ends: 780 [2025-02-05 20:00:50,334 INFO L226 Difference]: Without dead ends: 519 [2025-02-05 20:00:50,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:50,335 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 1053 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:50,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 1063 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:50,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-02-05 20:00:50,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 326. [2025-02-05 20:00:50,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.4707692307692308) internal successors, (478), 325 states have internal predecessors, (478), 0 states have call successors, (0), 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 20:00:50,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 478 transitions. [2025-02-05 20:00:50,342 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 478 transitions. Word has length 159 [2025-02-05 20:00:50,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:50,342 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 478 transitions. [2025-02-05 20:00:50,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 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 20:00:50,342 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 478 transitions. [2025-02-05 20:00:50,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 20:00:50,343 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:50,343 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:00:50,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 20:00:50,344 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:50,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:50,344 INFO L85 PathProgramCache]: Analyzing trace with hash -202272953, now seen corresponding path program 1 times [2025-02-05 20:00:50,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:50,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362925337] [2025-02-05 20:00:50,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:50,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:50,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 20:00:50,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 20:00:50,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:50,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:51,241 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:51,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:51,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362925337] [2025-02-05 20:00:51,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362925337] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:51,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:51,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:00:51,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116348433] [2025-02-05 20:00:51,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:51,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:00:51,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:51,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:00:51,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:00:51,244 INFO L87 Difference]: Start difference. First operand 326 states and 478 transitions. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 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 20:00:51,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:51,459 INFO L93 Difference]: Finished difference Result 772 states and 1142 transitions. [2025-02-05 20:00:51,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:00:51,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 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 159 [2025-02-05 20:00:51,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:51,462 INFO L225 Difference]: With dead ends: 772 [2025-02-05 20:00:51,462 INFO L226 Difference]: Without dead ends: 511 [2025-02-05 20:00:51,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:51,463 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 1012 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:51,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 1049 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:51,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-02-05 20:00:51,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 349. [2025-02-05 20:00:51,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4683908045977012) internal successors, (511), 348 states have internal predecessors, (511), 0 states have call successors, (0), 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 20:00:51,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 511 transitions. [2025-02-05 20:00:51,469 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 511 transitions. Word has length 159 [2025-02-05 20:00:51,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:51,469 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 511 transitions. [2025-02-05 20:00:51,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 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 20:00:51,470 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 511 transitions. [2025-02-05 20:00:51,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-05 20:00:51,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:51,471 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:00:51,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 20:00:51,471 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:51,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:51,471 INFO L85 PathProgramCache]: Analyzing trace with hash -51604092, now seen corresponding path program 1 times [2025-02-05 20:00:51,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:51,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868466330] [2025-02-05 20:00:51,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:51,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:51,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 20:00:51,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 20:00:51,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:51,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:52,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:52,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:52,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868466330] [2025-02-05 20:00:52,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868466330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:52,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:52,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:00:52,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588401561] [2025-02-05 20:00:52,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:52,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:00:52,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:52,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:00:52,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:00:52,294 INFO L87 Difference]: Start difference. First operand 349 states and 511 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 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 20:00:52,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:52,551 INFO L93 Difference]: Finished difference Result 772 states and 1140 transitions. [2025-02-05 20:00:52,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:00:52,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2025-02-05 20:00:52,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:52,553 INFO L225 Difference]: With dead ends: 772 [2025-02-05 20:00:52,553 INFO L226 Difference]: Without dead ends: 511 [2025-02-05 20:00:52,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:52,554 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 982 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:52,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 1048 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:52,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-02-05 20:00:52,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 400. [2025-02-05 20:00:52,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 1.468671679197995) internal successors, (586), 399 states have internal predecessors, (586), 0 states have call successors, (0), 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 20:00:52,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 586 transitions. [2025-02-05 20:00:52,561 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 586 transitions. Word has length 161 [2025-02-05 20:00:52,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:52,562 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 586 transitions. [2025-02-05 20:00:52,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 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 20:00:52,562 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 586 transitions. [2025-02-05 20:00:52,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 20:00:52,563 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:52,563 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:00:52,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 20:00:52,563 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:52,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:52,564 INFO L85 PathProgramCache]: Analyzing trace with hash 914758356, now seen corresponding path program 1 times [2025-02-05 20:00:52,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:52,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222110610] [2025-02-05 20:00:52,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:52,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:52,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 20:00:52,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 20:00:52,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:52,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:53,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:53,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:53,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222110610] [2025-02-05 20:00:53,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222110610] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:53,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:53,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:00:53,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232950076] [2025-02-05 20:00:53,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:53,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:00:53,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:53,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:00:53,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:00:53,380 INFO L87 Difference]: Start difference. First operand 400 states and 586 transitions. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 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 20:00:53,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:53,619 INFO L93 Difference]: Finished difference Result 772 states and 1139 transitions. [2025-02-05 20:00:53,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:00:53,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-02-05 20:00:53,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:53,621 INFO L225 Difference]: With dead ends: 772 [2025-02-05 20:00:53,621 INFO L226 Difference]: Without dead ends: 511 [2025-02-05 20:00:53,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:53,622 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 965 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:53,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 1048 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:53,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-02-05 20:00:53,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 428. [2025-02-05 20:00:53,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 1.468384074941452) internal successors, (627), 427 states have internal predecessors, (627), 0 states have call successors, (0), 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 20:00:53,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 627 transitions. [2025-02-05 20:00:53,638 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 627 transitions. Word has length 162 [2025-02-05 20:00:53,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:53,639 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 627 transitions. [2025-02-05 20:00:53,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 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 20:00:53,639 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 627 transitions. [2025-02-05 20:00:53,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 20:00:53,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:53,640 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:00:53,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 20:00:53,642 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:53,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:53,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1349351783, now seen corresponding path program 1 times [2025-02-05 20:00:53,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:53,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128383377] [2025-02-05 20:00:53,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:53,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:53,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 20:00:53,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 20:00:53,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:53,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:54,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:54,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:54,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128383377] [2025-02-05 20:00:54,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128383377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:54,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:54,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:00:54,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015107313] [2025-02-05 20:00:54,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:54,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:00:54,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:54,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:00:54,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:00:54,243 INFO L87 Difference]: Start difference. First operand 428 states and 627 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 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 20:00:54,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:54,467 INFO L93 Difference]: Finished difference Result 772 states and 1138 transitions. [2025-02-05 20:00:54,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:00:54,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2025-02-05 20:00:54,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:54,470 INFO L225 Difference]: With dead ends: 772 [2025-02-05 20:00:54,470 INFO L226 Difference]: Without dead ends: 511 [2025-02-05 20:00:54,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:54,471 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 948 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:54,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 1048 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:54,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-02-05 20:00:54,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 456. [2025-02-05 20:00:54,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 1.468131868131868) internal successors, (668), 455 states have internal predecessors, (668), 0 states have call successors, (0), 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 20:00:54,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 668 transitions. [2025-02-05 20:00:54,485 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 668 transitions. Word has length 163 [2025-02-05 20:00:54,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:54,485 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 668 transitions. [2025-02-05 20:00:54,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 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 20:00:54,486 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 668 transitions. [2025-02-05 20:00:54,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-05 20:00:54,487 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:54,488 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:00:54,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 20:00:54,488 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:54,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:54,488 INFO L85 PathProgramCache]: Analyzing trace with hash -2052595625, now seen corresponding path program 1 times [2025-02-05 20:00:54,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:54,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367628262] [2025-02-05 20:00:54,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:54,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:54,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 20:00:54,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 20:00:54,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:54,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:55,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:55,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:55,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367628262] [2025-02-05 20:00:55,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367628262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:55,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:55,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:00:55,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111052844] [2025-02-05 20:00:55,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:55,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:00:55,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:55,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:00:55,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:55,070 INFO L87 Difference]: Start difference. First operand 456 states and 668 transitions. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 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 20:00:55,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:55,330 INFO L93 Difference]: Finished difference Result 802 states and 1181 transitions. [2025-02-05 20:00:55,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:00:55,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-02-05 20:00:55,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:55,332 INFO L225 Difference]: With dead ends: 802 [2025-02-05 20:00:55,332 INFO L226 Difference]: Without dead ends: 519 [2025-02-05 20:00:55,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:00:55,333 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 983 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:55,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 1551 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:55,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-02-05 20:00:55,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 458. [2025-02-05 20:00:55,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 1.4660831509846828) internal successors, (670), 457 states have internal predecessors, (670), 0 states have call successors, (0), 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 20:00:55,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 670 transitions. [2025-02-05 20:00:55,341 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 670 transitions. Word has length 164 [2025-02-05 20:00:55,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:55,341 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 670 transitions. [2025-02-05 20:00:55,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 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 20:00:55,341 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 670 transitions. [2025-02-05 20:00:55,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 20:00:55,342 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:55,342 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:00:55,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 20:00:55,342 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:55,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:55,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1934421627, now seen corresponding path program 1 times [2025-02-05 20:00:55,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:55,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158647385] [2025-02-05 20:00:55,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:55,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:55,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 20:00:55,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 20:00:55,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:55,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:55,871 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:55,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:55,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158647385] [2025-02-05 20:00:55,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158647385] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:55,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:55,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:00:55,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433411112] [2025-02-05 20:00:55,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:55,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:00:55,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:55,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:00:55,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:55,873 INFO L87 Difference]: Start difference. First operand 458 states and 670 transitions. Second operand has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 0 states have call successors, (0), 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 20:00:56,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:56,145 INFO L93 Difference]: Finished difference Result 782 states and 1151 transitions. [2025-02-05 20:00:56,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:00:56,145 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2025-02-05 20:00:56,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:56,147 INFO L225 Difference]: With dead ends: 782 [2025-02-05 20:00:56,147 INFO L226 Difference]: Without dead ends: 521 [2025-02-05 20:00:56,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:00:56,148 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 966 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:56,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [966 Valid, 1652 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:56,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-02-05 20:00:56,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 461. [2025-02-05 20:00:56,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 1.4652173913043478) internal successors, (674), 460 states have internal predecessors, (674), 0 states have call successors, (0), 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 20:00:56,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 674 transitions. [2025-02-05 20:00:56,156 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 674 transitions. Word has length 165 [2025-02-05 20:00:56,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:56,158 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 674 transitions. [2025-02-05 20:00:56,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 0 states have call successors, (0), 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 20:00:56,158 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 674 transitions. [2025-02-05 20:00:56,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-05 20:00:56,159 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:56,160 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:00:56,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 20:00:56,160 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:56,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:56,160 INFO L85 PathProgramCache]: Analyzing trace with hash 146747599, now seen corresponding path program 1 times [2025-02-05 20:00:56,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:56,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956470209] [2025-02-05 20:00:56,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:56,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:56,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 20:00:56,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 20:00:56,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:56,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:56,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:56,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:56,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956470209] [2025-02-05 20:00:56,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956470209] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:56,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:56,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:00:56,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074223706] [2025-02-05 20:00:56,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:56,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:00:56,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:56,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:00:56,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:00:56,790 INFO L87 Difference]: Start difference. First operand 461 states and 674 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 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 20:00:57,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:57,005 INFO L93 Difference]: Finished difference Result 776 states and 1141 transitions. [2025-02-05 20:00:57,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:00:57,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-02-05 20:00:57,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:57,007 INFO L225 Difference]: With dead ends: 776 [2025-02-05 20:00:57,007 INFO L226 Difference]: Without dead ends: 515 [2025-02-05 20:00:57,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:57,008 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 929 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:57,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 1048 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:57,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-02-05 20:00:57,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 488. [2025-02-05 20:00:57,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 487 states have (on average 1.4640657084188913) internal successors, (713), 487 states have internal predecessors, (713), 0 states have call successors, (0), 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 20:00:57,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 713 transitions. [2025-02-05 20:00:57,016 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 713 transitions. Word has length 166 [2025-02-05 20:00:57,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:57,016 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 713 transitions. [2025-02-05 20:00:57,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 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 20:00:57,016 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 713 transitions. [2025-02-05 20:00:57,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 20:00:57,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:57,017 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:00:57,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 20:00:57,017 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:57,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:57,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1617300910, now seen corresponding path program 1 times [2025-02-05 20:00:57,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:57,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346989498] [2025-02-05 20:00:57,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:57,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:57,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 20:00:57,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 20:00:57,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:57,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:57,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:57,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:57,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346989498] [2025-02-05 20:00:57,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346989498] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:57,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:57,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:00:57,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562632484] [2025-02-05 20:00:57,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:57,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:00:57,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:57,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:00:57,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:57,548 INFO L87 Difference]: Start difference. First operand 488 states and 713 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 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 20:00:57,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:57,827 INFO L93 Difference]: Finished difference Result 784 states and 1152 transitions. [2025-02-05 20:00:57,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:00:57,828 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-02-05 20:00:57,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:57,829 INFO L225 Difference]: With dead ends: 784 [2025-02-05 20:00:57,829 INFO L226 Difference]: Without dead ends: 523 [2025-02-05 20:00:57,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:00:57,830 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 948 mSDsluCounter, 1401 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:57,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 1753 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:57,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-02-05 20:00:57,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 491. [2025-02-05 20:00:57,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 490 states have (on average 1.463265306122449) internal successors, (717), 490 states have internal predecessors, (717), 0 states have call successors, (0), 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 20:00:57,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 717 transitions. [2025-02-05 20:00:57,838 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 717 transitions. Word has length 167 [2025-02-05 20:00:57,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:57,838 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 717 transitions. [2025-02-05 20:00:57,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 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 20:00:57,838 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 717 transitions. [2025-02-05 20:00:57,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 20:00:57,839 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:57,839 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:00:57,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 20:00:57,840 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:57,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:57,840 INFO L85 PathProgramCache]: Analyzing trace with hash 538502325, now seen corresponding path program 1 times [2025-02-05 20:00:57,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:57,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603510158] [2025-02-05 20:00:57,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:57,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:57,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 20:00:58,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 20:00:58,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:58,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:58,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:58,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:58,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603510158] [2025-02-05 20:00:58,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603510158] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:58,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:58,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:00:58,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198165914] [2025-02-05 20:00:58,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:58,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:00:58,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:58,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:00:58,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:00:58,344 INFO L87 Difference]: Start difference. First operand 491 states and 717 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 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 20:00:58,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:58,558 INFO L93 Difference]: Finished difference Result 781 states and 1147 transitions. [2025-02-05 20:00:58,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:00:58,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-02-05 20:00:58,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:58,560 INFO L225 Difference]: With dead ends: 781 [2025-02-05 20:00:58,560 INFO L226 Difference]: Without dead ends: 520 [2025-02-05 20:00:58,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:58,561 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 917 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:58,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 1045 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:58,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-02-05 20:00:58,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 518. [2025-02-05 20:00:58,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 517 states have (on average 1.4622823984526112) internal successors, (756), 517 states have internal predecessors, (756), 0 states have call successors, (0), 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 20:00:58,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 756 transitions. [2025-02-05 20:00:58,570 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 756 transitions. Word has length 168 [2025-02-05 20:00:58,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:58,570 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 756 transitions. [2025-02-05 20:00:58,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 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 20:00:58,570 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 756 transitions. [2025-02-05 20:00:58,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-05 20:00:58,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:58,571 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:00:58,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 20:00:58,571 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:58,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:58,572 INFO L85 PathProgramCache]: Analyzing trace with hash -836783921, now seen corresponding path program 1 times [2025-02-05 20:00:58,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:58,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076526534] [2025-02-05 20:00:58,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:58,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:58,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-05 20:00:58,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-05 20:00:58,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:58,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:59,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:59,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:59,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076526534] [2025-02-05 20:00:59,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076526534] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:59,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:59,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:00:59,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017651186] [2025-02-05 20:00:59,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:59,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:00:59,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:59,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:00:59,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:00:59,103 INFO L87 Difference]: Start difference. First operand 518 states and 756 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:59,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:00:59,386 INFO L93 Difference]: Finished difference Result 786 states and 1153 transitions. [2025-02-05 20:00:59,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:00:59,386 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2025-02-05 20:00:59,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:00:59,388 INFO L225 Difference]: With dead ends: 786 [2025-02-05 20:00:59,388 INFO L226 Difference]: Without dead ends: 525 [2025-02-05 20:00:59,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:00:59,389 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 925 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:00:59,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 1750 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:00:59,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-02-05 20:00:59,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 521. [2025-02-05 20:00:59,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 520 states have (on average 1.4615384615384615) internal successors, (760), 520 states have internal predecessors, (760), 0 states have call successors, (0), 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 20:00:59,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 760 transitions. [2025-02-05 20:00:59,399 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 760 transitions. Word has length 169 [2025-02-05 20:00:59,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:00:59,399 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 760 transitions. [2025-02-05 20:00:59,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:00:59,399 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 760 transitions. [2025-02-05 20:00:59,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-05 20:00:59,400 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:00:59,400 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:00:59,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 20:00:59,401 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:00:59,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:00:59,401 INFO L85 PathProgramCache]: Analyzing trace with hash -240840149, now seen corresponding path program 1 times [2025-02-05 20:00:59,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:00:59,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088935784] [2025-02-05 20:00:59,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:00:59,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:00:59,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-05 20:00:59,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-05 20:00:59,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:00:59,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:00:59,983 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:00:59,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:00:59,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088935784] [2025-02-05 20:00:59,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088935784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:00:59,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:00:59,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:00:59,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246300364] [2025-02-05 20:00:59,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:00:59,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:00:59,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:00:59,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:00:59,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:00:59,987 INFO L87 Difference]: Start difference. First operand 521 states and 760 transitions. Second operand has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 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 20:01:00,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:00,200 INFO L93 Difference]: Finished difference Result 901 states and 1318 transitions. [2025-02-05 20:01:00,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:01:00,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2025-02-05 20:01:00,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:00,202 INFO L225 Difference]: With dead ends: 901 [2025-02-05 20:01:00,202 INFO L226 Difference]: Without dead ends: 521 [2025-02-05 20:01:00,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:01:00,203 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 973 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:00,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 1049 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:01:00,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-02-05 20:01:00,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521. [2025-02-05 20:01:00,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 520 states have (on average 1.4596153846153845) internal successors, (759), 520 states have internal predecessors, (759), 0 states have call successors, (0), 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 20:01:00,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 759 transitions. [2025-02-05 20:01:00,210 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 759 transitions. Word has length 170 [2025-02-05 20:01:00,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:00,211 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 759 transitions. [2025-02-05 20:01:00,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 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 20:01:00,211 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 759 transitions. [2025-02-05 20:01:00,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-05 20:01:00,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:00,212 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:00,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 20:01:00,212 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:00,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:00,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1606676561, now seen corresponding path program 1 times [2025-02-05 20:01:00,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:00,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867735283] [2025-02-05 20:01:00,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:00,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:00,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-05 20:01:00,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-05 20:01:00,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:00,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:01,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:01,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:01,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867735283] [2025-02-05 20:01:01,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867735283] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:01:01,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:01:01,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:01:01,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610369486] [2025-02-05 20:01:01,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:01,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:01:01,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:01,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:01:01,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:01:01,127 INFO L87 Difference]: Start difference. First operand 521 states and 759 transitions. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:01,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:01,456 INFO L93 Difference]: Finished difference Result 815 states and 1195 transitions. [2025-02-05 20:01:01,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:01:01,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2025-02-05 20:01:01,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:01,458 INFO L225 Difference]: With dead ends: 815 [2025-02-05 20:01:01,458 INFO L226 Difference]: Without dead ends: 554 [2025-02-05 20:01:01,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 20:01:01,458 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 250 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:01,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1328 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:01:01,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-02-05 20:01:01,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2025-02-05 20:01:01,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 551 states have (on average 1.4591651542649728) internal successors, (804), 551 states have internal predecessors, (804), 0 states have call successors, (0), 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 20:01:01,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 804 transitions. [2025-02-05 20:01:01,467 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 804 transitions. Word has length 171 [2025-02-05 20:01:01,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:01,467 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 804 transitions. [2025-02-05 20:01:01,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:01,467 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 804 transitions. [2025-02-05 20:01:01,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-05 20:01:01,468 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:01,469 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:01,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 20:01:01,469 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:01,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:01,469 INFO L85 PathProgramCache]: Analyzing trace with hash -259233829, now seen corresponding path program 1 times [2025-02-05 20:01:01,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:01,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148666371] [2025-02-05 20:01:01,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:01,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:01,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-05 20:01:01,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-05 20:01:01,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:01,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:02,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:02,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:02,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148666371] [2025-02-05 20:01:02,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148666371] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:02,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212291121] [2025-02-05 20:01:02,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:02,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:02,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:01:02,088 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 20:01:02,089 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 20:01:02,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-05 20:01:02,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-05 20:01:02,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:02,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:02,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 1095 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-05 20:01:02,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:01:02,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:02,822 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:01:02,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212291121] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:01:02,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:01:02,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2025-02-05 20:01:02,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398090862] [2025-02-05 20:01:02,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:02,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:01:02,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:02,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:01:02,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-02-05 20:01:02,823 INFO L87 Difference]: Start difference. First operand 552 states and 804 transitions. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 0 states have call successors, (0), 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 20:01:03,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:03,218 INFO L93 Difference]: Finished difference Result 1035 states and 1511 transitions. [2025-02-05 20:01:03,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:01:03,218 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 0 states have call successors, (0), 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 172 [2025-02-05 20:01:03,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:03,220 INFO L225 Difference]: With dead ends: 1035 [2025-02-05 20:01:03,220 INFO L226 Difference]: Without dead ends: 551 [2025-02-05 20:01:03,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-02-05 20:01:03,221 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 322 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1813 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:03,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1813 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:01:03,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-02-05 20:01:03,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-02-05 20:01:03,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 550 states have (on average 1.4563636363636363) internal successors, (801), 550 states have internal predecessors, (801), 0 states have call successors, (0), 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 20:01:03,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 801 transitions. [2025-02-05 20:01:03,229 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 801 transitions. Word has length 172 [2025-02-05 20:01:03,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:03,229 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 801 transitions. [2025-02-05 20:01:03,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 0 states have call successors, (0), 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 20:01:03,229 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 801 transitions. [2025-02-05 20:01:03,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-05 20:01:03,230 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:03,231 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:03,244 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 20:01:03,435 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,SelfDestructingSolverStorable17 [2025-02-05 20:01:03,435 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:03,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:03,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1862141771, now seen corresponding path program 1 times [2025-02-05 20:01:03,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:03,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050288322] [2025-02-05 20:01:03,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:03,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:03,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-05 20:01:03,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-05 20:01:03,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:03,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:03,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:03,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:03,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050288322] [2025-02-05 20:01:03,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050288322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:01:03,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:01:03,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:01:03,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696513678] [2025-02-05 20:01:03,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:03,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:01:03,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:03,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:01:03,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:01:03,962 INFO L87 Difference]: Start difference. First operand 551 states and 801 transitions. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 0 states have call successors, (0), 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 20:01:04,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:04,217 INFO L93 Difference]: Finished difference Result 930 states and 1358 transitions. [2025-02-05 20:01:04,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:01:04,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 0 states have call successors, (0), 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 173 [2025-02-05 20:01:04,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:04,219 INFO L225 Difference]: With dead ends: 930 [2025-02-05 20:01:04,219 INFO L226 Difference]: Without dead ends: 549 [2025-02-05 20:01:04,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:01:04,223 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 948 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:04,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 1049 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:01:04,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-02-05 20:01:04,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2025-02-05 20:01:04,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.4562043795620438) internal successors, (798), 548 states have internal predecessors, (798), 0 states have call successors, (0), 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 20:01:04,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 798 transitions. [2025-02-05 20:01:04,238 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 798 transitions. Word has length 173 [2025-02-05 20:01:04,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:04,238 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 798 transitions. [2025-02-05 20:01:04,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 0 states have call successors, (0), 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 20:01:04,239 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 798 transitions. [2025-02-05 20:01:04,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-05 20:01:04,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:04,265 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:04,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 20:01:04,265 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:04,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:04,266 INFO L85 PathProgramCache]: Analyzing trace with hash -149936310, now seen corresponding path program 1 times [2025-02-05 20:01:04,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:04,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288522007] [2025-02-05 20:01:04,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:04,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:04,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-05 20:01:04,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-05 20:01:04,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:04,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:05,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:05,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:05,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288522007] [2025-02-05 20:01:05,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288522007] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:01:05,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:01:05,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:01:05,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437251454] [2025-02-05 20:01:05,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:05,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:01:05,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:05,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:01:05,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:01:05,094 INFO L87 Difference]: Start difference. First operand 549 states and 798 transitions. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 0 states have call successors, (0), 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 20:01:05,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:05,332 INFO L93 Difference]: Finished difference Result 812 states and 1188 transitions. [2025-02-05 20:01:05,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:01:05,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 0 states have call successors, (0), 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 173 [2025-02-05 20:01:05,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:05,334 INFO L225 Difference]: With dead ends: 812 [2025-02-05 20:01:05,334 INFO L226 Difference]: Without dead ends: 551 [2025-02-05 20:01:05,335 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 20:01:05,335 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 244 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:05,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 1329 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:01:05,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-02-05 20:01:05,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 550. [2025-02-05 20:01:05,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 1.4553734061930783) internal successors, (799), 549 states have internal predecessors, (799), 0 states have call successors, (0), 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 20:01:05,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 799 transitions. [2025-02-05 20:01:05,345 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 799 transitions. Word has length 173 [2025-02-05 20:01:05,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:05,345 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 799 transitions. [2025-02-05 20:01:05,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 0 states have call successors, (0), 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 20:01:05,346 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 799 transitions. [2025-02-05 20:01:05,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-05 20:01:05,346 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:05,346 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:05,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 20:01:05,346 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:05,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:05,347 INFO L85 PathProgramCache]: Analyzing trace with hash -319657368, now seen corresponding path program 1 times [2025-02-05 20:01:05,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:05,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304365805] [2025-02-05 20:01:05,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:05,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:05,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-05 20:01:05,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-05 20:01:05,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:05,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:06,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:06,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:06,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304365805] [2025-02-05 20:01:06,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304365805] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:06,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510542936] [2025-02-05 20:01:06,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:06,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:06,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:01:06,378 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 20:01:06,380 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 20:01:06,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-05 20:01:06,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-05 20:01:06,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:06,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:06,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 1097 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-05 20:01:06,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:01:07,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:07,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:01:07,991 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:07,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510542936] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:01:07,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:01:07,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 29 [2025-02-05 20:01:07,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916645391] [2025-02-05 20:01:07,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:01:07,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-05 20:01:07,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:07,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-05 20:01:07,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2025-02-05 20:01:07,995 INFO L87 Difference]: Start difference. First operand 550 states and 799 transitions. Second operand has 29 states, 29 states have (on average 17.517241379310345) internal successors, (508), 29 states have internal predecessors, (508), 0 states have call successors, (0), 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 20:01:09,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:09,471 INFO L93 Difference]: Finished difference Result 1742 states and 2544 transitions. [2025-02-05 20:01:09,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 20:01:09,472 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 17.517241379310345) internal successors, (508), 29 states have internal predecessors, (508), 0 states have call successors, (0), 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 174 [2025-02-05 20:01:09,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:09,476 INFO L225 Difference]: With dead ends: 1742 [2025-02-05 20:01:09,476 INFO L226 Difference]: Without dead ends: 1251 [2025-02-05 20:01:09,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=343, Invalid=1913, Unknown=0, NotChecked=0, Total=2256 [2025-02-05 20:01:09,482 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 8724 mSDsluCounter, 6153 mSDsCounter, 0 mSdLazyCounter, 2849 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8724 SdHoareTripleChecker+Valid, 6453 SdHoareTripleChecker+Invalid, 2856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:09,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8724 Valid, 6453 Invalid, 2856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2849 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 20:01:09,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2025-02-05 20:01:09,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1030. [2025-02-05 20:01:09,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1029 states have (on average 1.4548104956268222) internal successors, (1497), 1029 states have internal predecessors, (1497), 0 states have call successors, (0), 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 20:01:09,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1497 transitions. [2025-02-05 20:01:09,496 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1497 transitions. Word has length 174 [2025-02-05 20:01:09,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:09,496 INFO L471 AbstractCegarLoop]: Abstraction has 1030 states and 1497 transitions. [2025-02-05 20:01:09,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 17.517241379310345) internal successors, (508), 29 states have internal predecessors, (508), 0 states have call successors, (0), 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 20:01:09,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1497 transitions. [2025-02-05 20:01:09,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-05 20:01:09,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:09,497 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:09,508 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 20:01:09,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:09,702 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:09,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:09,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1958889613, now seen corresponding path program 1 times [2025-02-05 20:01:09,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:09,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336800767] [2025-02-05 20:01:09,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:09,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:09,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 20:01:09,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 20:01:09,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:09,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:09,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:09,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:09,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336800767] [2025-02-05 20:01:09,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336800767] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:01:09,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:01:09,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:01:09,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254473256] [2025-02-05 20:01:09,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:10,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:01:10,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:10,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:01:10,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:01:10,001 INFO L87 Difference]: Start difference. First operand 1030 states and 1497 transitions. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 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 20:01:10,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:10,230 INFO L93 Difference]: Finished difference Result 2036 states and 2963 transitions. [2025-02-05 20:01:10,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:01:10,233 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 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 175 [2025-02-05 20:01:10,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:10,235 INFO L225 Difference]: With dead ends: 2036 [2025-02-05 20:01:10,235 INFO L226 Difference]: Without dead ends: 1057 [2025-02-05 20:01:10,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:01:10,237 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 5 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2147 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:10,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2147 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:01:10,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2025-02-05 20:01:10,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 1057. [2025-02-05 20:01:10,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 1056 states have (on average 1.4507575757575757) internal successors, (1532), 1056 states have internal predecessors, (1532), 0 states have call successors, (0), 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 20:01:10,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1532 transitions. [2025-02-05 20:01:10,248 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1532 transitions. Word has length 175 [2025-02-05 20:01:10,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:10,248 INFO L471 AbstractCegarLoop]: Abstraction has 1057 states and 1532 transitions. [2025-02-05 20:01:10,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 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 20:01:10,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1532 transitions. [2025-02-05 20:01:10,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-05 20:01:10,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:10,250 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:10,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 20:01:10,250 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:10,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:10,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1268642926, now seen corresponding path program 1 times [2025-02-05 20:01:10,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:10,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061476559] [2025-02-05 20:01:10,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:10,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:10,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 20:01:10,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 20:01:10,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:10,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:10,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:10,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:10,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061476559] [2025-02-05 20:01:10,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061476559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:01:10,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:01:10,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:01:10,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104337656] [2025-02-05 20:01:10,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:10,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:01:10,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:10,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:01:10,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:01:10,475 INFO L87 Difference]: Start difference. First operand 1057 states and 1532 transitions. Second operand has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 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 20:01:10,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:10,674 INFO L93 Difference]: Finished difference Result 1556 states and 2257 transitions. [2025-02-05 20:01:10,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:01:10,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 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 175 [2025-02-05 20:01:10,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:10,677 INFO L225 Difference]: With dead ends: 1556 [2025-02-05 20:01:10,677 INFO L226 Difference]: Without dead ends: 1047 [2025-02-05 20:01:10,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:01:10,678 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 1033 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:10,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 1410 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:01:10,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2025-02-05 20:01:10,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1047. [2025-02-05 20:01:10,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 1046 states have (on average 1.4493307839388145) internal successors, (1516), 1046 states have internal predecessors, (1516), 0 states have call successors, (0), 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 20:01:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1516 transitions. [2025-02-05 20:01:10,687 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1516 transitions. Word has length 175 [2025-02-05 20:01:10,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:10,688 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1516 transitions. [2025-02-05 20:01:10,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 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 20:01:10,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1516 transitions. [2025-02-05 20:01:10,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-05 20:01:10,689 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:10,689 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:10,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 20:01:10,689 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:10,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:10,689 INFO L85 PathProgramCache]: Analyzing trace with hash 22793042, now seen corresponding path program 1 times [2025-02-05 20:01:10,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:10,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881958046] [2025-02-05 20:01:10,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:10,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:10,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-05 20:01:10,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-05 20:01:10,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:10,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:10,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:10,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:10,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881958046] [2025-02-05 20:01:10,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881958046] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:01:10,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:01:10,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:01:10,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906335808] [2025-02-05 20:01:10,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:10,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:01:10,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:10,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:01:10,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:01:10,914 INFO L87 Difference]: Start difference. First operand 1047 states and 1516 transitions. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 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 20:01:11,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:11,084 INFO L93 Difference]: Finished difference Result 2035 states and 2950 transitions. [2025-02-05 20:01:11,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:01:11,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 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 176 [2025-02-05 20:01:11,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:11,088 INFO L225 Difference]: With dead ends: 2035 [2025-02-05 20:01:11,088 INFO L226 Difference]: Without dead ends: 1044 [2025-02-05 20:01:11,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:01:11,089 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 1051 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1051 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:11,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1051 Valid, 1061 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:01:11,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2025-02-05 20:01:11,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 1044. [2025-02-05 20:01:11,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 1043 states have (on average 1.4477468839884948) internal successors, (1510), 1043 states have internal predecessors, (1510), 0 states have call successors, (0), 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 20:01:11,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1510 transitions. [2025-02-05 20:01:11,099 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1510 transitions. Word has length 176 [2025-02-05 20:01:11,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:11,099 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1510 transitions. [2025-02-05 20:01:11,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 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 20:01:11,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1510 transitions. [2025-02-05 20:01:11,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-05 20:01:11,100 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:11,100 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:11,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 20:01:11,100 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:11,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:11,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1945013449, now seen corresponding path program 1 times [2025-02-05 20:01:11,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:11,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401138701] [2025-02-05 20:01:11,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:11,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:11,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-05 20:01:11,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-05 20:01:11,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:11,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:11,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:11,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:11,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401138701] [2025-02-05 20:01:11,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401138701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:01:11,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:01:11,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:01:11,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299002568] [2025-02-05 20:01:11,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:11,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:01:11,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:11,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:01:11,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:01:11,297 INFO L87 Difference]: Start difference. First operand 1044 states and 1510 transitions. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 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 20:01:11,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:11,667 INFO L93 Difference]: Finished difference Result 1798 states and 2612 transitions. [2025-02-05 20:01:11,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:01:11,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 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 176 [2025-02-05 20:01:11,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:11,670 INFO L225 Difference]: With dead ends: 1798 [2025-02-05 20:01:11,670 INFO L226 Difference]: Without dead ends: 806 [2025-02-05 20:01:11,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:01:11,671 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 1077 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:11,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 1054 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:01:11,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2025-02-05 20:01:11,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2025-02-05 20:01:11,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 805 states have (on average 1.4559006211180123) internal successors, (1172), 805 states have internal predecessors, (1172), 0 states have call successors, (0), 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 20:01:11,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1172 transitions. [2025-02-05 20:01:11,682 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1172 transitions. Word has length 176 [2025-02-05 20:01:11,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:11,682 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1172 transitions. [2025-02-05 20:01:11,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 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 20:01:11,683 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1172 transitions. [2025-02-05 20:01:11,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-02-05 20:01:11,684 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:11,684 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:11,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 20:01:11,684 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:11,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:11,685 INFO L85 PathProgramCache]: Analyzing trace with hash 609629854, now seen corresponding path program 1 times [2025-02-05 20:01:11,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:11,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875658545] [2025-02-05 20:01:11,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:11,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:11,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-02-05 20:01:12,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-02-05 20:01:12,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:12,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:13,006 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:13,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:13,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875658545] [2025-02-05 20:01:13,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875658545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:01:13,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:01:13,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:01:13,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121962232] [2025-02-05 20:01:13,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:13,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:01:13,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:13,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:01:13,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:01:13,009 INFO L87 Difference]: Start difference. First operand 806 states and 1172 transitions. Second operand has 7 states, 7 states have (on average 43.42857142857143) internal successors, (304), 7 states have internal predecessors, (304), 0 states have call successors, (0), 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 20:01:13,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:13,586 INFO L93 Difference]: Finished difference Result 2692 states and 3979 transitions. [2025-02-05 20:01:13,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:01:13,587 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 43.42857142857143) internal successors, (304), 7 states have internal predecessors, (304), 0 states have call successors, (0), 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 304 [2025-02-05 20:01:13,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:13,596 INFO L225 Difference]: With dead ends: 2692 [2025-02-05 20:01:13,596 INFO L226 Difference]: Without dead ends: 2167 [2025-02-05 20:01:13,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:01:13,597 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 1362 mSDsluCounter, 2320 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1362 SdHoareTripleChecker+Valid, 3158 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:13,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1362 Valid, 3158 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:01:13,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states. [2025-02-05 20:01:13,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 1264. [2025-02-05 20:01:13,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 1263 states have (on average 1.4655581947743468) internal successors, (1851), 1263 states have internal predecessors, (1851), 0 states have call successors, (0), 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 20:01:13,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 1851 transitions. [2025-02-05 20:01:13,617 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 1851 transitions. Word has length 304 [2025-02-05 20:01:13,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:13,617 INFO L471 AbstractCegarLoop]: Abstraction has 1264 states and 1851 transitions. [2025-02-05 20:01:13,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 43.42857142857143) internal successors, (304), 7 states have internal predecessors, (304), 0 states have call successors, (0), 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 20:01:13,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1851 transitions. [2025-02-05 20:01:13,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-02-05 20:01:13,619 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:13,620 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:13,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 20:01:13,620 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:13,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:13,621 INFO L85 PathProgramCache]: Analyzing trace with hash 67092443, now seen corresponding path program 1 times [2025-02-05 20:01:13,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:13,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090784655] [2025-02-05 20:01:13,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:13,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:13,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-02-05 20:01:14,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-02-05 20:01:14,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:14,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:15,628 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:15,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:15,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090784655] [2025-02-05 20:01:15,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090784655] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:01:15,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:01:15,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 20:01:15,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261891066] [2025-02-05 20:01:15,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:15,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:01:15,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:15,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:01:15,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:01:15,630 INFO L87 Difference]: Start difference. First operand 1264 states and 1851 transitions. Second operand has 9 states, 9 states have (on average 33.888888888888886) internal successors, (305), 9 states have internal predecessors, (305), 0 states have call successors, (0), 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 20:01:16,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:16,221 INFO L93 Difference]: Finished difference Result 3189 states and 4704 transitions. [2025-02-05 20:01:16,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 20:01:16,221 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 33.888888888888886) internal successors, (305), 9 states have internal predecessors, (305), 0 states have call successors, (0), 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 305 [2025-02-05 20:01:16,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:16,226 INFO L225 Difference]: With dead ends: 3189 [2025-02-05 20:01:16,226 INFO L226 Difference]: Without dead ends: 2206 [2025-02-05 20:01:16,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-02-05 20:01:16,227 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 1290 mSDsluCounter, 3104 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 3697 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:16,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 3697 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:01:16,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2206 states. [2025-02-05 20:01:16,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2206 to 1346. [2025-02-05 20:01:16,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 1345 states have (on average 1.458736059479554) internal successors, (1962), 1345 states have internal predecessors, (1962), 0 states have call successors, (0), 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 20:01:16,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1962 transitions. [2025-02-05 20:01:16,247 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1962 transitions. Word has length 305 [2025-02-05 20:01:16,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:16,248 INFO L471 AbstractCegarLoop]: Abstraction has 1346 states and 1962 transitions. [2025-02-05 20:01:16,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.888888888888886) internal successors, (305), 9 states have internal predecessors, (305), 0 states have call successors, (0), 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 20:01:16,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1962 transitions. [2025-02-05 20:01:16,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-02-05 20:01:16,251 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:16,251 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:16,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 20:01:16,251 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:16,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:16,252 INFO L85 PathProgramCache]: Analyzing trace with hash -67606088, now seen corresponding path program 1 times [2025-02-05 20:01:16,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:16,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156882741] [2025-02-05 20:01:16,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:16,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:16,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-02-05 20:01:17,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-02-05 20:01:17,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:17,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:17,698 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 20:01:17,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:17,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156882741] [2025-02-05 20:01:17,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156882741] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:01:17,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:01:17,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:01:17,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703980959] [2025-02-05 20:01:17,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:17,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:01:17,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:17,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:01:17,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:01:17,700 INFO L87 Difference]: Start difference. First operand 1346 states and 1962 transitions. Second operand has 7 states, 7 states have (on average 43.0) internal successors, (301), 7 states have internal predecessors, (301), 0 states have call successors, (0), 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 20:01:17,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:17,951 INFO L93 Difference]: Finished difference Result 2444 states and 3578 transitions. [2025-02-05 20:01:17,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:01:17,951 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 43.0) internal successors, (301), 7 states have internal predecessors, (301), 0 states have call successors, (0), 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 306 [2025-02-05 20:01:17,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:17,954 INFO L225 Difference]: With dead ends: 2444 [2025-02-05 20:01:17,954 INFO L226 Difference]: Without dead ends: 1371 [2025-02-05 20:01:17,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:01:17,955 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 287 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:17,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 1579 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:01:17,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2025-02-05 20:01:17,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1371. [2025-02-05 20:01:17,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 1370 states have (on average 1.454014598540146) internal successors, (1992), 1370 states have internal predecessors, (1992), 0 states have call successors, (0), 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 20:01:17,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1992 transitions. [2025-02-05 20:01:17,966 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1992 transitions. Word has length 306 [2025-02-05 20:01:17,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:17,966 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 1992 transitions. [2025-02-05 20:01:17,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 43.0) internal successors, (301), 7 states have internal predecessors, (301), 0 states have call successors, (0), 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 20:01:17,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1992 transitions. [2025-02-05 20:01:17,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-02-05 20:01:17,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:17,968 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:17,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 20:01:17,969 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:17,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:17,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1411810365, now seen corresponding path program 1 times [2025-02-05 20:01:17,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:17,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418613529] [2025-02-05 20:01:17,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:17,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:18,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-02-05 20:01:19,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-02-05 20:01:19,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:19,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:19,758 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:19,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:19,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418613529] [2025-02-05 20:01:19,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418613529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:01:19,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:01:19,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:01:19,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756686011] [2025-02-05 20:01:19,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:19,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:01:19,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:19,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:01:19,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:01:19,759 INFO L87 Difference]: Start difference. First operand 1371 states and 1992 transitions. Second operand has 8 states, 8 states have (on average 38.25) internal successors, (306), 8 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:20,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:20,254 INFO L93 Difference]: Finished difference Result 3378 states and 4955 transitions. [2025-02-05 20:01:20,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:01:20,254 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 38.25) internal successors, (306), 8 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 306 [2025-02-05 20:01:20,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:20,259 INFO L225 Difference]: With dead ends: 3378 [2025-02-05 20:01:20,259 INFO L226 Difference]: Without dead ends: 2296 [2025-02-05 20:01:20,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:01:20,260 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 1297 mSDsluCounter, 2371 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1297 SdHoareTripleChecker+Valid, 2950 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:20,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1297 Valid, 2950 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:01:20,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2025-02-05 20:01:20,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 1373. [2025-02-05 20:01:20,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 1372 states have (on average 1.4518950437317784) internal successors, (1992), 1372 states have internal predecessors, (1992), 0 states have call successors, (0), 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 20:01:20,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 1992 transitions. [2025-02-05 20:01:20,271 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 1992 transitions. Word has length 306 [2025-02-05 20:01:20,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:20,271 INFO L471 AbstractCegarLoop]: Abstraction has 1373 states and 1992 transitions. [2025-02-05 20:01:20,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 38.25) internal successors, (306), 8 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:01:20,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1992 transitions. [2025-02-05 20:01:20,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-02-05 20:01:20,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:20,274 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:20,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 20:01:20,274 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:20,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:20,274 INFO L85 PathProgramCache]: Analyzing trace with hash 606489147, now seen corresponding path program 1 times [2025-02-05 20:01:20,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:20,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868582552] [2025-02-05 20:01:20,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:20,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:20,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-05 20:01:21,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-05 20:01:21,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:21,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:22,699 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 120 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:22,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:22,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868582552] [2025-02-05 20:01:22,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868582552] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:22,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715645494] [2025-02-05 20:01:22,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:22,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:22,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:01:22,704 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 20:01:22,706 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 20:01:23,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-05 20:01:23,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-05 20:01:23,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:23,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:23,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 2013 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-05 20:01:23,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:01:23,867 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 120 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:23,867 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:01:24,106 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 20:01:24,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715645494] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:24,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:01:24,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 11] total 25 [2025-02-05 20:01:24,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69930525] [2025-02-05 20:01:24,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:24,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:01:24,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:24,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:01:24,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2025-02-05 20:01:24,108 INFO L87 Difference]: Start difference. First operand 1373 states and 1992 transitions. Second operand has 8 states, 8 states have (on average 37.625) internal successors, (301), 8 states have internal predecessors, (301), 0 states have call successors, (0), 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 20:01:24,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:24,623 INFO L93 Difference]: Finished difference Result 4112 states and 6048 transitions. [2025-02-05 20:01:24,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 20:01:24,624 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 37.625) internal successors, (301), 8 states have internal predecessors, (301), 0 states have call successors, (0), 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 307 [2025-02-05 20:01:24,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:24,630 INFO L225 Difference]: With dead ends: 4112 [2025-02-05 20:01:24,630 INFO L226 Difference]: Without dead ends: 3028 [2025-02-05 20:01:24,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 604 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2025-02-05 20:01:24,632 INFO L435 NwaCegarLoop]: 781 mSDtfsCounter, 1453 mSDsluCounter, 2314 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1453 SdHoareTripleChecker+Valid, 3095 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:24,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1453 Valid, 3095 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:01:24,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3028 states. [2025-02-05 20:01:24,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3028 to 1578. [2025-02-05 20:01:24,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1577 states have (on average 1.4540266328471783) internal successors, (2293), 1577 states have internal predecessors, (2293), 0 states have call successors, (0), 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 20:01:24,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2293 transitions. [2025-02-05 20:01:24,647 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2293 transitions. Word has length 307 [2025-02-05 20:01:24,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:24,647 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 2293 transitions. [2025-02-05 20:01:24,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 37.625) internal successors, (301), 8 states have internal predecessors, (301), 0 states have call successors, (0), 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 20:01:24,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2293 transitions. [2025-02-05 20:01:24,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-02-05 20:01:24,650 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:24,650 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:24,661 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 20:01:24,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:24,854 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:24,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:24,855 INFO L85 PathProgramCache]: Analyzing trace with hash -339197843, now seen corresponding path program 1 times [2025-02-05 20:01:24,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:24,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030181190] [2025-02-05 20:01:24,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:24,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:24,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-02-05 20:01:26,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-02-05 20:01:26,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:26,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:27,118 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 20:01:27,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:27,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030181190] [2025-02-05 20:01:27,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030181190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:01:27,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:01:27,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:01:27,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592390088] [2025-02-05 20:01:27,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:27,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:01:27,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:27,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:01:27,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:01:27,119 INFO L87 Difference]: Start difference. First operand 1578 states and 2293 transitions. Second operand has 6 states, 6 states have (on average 49.333333333333336) internal successors, (296), 6 states have internal predecessors, (296), 0 states have call successors, (0), 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 20:01:27,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:27,483 INFO L93 Difference]: Finished difference Result 3651 states and 5353 transitions. [2025-02-05 20:01:27,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:01:27,484 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 49.333333333333336) internal successors, (296), 6 states have internal predecessors, (296), 0 states have call successors, (0), 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 308 [2025-02-05 20:01:27,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:27,487 INFO L225 Difference]: With dead ends: 3651 [2025-02-05 20:01:27,487 INFO L226 Difference]: Without dead ends: 2362 [2025-02-05 20:01:27,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:01:27,489 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 291 mSDsluCounter, 2111 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 2708 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:27,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 2708 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:01:27,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2025-02-05 20:01:27,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1630. [2025-02-05 20:01:27,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1629 states have (on average 1.4518109269490485) internal successors, (2365), 1629 states have internal predecessors, (2365), 0 states have call successors, (0), 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 20:01:27,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2365 transitions. [2025-02-05 20:01:27,504 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2365 transitions. Word has length 308 [2025-02-05 20:01:27,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:27,504 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2365 transitions. [2025-02-05 20:01:27,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.333333333333336) internal successors, (296), 6 states have internal predecessors, (296), 0 states have call successors, (0), 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 20:01:27,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2365 transitions. [2025-02-05 20:01:27,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-02-05 20:01:27,506 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:27,506 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:27,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 20:01:27,507 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:27,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:27,507 INFO L85 PathProgramCache]: Analyzing trace with hash 435899482, now seen corresponding path program 1 times [2025-02-05 20:01:27,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:27,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526587830] [2025-02-05 20:01:27,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:27,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:27,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-02-05 20:01:29,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-02-05 20:01:29,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:29,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:30,089 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 106 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:30,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:30,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526587830] [2025-02-05 20:01:30,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526587830] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:30,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584016801] [2025-02-05 20:01:30,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:30,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:30,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:01:30,092 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 20:01:30,093 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 20:01:30,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-02-05 20:01:30,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-02-05 20:01:30,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:30,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:30,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 2016 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-02-05 20:01:30,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:01:31,628 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 103 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:31,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:01:33,411 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 93 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:33,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584016801] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:01:33,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:01:33,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 16] total 34 [2025-02-05 20:01:33,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76146535] [2025-02-05 20:01:33,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:01:33,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-05 20:01:33,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:33,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-05 20:01:33,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=916, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 20:01:33,414 INFO L87 Difference]: Start difference. First operand 1630 states and 2365 transitions. Second operand has 34 states, 34 states have (on average 24.61764705882353) internal successors, (837), 34 states have internal predecessors, (837), 0 states have call successors, (0), 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 20:01:36,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:36,323 INFO L93 Difference]: Finished difference Result 5410 states and 7961 transitions. [2025-02-05 20:01:36,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-02-05 20:01:36,323 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 24.61764705882353) internal successors, (837), 34 states have internal predecessors, (837), 0 states have call successors, (0), 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 308 [2025-02-05 20:01:36,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:36,328 INFO L225 Difference]: With dead ends: 5410 [2025-02-05 20:01:36,328 INFO L226 Difference]: Without dead ends: 4069 [2025-02-05 20:01:36,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 594 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1627 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=981, Invalid=4871, Unknown=0, NotChecked=0, Total=5852 [2025-02-05 20:01:36,330 INFO L435 NwaCegarLoop]: 720 mSDtfsCounter, 9175 mSDsluCounter, 10564 mSDsCounter, 0 mSdLazyCounter, 4157 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9175 SdHoareTripleChecker+Valid, 11284 SdHoareTripleChecker+Invalid, 4178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:36,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9175 Valid, 11284 Invalid, 4178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4157 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 20:01:36,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4069 states. [2025-02-05 20:01:36,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4069 to 2137. [2025-02-05 20:01:36,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2137 states, 2136 states have (on average 1.4550561797752808) internal successors, (3108), 2136 states have internal predecessors, (3108), 0 states have call successors, (0), 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 20:01:36,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 3108 transitions. [2025-02-05 20:01:36,350 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 3108 transitions. Word has length 308 [2025-02-05 20:01:36,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:36,351 INFO L471 AbstractCegarLoop]: Abstraction has 2137 states and 3108 transitions. [2025-02-05 20:01:36,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 24.61764705882353) internal successors, (837), 34 states have internal predecessors, (837), 0 states have call successors, (0), 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 20:01:36,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 3108 transitions. [2025-02-05 20:01:36,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-02-05 20:01:36,353 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:36,353 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:36,365 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 20:01:36,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-02-05 20:01:36,556 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:36,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:36,557 INFO L85 PathProgramCache]: Analyzing trace with hash -975865464, now seen corresponding path program 1 times [2025-02-05 20:01:36,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:36,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114220329] [2025-02-05 20:01:36,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:36,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:36,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-02-05 20:01:37,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-02-05 20:01:37,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:37,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:38,299 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 125 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:38,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:38,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114220329] [2025-02-05 20:01:38,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114220329] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:38,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545649133] [2025-02-05 20:01:38,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:38,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:38,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:01:38,303 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 20:01:38,304 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 20:01:38,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-02-05 20:01:39,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-02-05 20:01:39,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:39,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:39,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 2016 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-05 20:01:39,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:01:39,423 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 111 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:39,424 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:01:39,919 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 111 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:39,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545649133] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:01:39,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:01:39,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 9] total 23 [2025-02-05 20:01:39,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593184862] [2025-02-05 20:01:39,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:01:39,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 20:01:39,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:39,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 20:01:39,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2025-02-05 20:01:39,924 INFO L87 Difference]: Start difference. First operand 2137 states and 3108 transitions. Second operand has 23 states, 23 states have (on average 30.695652173913043) internal successors, (706), 23 states have internal predecessors, (706), 0 states have call successors, (0), 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 20:01:41,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:41,318 INFO L93 Difference]: Finished difference Result 5273 states and 7701 transitions. [2025-02-05 20:01:41,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-05 20:01:41,319 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 30.695652173913043) internal successors, (706), 23 states have internal predecessors, (706), 0 states have call successors, (0), 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 308 [2025-02-05 20:01:41,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:41,324 INFO L225 Difference]: With dead ends: 5273 [2025-02-05 20:01:41,324 INFO L226 Difference]: Without dead ends: 3425 [2025-02-05 20:01:41,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 644 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=360, Invalid=1620, Unknown=0, NotChecked=0, Total=1980 [2025-02-05 20:01:41,326 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 7293 mSDsluCounter, 4125 mSDsCounter, 0 mSdLazyCounter, 1958 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7293 SdHoareTripleChecker+Valid, 4680 SdHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:41,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7293 Valid, 4680 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1958 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 20:01:41,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3425 states. [2025-02-05 20:01:41,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3425 to 2117. [2025-02-05 20:01:41,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2117 states, 2116 states have (on average 1.448015122873346) internal successors, (3064), 2116 states have internal predecessors, (3064), 0 states have call successors, (0), 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 20:01:41,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3064 transitions. [2025-02-05 20:01:41,343 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3064 transitions. Word has length 308 [2025-02-05 20:01:41,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:41,343 INFO L471 AbstractCegarLoop]: Abstraction has 2117 states and 3064 transitions. [2025-02-05 20:01:41,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 30.695652173913043) internal successors, (706), 23 states have internal predecessors, (706), 0 states have call successors, (0), 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 20:01:41,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3064 transitions. [2025-02-05 20:01:41,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-02-05 20:01:41,345 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:41,345 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:41,357 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 20:01:41,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-02-05 20:01:41,546 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:41,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:41,547 INFO L85 PathProgramCache]: Analyzing trace with hash 109605258, now seen corresponding path program 1 times [2025-02-05 20:01:41,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:41,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948840393] [2025-02-05 20:01:41,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:41,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:41,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-02-05 20:01:42,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-02-05 20:01:42,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:42,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:43,346 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 126 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:43,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:43,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948840393] [2025-02-05 20:01:43,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948840393] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:43,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34017003] [2025-02-05 20:01:43,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:43,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:43,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:01:43,350 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 20:01:43,351 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 20:01:43,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-02-05 20:01:44,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-02-05 20:01:44,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:44,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:44,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 2017 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-02-05 20:01:44,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:01:44,973 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 117 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:44,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:01:45,092 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 20:01:45,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34017003] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:45,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:01:45,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 17] total 26 [2025-02-05 20:01:45,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957739900] [2025-02-05 20:01:45,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:45,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:01:45,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:45,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:01:45,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2025-02-05 20:01:45,095 INFO L87 Difference]: Start difference. First operand 2117 states and 3064 transitions. Second operand has 6 states, 6 states have (on average 49.5) internal successors, (297), 6 states have internal predecessors, (297), 0 states have call successors, (0), 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 20:01:45,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:45,375 INFO L93 Difference]: Finished difference Result 4529 states and 6595 transitions. [2025-02-05 20:01:45,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:01:45,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 49.5) internal successors, (297), 6 states have internal predecessors, (297), 0 states have call successors, (0), 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 309 [2025-02-05 20:01:45,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:45,379 INFO L225 Difference]: With dead ends: 4529 [2025-02-05 20:01:45,379 INFO L226 Difference]: Without dead ends: 2701 [2025-02-05 20:01:45,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2025-02-05 20:01:45,381 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 286 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 2198 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:45,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 2198 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:01:45,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2025-02-05 20:01:45,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2073. [2025-02-05 20:01:45,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2073 states, 2072 states have (on average 1.44980694980695) internal successors, (3004), 2072 states have internal predecessors, (3004), 0 states have call successors, (0), 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 20:01:45,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2073 states to 2073 states and 3004 transitions. [2025-02-05 20:01:45,395 INFO L78 Accepts]: Start accepts. Automaton has 2073 states and 3004 transitions. Word has length 309 [2025-02-05 20:01:45,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:45,395 INFO L471 AbstractCegarLoop]: Abstraction has 2073 states and 3004 transitions. [2025-02-05 20:01:45,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.5) internal successors, (297), 6 states have internal predecessors, (297), 0 states have call successors, (0), 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 20:01:45,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2073 states and 3004 transitions. [2025-02-05 20:01:45,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-02-05 20:01:45,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:45,397 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:45,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 20:01:45,602 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,SelfDestructingSolverStorable33 [2025-02-05 20:01:45,602 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:45,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:45,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1821134523, now seen corresponding path program 1 times [2025-02-05 20:01:45,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:45,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836914458] [2025-02-05 20:01:45,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:45,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:45,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-02-05 20:01:47,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-02-05 20:01:47,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:47,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:48,515 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 134 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:48,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:48,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836914458] [2025-02-05 20:01:48,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836914458] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:48,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413398669] [2025-02-05 20:01:48,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:48,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:48,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:01:48,517 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 20:01:48,519 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 20:01:49,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-02-05 20:01:49,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-02-05 20:01:49,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:49,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:49,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 2019 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-02-05 20:01:49,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:01:50,748 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 117 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:50,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:01:51,049 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 20:01:51,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413398669] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:51,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:01:51,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 17] total 31 [2025-02-05 20:01:51,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231937308] [2025-02-05 20:01:51,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:01:51,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:01:51,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:51,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:01:51,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2025-02-05 20:01:51,050 INFO L87 Difference]: Start difference. First operand 2073 states and 3004 transitions. Second operand has 7 states, 7 states have (on average 42.42857142857143) internal successors, (297), 7 states have internal predecessors, (297), 0 states have call successors, (0), 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 20:01:51,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:51,386 INFO L93 Difference]: Finished difference Result 4633 states and 6755 transitions. [2025-02-05 20:01:51,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:01:51,387 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 42.42857142857143) internal successors, (297), 7 states have internal predecessors, (297), 0 states have call successors, (0), 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 309 [2025-02-05 20:01:51,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:51,390 INFO L225 Difference]: With dead ends: 4633 [2025-02-05 20:01:51,390 INFO L226 Difference]: Without dead ends: 2849 [2025-02-05 20:01:51,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 603 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2025-02-05 20:01:51,392 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 566 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:51,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1855 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:01:51,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2849 states. [2025-02-05 20:01:51,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2849 to 2121. [2025-02-05 20:01:51,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 2120 states have (on average 1.4452830188679244) internal successors, (3064), 2120 states have internal predecessors, (3064), 0 states have call successors, (0), 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 20:01:51,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 3064 transitions. [2025-02-05 20:01:51,406 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 3064 transitions. Word has length 309 [2025-02-05 20:01:51,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:51,406 INFO L471 AbstractCegarLoop]: Abstraction has 2121 states and 3064 transitions. [2025-02-05 20:01:51,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 42.42857142857143) internal successors, (297), 7 states have internal predecessors, (297), 0 states have call successors, (0), 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 20:01:51,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 3064 transitions. [2025-02-05 20:01:51,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-02-05 20:01:51,408 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:51,409 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:51,423 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 20:01:51,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:51,613 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:51,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:51,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1445838530, now seen corresponding path program 1 times [2025-02-05 20:01:51,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:51,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636035031] [2025-02-05 20:01:51,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:51,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:51,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-02-05 20:01:52,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-02-05 20:01:52,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:52,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:53,470 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 126 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:53,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:01:53,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636035031] [2025-02-05 20:01:53,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636035031] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:01:53,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21216488] [2025-02-05 20:01:53,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:53,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:53,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:01:53,472 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:01:53,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 20:01:54,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-02-05 20:01:54,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-02-05 20:01:54,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:54,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:01:54,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 2020 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-05 20:01:54,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:01:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 99 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:54,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:01:55,528 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 99 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:01:55,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21216488] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:01:55,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:01:55,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 11] total 26 [2025-02-05 20:01:55,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833361035] [2025-02-05 20:01:55,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:01:55,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-05 20:01:55,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:01:55,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-05 20:01:55,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2025-02-05 20:01:55,530 INFO L87 Difference]: Start difference. First operand 2121 states and 3064 transitions. Second operand has 26 states, 26 states have (on average 28.307692307692307) internal successors, (736), 26 states have internal predecessors, (736), 0 states have call successors, (0), 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 20:01:57,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:01:57,979 INFO L93 Difference]: Finished difference Result 7917 states and 11563 transitions. [2025-02-05 20:01:57,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-02-05 20:01:57,980 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 28.307692307692307) internal successors, (736), 26 states have internal predecessors, (736), 0 states have call successors, (0), 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 310 [2025-02-05 20:01:57,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:01:57,995 INFO L225 Difference]: With dead ends: 7917 [2025-02-05 20:01:57,995 INFO L226 Difference]: Without dead ends: 6085 [2025-02-05 20:01:57,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 602 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 951 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=672, Invalid=3488, Unknown=0, NotChecked=0, Total=4160 [2025-02-05 20:01:57,998 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 11625 mSDsluCounter, 5833 mSDsCounter, 0 mSdLazyCounter, 2977 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11625 SdHoareTripleChecker+Valid, 6361 SdHoareTripleChecker+Invalid, 2995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:01:57,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11625 Valid, 6361 Invalid, 2995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2977 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 20:01:58,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6085 states. [2025-02-05 20:01:58,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6085 to 2399. [2025-02-05 20:01:58,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2399 states, 2398 states have (on average 1.4370308590492076) internal successors, (3446), 2398 states have internal predecessors, (3446), 0 states have call successors, (0), 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 20:01:58,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2399 states to 2399 states and 3446 transitions. [2025-02-05 20:01:58,056 INFO L78 Accepts]: Start accepts. Automaton has 2399 states and 3446 transitions. Word has length 310 [2025-02-05 20:01:58,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:01:58,057 INFO L471 AbstractCegarLoop]: Abstraction has 2399 states and 3446 transitions. [2025-02-05 20:01:58,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 28.307692307692307) internal successors, (736), 26 states have internal predecessors, (736), 0 states have call successors, (0), 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 20:01:58,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2399 states and 3446 transitions. [2025-02-05 20:01:58,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-02-05 20:01:58,059 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:01:58,059 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:58,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-05 20:01:58,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:01:58,263 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:01:58,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:01:58,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1212711843, now seen corresponding path program 1 times [2025-02-05 20:01:58,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:01:58,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476571163] [2025-02-05 20:01:58,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:01:58,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:01:58,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-02-05 20:01:59,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-02-05 20:01:59,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:01:59,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:02:00,113 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 106 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:02:00,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:02:00,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476571163] [2025-02-05 20:02:00,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476571163] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:02:00,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116605369] [2025-02-05 20:02:00,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:02:00,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:02:00,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:02:00,116 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:02:00,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 20:02:00,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-02-05 20:02:01,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-02-05 20:02:01,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:02:01,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:02:01,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 2020 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-02-05 20:02:01,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:02:01,427 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 57 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:02:01,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:02:02,307 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 57 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:02:02,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116605369] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:02:02,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:02:02,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 26 [2025-02-05 20:02:02,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353237601] [2025-02-05 20:02:02,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:02:02,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-05 20:02:02,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:02:02,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-05 20:02:02,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2025-02-05 20:02:02,310 INFO L87 Difference]: Start difference. First operand 2399 states and 3446 transitions. Second operand has 26 states, 26 states have (on average 31.384615384615383) internal successors, (816), 26 states have internal predecessors, (816), 0 states have call successors, (0), 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 20:02:05,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:02:05,045 INFO L93 Difference]: Finished difference Result 6933 states and 10098 transitions. [2025-02-05 20:02:05,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-02-05 20:02:05,045 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 31.384615384615383) internal successors, (816), 26 states have internal predecessors, (816), 0 states have call successors, (0), 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 310 [2025-02-05 20:02:05,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:02:05,060 INFO L225 Difference]: With dead ends: 6933 [2025-02-05 20:02:05,063 INFO L226 Difference]: Without dead ends: 4885 [2025-02-05 20:02:05,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 675 GetRequests, 606 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=959, Invalid=4011, Unknown=0, NotChecked=0, Total=4970 [2025-02-05 20:02:05,072 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 7209 mSDsluCounter, 9412 mSDsCounter, 0 mSdLazyCounter, 3611 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7209 SdHoareTripleChecker+Valid, 9979 SdHoareTripleChecker+Invalid, 3623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:02:05,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7209 Valid, 9979 Invalid, 3623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3611 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 20:02:05,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4885 states. [2025-02-05 20:02:05,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4885 to 2843. [2025-02-05 20:02:05,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2843 states, 2842 states have (on average 1.441942294159043) internal successors, (4098), 2842 states have internal predecessors, (4098), 0 states have call successors, (0), 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 20:02:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2843 states to 2843 states and 4098 transitions. [2025-02-05 20:02:05,130 INFO L78 Accepts]: Start accepts. Automaton has 2843 states and 4098 transitions. Word has length 310 [2025-02-05 20:02:05,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:02:05,131 INFO L471 AbstractCegarLoop]: Abstraction has 2843 states and 4098 transitions. [2025-02-05 20:02:05,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 31.384615384615383) internal successors, (816), 26 states have internal predecessors, (816), 0 states have call successors, (0), 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 20:02:05,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2843 states and 4098 transitions. [2025-02-05 20:02:05,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-02-05 20:02:05,133 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:02:05,133 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:02:05,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-05 20:02:05,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:02:05,337 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:02:05,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:02:05,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1292818913, now seen corresponding path program 1 times [2025-02-05 20:02:05,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:02:05,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494175599] [2025-02-05 20:02:05,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:02:05,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:02:05,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-02-05 20:02:06,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-02-05 20:02:06,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:02:06,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:02:08,821 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 123 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:02:08,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:02:08,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494175599] [2025-02-05 20:02:08,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494175599] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:02:08,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236620746] [2025-02-05 20:02:08,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:02:08,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:02:08,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:02:08,825 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:02:08,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 20:02:09,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-02-05 20:02:09,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-02-05 20:02:09,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:02:09,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:02:09,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 2025 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-05 20:02:09,806 INFO L279 TraceCheckSpWp]: Computing forward predicates...