./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d8_e0.c --full-output --architecture 64bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version 48c9605d
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d8_e0.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 cc215c1310f8b4d8a3ef1501261e91ba08e9c5718658396972a4e0020f5cf43f
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-48c9605-m
[2025-02-07 22:55:18,417 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-07 22:55:18,455 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf
[2025-02-07 22:55:18,458 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-07 22:55:18,459 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-07 22:55:18,482 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-07 22:55:18,482 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-07 22:55:18,482 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-07 22:55:18,483 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-07 22:55:18,483 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-07 22:55:18,483 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-07 22:55:18,483 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-07 22:55:18,483 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-07 22:55:18,483 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-07 22:55:18,483 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-07 22:55:18,483 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-07 22:55:18,483 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-07 22:55:18,483 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-07 22:55:18,483 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-07 22:55:18,483 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-07 22:55:18,483 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-07 22:55:18,484 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-07 22:55:18,484 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-07 22:55:18,484 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-07 22:55:18,484 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-07 22:55:18,484 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-07 22:55:18,484 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-07 22:55:18,485 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-07 22:55:18,485 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-07 22:55:18,485 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-07 22:55:18,485 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-07 22:55:18,485 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-07 22:55:18,485 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-07 22:55:18,485 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-07 22:55:18,485 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-07 22:55:18,485 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-07 22:55:18,485 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-07 22:55:18,485 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-07 22:55:18,485 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-07 22:55:18,486 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-07 22:55:18,486 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 -> cc215c1310f8b4d8a3ef1501261e91ba08e9c5718658396972a4e0020f5cf43f
[2025-02-07 22:55:18,677 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-07 22:55:18,682 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-07 22:55:18,683 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-07 22:55:18,685 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-07 22:55:18,685 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-07 22:55:18,686 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.circular_pointer_top_w128_d8_e0.c
[2025-02-07 22:55:19,914 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1131366ca/24a1ed55a2ad42e4aabd63dd2b3b4fe4/FLAG7eee5f7cc
[2025-02-07 22:55:20,270 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-07 22:55:20,273 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d8_e0.c
[2025-02-07 22:55:20,287 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1131366ca/24a1ed55a2ad42e4aabd63dd2b3b4fe4/FLAG7eee5f7cc
[2025-02-07 22:55:20,316 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1131366ca/24a1ed55a2ad42e4aabd63dd2b3b4fe4
[2025-02-07 22:55:20,318 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-07 22:55:20,319 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-07 22:55:20,323 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-07 22:55:20,323 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-07 22:55:20,326 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-07 22:55:20,332 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:55:20" (1/1) ...
[2025-02-07 22:55:20,333 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3f5dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:55:20, skipping insertion in model container
[2025-02-07 22:55:20,333 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:55:20" (1/1) ...
[2025-02-07 22:55:20,376 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-07 22:55:20,542 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.circular_pointer_top_w128_d8_e0.c[1334,1347]
[2025-02-07 22:55:20,655 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-07 22:55:20,661 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-07 22:55:20,668 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.circular_pointer_top_w128_d8_e0.c[1334,1347]
[2025-02-07 22:55:20,745 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-07 22:55:20,762 INFO  L204         MainTranslator]: Completed translation
[2025-02-07 22:55:20,762 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:55:20 WrapperNode
[2025-02-07 22:55:20,762 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-07 22:55:20,763 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-07 22:55:20,763 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-07 22:55:20,763 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-07 22:55:20,771 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:55:20" (1/1) ...
[2025-02-07 22:55:20,790 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:55:20" (1/1) ...
[2025-02-07 22:55:20,887 INFO  L138                Inliner]: procedures = 18, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1382
[2025-02-07 22:55:20,887 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-07 22:55:20,888 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-07 22:55:20,888 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-07 22:55:20,888 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-07 22:55:20,894 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:55:20" (1/1) ...
[2025-02-07 22:55:20,894 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:55:20" (1/1) ...
[2025-02-07 22:55:20,914 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:55:20" (1/1) ...
[2025-02-07 22:55:20,959 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-07 22:55:20,962 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:55:20" (1/1) ...
[2025-02-07 22:55:20,962 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:55:20" (1/1) ...
[2025-02-07 22:55:20,998 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:55:20" (1/1) ...
[2025-02-07 22:55:21,012 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:55:20" (1/1) ...
[2025-02-07 22:55:21,024 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:55:20" (1/1) ...
[2025-02-07 22:55:21,034 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:55:20" (1/1) ...
[2025-02-07 22:55:21,060 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-07 22:55:21,092 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-07 22:55:21,092 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-07 22:55:21,092 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-07 22:55:21,093 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:55:20" (1/1) ...
[2025-02-07 22:55:21,097 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-07 22:55:21,113 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-07 22:55:21,125 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-07 22:55:21,132 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-07 22:55:21,148 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-07 22:55:21,148 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-02-07 22:55:21,149 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-02-07 22:55:21,149 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-07 22:55:21,149 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-07 22:55:21,149 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-07 22:55:21,303 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-07 22:55:21,304 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-07 22:55:22,440 INFO  L?                        ?]: Removed 752 outVars from TransFormulas that were not future-live.
[2025-02-07 22:55:22,440 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-07 22:55:22,515 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-07 22:55:22,515 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-07 22:55:22,516 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:55:22 BoogieIcfgContainer
[2025-02-07 22:55:22,516 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-07 22:55:22,520 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-07 22:55:22,520 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-07 22:55:22,523 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-07 22:55:22,523 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:55:20" (1/3) ...
[2025-02-07 22:55:22,524 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@779259a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:55:22, skipping insertion in model container
[2025-02-07 22:55:22,524 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:55:20" (2/3) ...
[2025-02-07 22:55:22,524 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@779259a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:55:22, skipping insertion in model container
[2025-02-07 22:55:22,524 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:55:22" (3/3) ...
[2025-02-07 22:55:22,525 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w128_d8_e0.c
[2025-02-07 22:55:22,537 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-07 22:55:22,539 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.circular_pointer_top_w128_d8_e0.c that has 2 procedures, 390 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-07 22:55:22,591 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-07 22:55:22,601 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;@22182af3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-07 22:55:22,601 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-07 22:55:22,606 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 390 states, 384 states have (on average 1.4947916666666667) internal successors, (574), 385 states have internal predecessors, (574), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-02-07 22:55:22,615 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 117
[2025-02-07 22:55:22,615 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:22,616 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:22,617 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:22,620 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:22,621 INFO  L85        PathProgramCache]: Analyzing trace with hash 329665021, now seen corresponding path program 1 times
[2025-02-07 22:55:22,626 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:22,627 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575183185]
[2025-02-07 22:55:22,628 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:22,628 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:22,722 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes.
[2025-02-07 22:55:22,759 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements.
[2025-02-07 22:55:22,760 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:22,760 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:22,961 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-02-07 22:55:22,962 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:22,962 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575183185]
[2025-02-07 22:55:22,963 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575183185] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-07 22:55:22,964 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210130346]
[2025-02-07 22:55:22,964 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:22,964 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-07 22:55:22,964 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-07 22:55:22,971 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-07 22:55:22,972 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-02-07 22:55:23,205 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes.
[2025-02-07 22:55:23,330 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements.
[2025-02-07 22:55:23,330 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:23,330 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:23,338 INFO  L256         TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-02-07 22:55:23,347 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-07 22:55:23,371 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-02-07 22:55:23,375 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-07 22:55:23,376 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210130346] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:23,376 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-07 22:55:23,376 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-02-07 22:55:23,377 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212003256]
[2025-02-07 22:55:23,378 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:23,384 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-02-07 22:55:23,384 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:23,407 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-02-07 22:55:23,411 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-07 22:55:23,413 INFO  L87              Difference]: Start difference. First operand  has 390 states, 384 states have (on average 1.4947916666666667) internal successors, (574), 385 states have internal predecessors, (574), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand  has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-02-07 22:55:23,568 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:23,569 INFO  L93              Difference]: Finished difference Result 709 states and 1059 transitions.
[2025-02-07 22:55:23,569 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-02-07 22:55:23,570 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 116
[2025-02-07 22:55:23,571 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:23,576 INFO  L225             Difference]: With dead ends: 709
[2025-02-07 22:55:23,576 INFO  L226             Difference]: Without dead ends: 388
[2025-02-07 22:55:23,578 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-07 22:55:23,580 INFO  L435           NwaCegarLoop]: 483 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:23,580 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 483 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-07 22:55:23,591 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 388 states.
[2025-02-07 22:55:23,612 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388.
[2025-02-07 22:55:23,616 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 388 states, 383 states have (on average 1.4882506527415145) internal successors, (570), 383 states have internal predecessors, (570), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-02-07 22:55:23,620 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 576 transitions.
[2025-02-07 22:55:23,621 INFO  L78                 Accepts]: Start accepts. Automaton has 388 states and 576 transitions. Word has length 116
[2025-02-07 22:55:23,621 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:23,621 INFO  L471      AbstractCegarLoop]: Abstraction has 388 states and 576 transitions.
[2025-02-07 22:55:23,621 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-02-07 22:55:23,622 INFO  L276                IsEmpty]: Start isEmpty. Operand 388 states and 576 transitions.
[2025-02-07 22:55:23,623 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 117
[2025-02-07 22:55:23,623 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:23,623 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:23,631 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-02-07 22:55:23,824 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-02-07 22:55:23,824 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:23,825 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:23,825 INFO  L85        PathProgramCache]: Analyzing trace with hash -598367334, now seen corresponding path program 1 times
[2025-02-07 22:55:23,825 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:23,825 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864203322]
[2025-02-07 22:55:23,825 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:23,825 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:23,859 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes.
[2025-02-07 22:55:24,011 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements.
[2025-02-07 22:55:24,015 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:24,015 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:24,530 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:24,530 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:24,530 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864203322]
[2025-02-07 22:55:24,530 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864203322] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:24,530 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:24,530 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 22:55:24,530 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645868924]
[2025-02-07 22:55:24,531 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:24,531 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:55:24,531 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:24,532 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:55:24,532 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:55:24,532 INFO  L87              Difference]: Start difference. First operand 388 states and 576 transitions. Second operand  has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:24,692 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:24,692 INFO  L93              Difference]: Finished difference Result 392 states and 580 transitions.
[2025-02-07 22:55:24,693 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:24,693 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 116
[2025-02-07 22:55:24,693 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:24,695 INFO  L225             Difference]: With dead ends: 392
[2025-02-07 22:55:24,695 INFO  L226             Difference]: Without dead ends: 390
[2025-02-07 22:55:24,695 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-07 22:55:24,696 INFO  L435           NwaCegarLoop]: 481 mSDtfsCounter, 0 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:24,696 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1438 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-07 22:55:24,697 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 390 states.
[2025-02-07 22:55:24,711 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390.
[2025-02-07 22:55:24,715 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 390 states, 385 states have (on average 1.4857142857142858) internal successors, (572), 385 states have internal predecessors, (572), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-02-07 22:55:24,716 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 578 transitions.
[2025-02-07 22:55:24,716 INFO  L78                 Accepts]: Start accepts. Automaton has 390 states and 578 transitions. Word has length 116
[2025-02-07 22:55:24,717 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:24,718 INFO  L471      AbstractCegarLoop]: Abstraction has 390 states and 578 transitions.
[2025-02-07 22:55:24,718 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:24,718 INFO  L276                IsEmpty]: Start isEmpty. Operand 390 states and 578 transitions.
[2025-02-07 22:55:24,719 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 118
[2025-02-07 22:55:24,722 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:24,723 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:24,723 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-07 22:55:24,723 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:24,724 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:24,724 INFO  L85        PathProgramCache]: Analyzing trace with hash -1364838705, now seen corresponding path program 1 times
[2025-02-07 22:55:24,724 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:24,724 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227781041]
[2025-02-07 22:55:24,724 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:24,724 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:24,760 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes.
[2025-02-07 22:55:24,821 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements.
[2025-02-07 22:55:24,821 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:24,825 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:25,091 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:25,091 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:25,092 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227781041]
[2025-02-07 22:55:25,092 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227781041] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:25,092 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:25,092 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:25,092 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331235341]
[2025-02-07 22:55:25,092 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:25,092 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:25,092 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:25,093 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:25,093 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:25,093 INFO  L87              Difference]: Start difference. First operand 390 states and 578 transitions. Second operand  has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:25,558 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:25,558 INFO  L93              Difference]: Finished difference Result 970 states and 1440 transitions.
[2025-02-07 22:55:25,559 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-07 22:55:25,559 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 117
[2025-02-07 22:55:25,559 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:25,561 INFO  L225             Difference]: With dead ends: 970
[2025-02-07 22:55:25,561 INFO  L226             Difference]: Without dead ends: 390
[2025-02-07 22:55:25,562 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2025-02-07 22:55:25,563 INFO  L435           NwaCegarLoop]: 524 mSDtfsCounter, 1090 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:25,563 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 1412 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-07 22:55:25,564 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 390 states.
[2025-02-07 22:55:25,572 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390.
[2025-02-07 22:55:25,572 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 390 states, 385 states have (on average 1.483116883116883) internal successors, (571), 385 states have internal predecessors, (571), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-02-07 22:55:25,574 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 577 transitions.
[2025-02-07 22:55:25,574 INFO  L78                 Accepts]: Start accepts. Automaton has 390 states and 577 transitions. Word has length 117
[2025-02-07 22:55:25,574 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:25,574 INFO  L471      AbstractCegarLoop]: Abstraction has 390 states and 577 transitions.
[2025-02-07 22:55:25,574 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:25,574 INFO  L276                IsEmpty]: Start isEmpty. Operand 390 states and 577 transitions.
[2025-02-07 22:55:25,575 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2025-02-07 22:55:25,575 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:25,575 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:25,575 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-07 22:55:25,575 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:25,576 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:25,576 INFO  L85        PathProgramCache]: Analyzing trace with hash 1499737672, now seen corresponding path program 1 times
[2025-02-07 22:55:25,576 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:25,576 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714896394]
[2025-02-07 22:55:25,576 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:25,576 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:25,603 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes.
[2025-02-07 22:55:25,636 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements.
[2025-02-07 22:55:25,636 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:25,636 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:25,819 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:25,819 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:25,819 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714896394]
[2025-02-07 22:55:25,819 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714896394] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:25,819 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:25,819 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 22:55:25,819 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405690939]
[2025-02-07 22:55:25,820 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:25,820 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:55:25,820 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:25,820 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:55:25,820 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:55:25,821 INFO  L87              Difference]: Start difference. First operand 390 states and 577 transitions. Second operand  has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:25,982 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:25,982 INFO  L93              Difference]: Finished difference Result 713 states and 1054 transitions.
[2025-02-07 22:55:25,982 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:25,983 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 118
[2025-02-07 22:55:25,984 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:25,986 INFO  L225             Difference]: With dead ends: 713
[2025-02-07 22:55:25,987 INFO  L226             Difference]: Without dead ends: 392
[2025-02-07 22:55:25,988 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-07 22:55:25,988 INFO  L435           NwaCegarLoop]: 480 mSDtfsCounter, 0 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1432 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:25,988 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1432 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-07 22:55:25,989 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 392 states.
[2025-02-07 22:55:25,994 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392.
[2025-02-07 22:55:25,995 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 392 states, 387 states have (on average 1.4806201550387597) internal successors, (573), 387 states have internal predecessors, (573), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-02-07 22:55:25,996 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 579 transitions.
[2025-02-07 22:55:25,996 INFO  L78                 Accepts]: Start accepts. Automaton has 392 states and 579 transitions. Word has length 118
[2025-02-07 22:55:25,996 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:25,996 INFO  L471      AbstractCegarLoop]: Abstraction has 392 states and 579 transitions.
[2025-02-07 22:55:25,996 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:25,997 INFO  L276                IsEmpty]: Start isEmpty. Operand 392 states and 579 transitions.
[2025-02-07 22:55:25,997 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2025-02-07 22:55:25,997 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:25,997 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:25,998 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-07 22:55:25,998 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:25,998 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:25,998 INFO  L85        PathProgramCache]: Analyzing trace with hash 1178737116, now seen corresponding path program 1 times
[2025-02-07 22:55:25,998 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:25,998 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780106626]
[2025-02-07 22:55:25,998 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:25,998 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:26,022 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes.
[2025-02-07 22:55:26,058 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements.
[2025-02-07 22:55:26,058 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:26,058 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:26,331 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:26,332 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:26,332 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780106626]
[2025-02-07 22:55:26,332 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780106626] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:26,332 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:26,332 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 22:55:26,332 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221512915]
[2025-02-07 22:55:26,332 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:26,333 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:55:26,333 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:26,333 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:55:26,333 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:55:26,334 INFO  L87              Difference]: Start difference. First operand 392 states and 579 transitions. Second operand  has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:26,490 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:26,491 INFO  L93              Difference]: Finished difference Result 715 states and 1055 transitions.
[2025-02-07 22:55:26,491 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:26,491 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 119
[2025-02-07 22:55:26,491 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:26,493 INFO  L225             Difference]: With dead ends: 715
[2025-02-07 22:55:26,493 INFO  L226             Difference]: Without dead ends: 392
[2025-02-07 22:55:26,493 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:26,494 INFO  L435           NwaCegarLoop]: 464 mSDtfsCounter, 487 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:26,494 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 929 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-07 22:55:26,494 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 392 states.
[2025-02-07 22:55:26,503 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392.
[2025-02-07 22:55:26,504 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 392 states, 387 states have (on average 1.475452196382429) internal successors, (571), 387 states have internal predecessors, (571), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-02-07 22:55:26,505 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 577 transitions.
[2025-02-07 22:55:26,506 INFO  L78                 Accepts]: Start accepts. Automaton has 392 states and 577 transitions. Word has length 119
[2025-02-07 22:55:26,506 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:26,506 INFO  L471      AbstractCegarLoop]: Abstraction has 392 states and 577 transitions.
[2025-02-07 22:55:26,507 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:26,507 INFO  L276                IsEmpty]: Start isEmpty. Operand 392 states and 577 transitions.
[2025-02-07 22:55:26,508 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 122
[2025-02-07 22:55:26,509 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:26,509 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:26,509 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-07 22:55:26,510 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:26,510 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:26,510 INFO  L85        PathProgramCache]: Analyzing trace with hash 1555667804, now seen corresponding path program 1 times
[2025-02-07 22:55:26,510 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:26,511 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125970426]
[2025-02-07 22:55:26,511 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:26,511 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:26,544 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes.
[2025-02-07 22:55:26,578 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements.
[2025-02-07 22:55:26,578 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:26,578 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:26,765 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:26,765 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:26,766 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125970426]
[2025-02-07 22:55:26,766 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125970426] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:26,766 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:26,766 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:26,766 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273197603]
[2025-02-07 22:55:26,766 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:26,766 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:26,766 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:26,766 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:26,766 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:26,767 INFO  L87              Difference]: Start difference. First operand 392 states and 577 transitions. Second operand  has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:26,928 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:26,928 INFO  L93              Difference]: Finished difference Result 715 states and 1051 transitions.
[2025-02-07 22:55:26,928 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:26,928 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 121
[2025-02-07 22:55:26,929 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:26,930 INFO  L225             Difference]: With dead ends: 715
[2025-02-07 22:55:26,930 INFO  L226             Difference]: Without dead ends: 392
[2025-02-07 22:55:26,931 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:55:26,931 INFO  L435           NwaCegarLoop]: 464 mSDtfsCounter, 1041 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:26,931 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 929 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-07 22:55:26,932 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 392 states.
[2025-02-07 22:55:26,937 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392.
[2025-02-07 22:55:26,937 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 392 states, 387 states have (on average 1.4728682170542635) internal successors, (570), 387 states have internal predecessors, (570), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-02-07 22:55:26,938 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 576 transitions.
[2025-02-07 22:55:26,939 INFO  L78                 Accepts]: Start accepts. Automaton has 392 states and 576 transitions. Word has length 121
[2025-02-07 22:55:26,939 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:26,939 INFO  L471      AbstractCegarLoop]: Abstraction has 392 states and 576 transitions.
[2025-02-07 22:55:26,939 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:26,939 INFO  L276                IsEmpty]: Start isEmpty. Operand 392 states and 576 transitions.
[2025-02-07 22:55:26,940 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2025-02-07 22:55:26,940 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:26,940 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:26,940 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-07 22:55:26,940 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:26,941 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:26,941 INFO  L85        PathProgramCache]: Analyzing trace with hash -155086837, now seen corresponding path program 1 times
[2025-02-07 22:55:26,941 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:26,941 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433357170]
[2025-02-07 22:55:26,941 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:26,941 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:26,967 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-02-07 22:55:26,997 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-02-07 22:55:26,997 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:26,997 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:27,245 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:27,245 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:27,245 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433357170]
[2025-02-07 22:55:27,245 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433357170] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:27,246 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:27,246 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 22:55:27,246 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909069177]
[2025-02-07 22:55:27,246 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:27,246 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:55:27,246 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:27,246 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:55:27,246 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:55:27,247 INFO  L87              Difference]: Start difference. First operand 392 states and 576 transitions. Second operand  has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:27,435 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:27,435 INFO  L93              Difference]: Finished difference Result 715 states and 1049 transitions.
[2025-02-07 22:55:27,436 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:27,436 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 122
[2025-02-07 22:55:27,436 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:27,437 INFO  L225             Difference]: With dead ends: 715
[2025-02-07 22:55:27,437 INFO  L226             Difference]: Without dead ends: 392
[2025-02-07 22:55:27,438 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:27,438 INFO  L435           NwaCegarLoop]: 445 mSDtfsCounter, 474 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 891 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-07 22:55:27,439 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 891 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:27,439 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 392 states.
[2025-02-07 22:55:27,444 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392.
[2025-02-07 22:55:27,445 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 392 states, 387 states have (on average 1.4702842377260983) internal successors, (569), 387 states have internal predecessors, (569), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-02-07 22:55:27,446 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 575 transitions.
[2025-02-07 22:55:27,446 INFO  L78                 Accepts]: Start accepts. Automaton has 392 states and 575 transitions. Word has length 122
[2025-02-07 22:55:27,446 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:27,446 INFO  L471      AbstractCegarLoop]: Abstraction has 392 states and 575 transitions.
[2025-02-07 22:55:27,446 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:27,446 INFO  L276                IsEmpty]: Start isEmpty. Operand 392 states and 575 transitions.
[2025-02-07 22:55:27,447 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 124
[2025-02-07 22:55:27,447 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:27,447 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:27,447 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-07 22:55:27,447 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:27,448 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:27,448 INFO  L85        PathProgramCache]: Analyzing trace with hash -455804531, now seen corresponding path program 1 times
[2025-02-07 22:55:27,448 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:27,448 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364341965]
[2025-02-07 22:55:27,448 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:27,448 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:27,490 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes.
[2025-02-07 22:55:27,514 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements.
[2025-02-07 22:55:27,514 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:27,514 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:27,659 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:27,659 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:27,659 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364341965]
[2025-02-07 22:55:27,659 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364341965] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:27,659 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:27,659 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:27,659 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46585075]
[2025-02-07 22:55:27,659 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:27,659 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:27,659 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:27,660 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:27,660 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:27,660 INFO  L87              Difference]: Start difference. First operand 392 states and 575 transitions. Second operand  has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:27,900 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:27,901 INFO  L93              Difference]: Finished difference Result 719 states and 1052 transitions.
[2025-02-07 22:55:27,901 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-07 22:55:27,901 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 123
[2025-02-07 22:55:27,902 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:27,903 INFO  L225             Difference]: With dead ends: 719
[2025-02-07 22:55:27,903 INFO  L226             Difference]: Without dead ends: 392
[2025-02-07 22:55:27,903 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-07 22:55:27,904 INFO  L435           NwaCegarLoop]: 471 mSDtfsCounter, 481 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:27,904 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 1390 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:27,910 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 392 states.
[2025-02-07 22:55:27,920 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392.
[2025-02-07 22:55:27,921 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 392 states, 387 states have (on average 1.4677002583979328) internal successors, (568), 387 states have internal predecessors, (568), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-02-07 22:55:27,927 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 574 transitions.
[2025-02-07 22:55:27,927 INFO  L78                 Accepts]: Start accepts. Automaton has 392 states and 574 transitions. Word has length 123
[2025-02-07 22:55:27,928 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:27,928 INFO  L471      AbstractCegarLoop]: Abstraction has 392 states and 574 transitions.
[2025-02-07 22:55:27,928 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:27,928 INFO  L276                IsEmpty]: Start isEmpty. Operand 392 states and 574 transitions.
[2025-02-07 22:55:27,928 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 125
[2025-02-07 22:55:27,928 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:27,929 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:27,929 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-07 22:55:27,929 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:27,929 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:27,929 INFO  L85        PathProgramCache]: Analyzing trace with hash 576371841, now seen corresponding path program 1 times
[2025-02-07 22:55:27,929 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:27,929 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872176799]
[2025-02-07 22:55:27,929 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:27,929 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:27,969 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes.
[2025-02-07 22:55:28,002 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements.
[2025-02-07 22:55:28,002 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:28,002 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:28,209 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:28,209 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:28,209 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872176799]
[2025-02-07 22:55:28,209 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872176799] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:28,209 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:28,209 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:28,210 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836434409]
[2025-02-07 22:55:28,210 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:28,210 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:28,210 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:28,211 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:28,211 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:28,211 INFO  L87              Difference]: Start difference. First operand 392 states and 574 transitions. Second operand  has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:28,415 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:28,415 INFO  L93              Difference]: Finished difference Result 715 states and 1045 transitions.
[2025-02-07 22:55:28,415 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:28,415 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 124
[2025-02-07 22:55:28,416 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:28,417 INFO  L225             Difference]: With dead ends: 715
[2025-02-07 22:55:28,418 INFO  L226             Difference]: Without dead ends: 392
[2025-02-07 22:55:28,418 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:55:28,419 INFO  L435           NwaCegarLoop]: 445 mSDtfsCounter, 1030 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:28,419 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 891 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:28,420 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 392 states.
[2025-02-07 22:55:28,426 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392.
[2025-02-07 22:55:28,427 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 392 states, 387 states have (on average 1.4651162790697674) internal successors, (567), 387 states have internal predecessors, (567), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-02-07 22:55:28,429 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 573 transitions.
[2025-02-07 22:55:28,429 INFO  L78                 Accepts]: Start accepts. Automaton has 392 states and 573 transitions. Word has length 124
[2025-02-07 22:55:28,429 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:28,429 INFO  L471      AbstractCegarLoop]: Abstraction has 392 states and 573 transitions.
[2025-02-07 22:55:28,429 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:28,429 INFO  L276                IsEmpty]: Start isEmpty. Operand 392 states and 573 transitions.
[2025-02-07 22:55:28,430 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 126
[2025-02-07 22:55:28,432 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:28,432 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:28,433 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-07 22:55:28,433 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:28,433 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:28,433 INFO  L85        PathProgramCache]: Analyzing trace with hash -1043901614, now seen corresponding path program 1 times
[2025-02-07 22:55:28,433 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:28,433 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212792485]
[2025-02-07 22:55:28,433 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:28,433 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:28,461 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes.
[2025-02-07 22:55:28,486 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements.
[2025-02-07 22:55:28,486 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:28,486 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:28,643 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:28,643 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:28,643 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212792485]
[2025-02-07 22:55:28,643 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212792485] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:28,643 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:28,643 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:28,643 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729307842]
[2025-02-07 22:55:28,643 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:28,643 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:28,643 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:28,644 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:28,644 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:28,644 INFO  L87              Difference]: Start difference. First operand 392 states and 573 transitions. Second operand  has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:28,839 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:28,839 INFO  L93              Difference]: Finished difference Result 715 states and 1043 transitions.
[2025-02-07 22:55:28,839 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:28,839 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 125
[2025-02-07 22:55:28,840 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:28,841 INFO  L225             Difference]: With dead ends: 715
[2025-02-07 22:55:28,841 INFO  L226             Difference]: Without dead ends: 392
[2025-02-07 22:55:28,841 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:55:28,842 INFO  L435           NwaCegarLoop]: 445 mSDtfsCounter, 552 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:28,842 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 897 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:28,843 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 392 states.
[2025-02-07 22:55:28,848 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392.
[2025-02-07 22:55:28,848 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 392 states, 387 states have (on average 1.4625322997416021) internal successors, (566), 387 states have internal predecessors, (566), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-02-07 22:55:28,849 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 572 transitions.
[2025-02-07 22:55:28,850 INFO  L78                 Accepts]: Start accepts. Automaton has 392 states and 572 transitions. Word has length 125
[2025-02-07 22:55:28,850 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:28,850 INFO  L471      AbstractCegarLoop]: Abstraction has 392 states and 572 transitions.
[2025-02-07 22:55:28,852 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:28,852 INFO  L276                IsEmpty]: Start isEmpty. Operand 392 states and 572 transitions.
[2025-02-07 22:55:28,853 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 127
[2025-02-07 22:55:28,853 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:28,853 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:28,853 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-07 22:55:28,853 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:28,853 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:28,854 INFO  L85        PathProgramCache]: Analyzing trace with hash -1407914815, now seen corresponding path program 1 times
[2025-02-07 22:55:28,854 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:28,854 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532604610]
[2025-02-07 22:55:28,854 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:28,854 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:28,880 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes.
[2025-02-07 22:55:28,919 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements.
[2025-02-07 22:55:28,919 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:28,919 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:29,187 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:29,188 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:29,188 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532604610]
[2025-02-07 22:55:29,188 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532604610] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:29,188 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:29,188 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 22:55:29,188 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164216776]
[2025-02-07 22:55:29,188 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:29,189 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:55:29,189 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:29,189 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:55:29,189 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:55:29,189 INFO  L87              Difference]: Start difference. First operand 392 states and 572 transitions. Second operand  has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2025-02-07 22:55:29,369 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:29,369 INFO  L93              Difference]: Finished difference Result 715 states and 1041 transitions.
[2025-02-07 22:55:29,370 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:29,370 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 126
[2025-02-07 22:55:29,370 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:29,371 INFO  L225             Difference]: With dead ends: 715
[2025-02-07 22:55:29,371 INFO  L226             Difference]: Without dead ends: 392
[2025-02-07 22:55:29,372 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:29,372 INFO  L435           NwaCegarLoop]: 462 mSDtfsCounter, 518 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:29,372 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 925 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:29,373 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 392 states.
[2025-02-07 22:55:29,379 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392.
[2025-02-07 22:55:29,380 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 392 states, 387 states have (on average 1.4599483204134367) internal successors, (565), 387 states have internal predecessors, (565), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-02-07 22:55:29,381 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 571 transitions.
[2025-02-07 22:55:29,381 INFO  L78                 Accepts]: Start accepts. Automaton has 392 states and 571 transitions. Word has length 126
[2025-02-07 22:55:29,382 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:29,382 INFO  L471      AbstractCegarLoop]: Abstraction has 392 states and 571 transitions.
[2025-02-07 22:55:29,382 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2025-02-07 22:55:29,382 INFO  L276                IsEmpty]: Start isEmpty. Operand 392 states and 571 transitions.
[2025-02-07 22:55:29,383 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 128
[2025-02-07 22:55:29,383 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:29,383 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:29,383 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-07 22:55:29,383 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:29,384 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:29,384 INFO  L85        PathProgramCache]: Analyzing trace with hash -496071274, now seen corresponding path program 1 times
[2025-02-07 22:55:29,384 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:29,384 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940956865]
[2025-02-07 22:55:29,384 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:29,384 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:29,433 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes.
[2025-02-07 22:55:29,491 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements.
[2025-02-07 22:55:29,493 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:29,493 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:29,669 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:29,671 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:29,671 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940956865]
[2025-02-07 22:55:29,672 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940956865] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:29,672 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:29,672 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 22:55:29,672 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925607376]
[2025-02-07 22:55:29,672 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:29,672 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:55:29,672 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:29,673 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:55:29,673 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:55:29,673 INFO  L87              Difference]: Start difference. First operand 392 states and 571 transitions. Second operand  has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2025-02-07 22:55:29,869 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:29,870 INFO  L93              Difference]: Finished difference Result 715 states and 1039 transitions.
[2025-02-07 22:55:29,870 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:29,870 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 127
[2025-02-07 22:55:29,870 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:29,871 INFO  L225             Difference]: With dead ends: 715
[2025-02-07 22:55:29,871 INFO  L226             Difference]: Without dead ends: 392
[2025-02-07 22:55:29,872 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:29,872 INFO  L435           NwaCegarLoop]: 462 mSDtfsCounter, 516 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:29,873 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 925 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:29,873 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 392 states.
[2025-02-07 22:55:29,878 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392.
[2025-02-07 22:55:29,879 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 392 states, 387 states have (on average 1.4573643410852712) internal successors, (564), 387 states have internal predecessors, (564), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-02-07 22:55:29,880 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 570 transitions.
[2025-02-07 22:55:29,880 INFO  L78                 Accepts]: Start accepts. Automaton has 392 states and 570 transitions. Word has length 127
[2025-02-07 22:55:29,881 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:29,881 INFO  L471      AbstractCegarLoop]: Abstraction has 392 states and 570 transitions.
[2025-02-07 22:55:29,882 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2025-02-07 22:55:29,882 INFO  L276                IsEmpty]: Start isEmpty. Operand 392 states and 570 transitions.
[2025-02-07 22:55:29,882 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 129
[2025-02-07 22:55:29,882 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:29,883 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:29,883 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-07 22:55:29,883 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:29,883 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:29,883 INFO  L85        PathProgramCache]: Analyzing trace with hash 703887903, now seen corresponding path program 1 times
[2025-02-07 22:55:29,883 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:29,883 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253323465]
[2025-02-07 22:55:29,883 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:29,883 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:29,910 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes.
[2025-02-07 22:55:29,973 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements.
[2025-02-07 22:55:29,973 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:29,973 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:30,176 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:30,176 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:30,176 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253323465]
[2025-02-07 22:55:30,176 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253323465] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:30,176 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:30,176 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 22:55:30,177 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934064671]
[2025-02-07 22:55:30,177 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:30,177 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:55:30,177 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:30,177 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:55:30,177 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:55:30,178 INFO  L87              Difference]: Start difference. First operand 392 states and 570 transitions. Second operand  has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:30,425 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:30,425 INFO  L93              Difference]: Finished difference Result 717 states and 1039 transitions.
[2025-02-07 22:55:30,426 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:30,426 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 128
[2025-02-07 22:55:30,426 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:30,427 INFO  L225             Difference]: With dead ends: 717
[2025-02-07 22:55:30,427 INFO  L226             Difference]: Without dead ends: 392
[2025-02-07 22:55:30,428 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-07 22:55:30,428 INFO  L435           NwaCegarLoop]: 469 mSDtfsCounter, 2 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:30,428 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1286 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:30,429 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 392 states.
[2025-02-07 22:55:30,435 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392.
[2025-02-07 22:55:30,435 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 392 states, 387 states have (on average 1.454780361757106) internal successors, (563), 387 states have internal predecessors, (563), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-02-07 22:55:30,436 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 569 transitions.
[2025-02-07 22:55:30,436 INFO  L78                 Accepts]: Start accepts. Automaton has 392 states and 569 transitions. Word has length 128
[2025-02-07 22:55:30,437 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:30,437 INFO  L471      AbstractCegarLoop]: Abstraction has 392 states and 569 transitions.
[2025-02-07 22:55:30,437 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:30,437 INFO  L276                IsEmpty]: Start isEmpty. Operand 392 states and 569 transitions.
[2025-02-07 22:55:30,438 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2025-02-07 22:55:30,438 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:30,438 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:30,438 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-07 22:55:30,438 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:30,439 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:30,439 INFO  L85        PathProgramCache]: Analyzing trace with hash -882640465, now seen corresponding path program 1 times
[2025-02-07 22:55:30,439 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:30,440 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500567132]
[2025-02-07 22:55:30,440 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:30,440 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:30,466 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes.
[2025-02-07 22:55:30,515 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements.
[2025-02-07 22:55:30,515 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:30,515 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:30,769 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:30,770 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:30,770 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500567132]
[2025-02-07 22:55:30,770 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500567132] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:30,770 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:30,770 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:30,771 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596418251]
[2025-02-07 22:55:30,771 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:30,771 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:30,771 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:30,771 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:30,772 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:30,773 INFO  L87              Difference]: Start difference. First operand 392 states and 569 transitions. Second operand  has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:30,981 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:30,982 INFO  L93              Difference]: Finished difference Result 715 states and 1035 transitions.
[2025-02-07 22:55:30,983 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:30,983 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 129
[2025-02-07 22:55:30,983 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:30,985 INFO  L225             Difference]: With dead ends: 715
[2025-02-07 22:55:30,985 INFO  L226             Difference]: Without dead ends: 392
[2025-02-07 22:55:30,986 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:55:30,986 INFO  L435           NwaCegarLoop]: 442 mSDtfsCounter, 469 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:30,987 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 885 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:30,988 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 392 states.
[2025-02-07 22:55:30,993 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392.
[2025-02-07 22:55:30,994 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 392 states, 387 states have (on average 1.4521963824289406) internal successors, (562), 387 states have internal predecessors, (562), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-02-07 22:55:30,995 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 568 transitions.
[2025-02-07 22:55:30,995 INFO  L78                 Accepts]: Start accepts. Automaton has 392 states and 568 transitions. Word has length 129
[2025-02-07 22:55:30,996 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:30,996 INFO  L471      AbstractCegarLoop]: Abstraction has 392 states and 568 transitions.
[2025-02-07 22:55:30,996 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:30,997 INFO  L276                IsEmpty]: Start isEmpty. Operand 392 states and 568 transitions.
[2025-02-07 22:55:30,997 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 131
[2025-02-07 22:55:30,997 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:30,998 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:30,998 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-07 22:55:30,998 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:30,998 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:30,998 INFO  L85        PathProgramCache]: Analyzing trace with hash -1202337266, now seen corresponding path program 1 times
[2025-02-07 22:55:30,998 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:30,998 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157798091]
[2025-02-07 22:55:30,999 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:30,999 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:31,024 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes.
[2025-02-07 22:55:31,081 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements.
[2025-02-07 22:55:31,081 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:31,081 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:31,286 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:31,286 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:31,286 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157798091]
[2025-02-07 22:55:31,286 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157798091] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:31,286 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:31,286 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:31,286 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711275414]
[2025-02-07 22:55:31,286 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:31,286 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:31,286 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:31,287 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:31,287 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:31,287 INFO  L87              Difference]: Start difference. First operand 392 states and 568 transitions. Second operand  has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:31,523 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:31,523 INFO  L93              Difference]: Finished difference Result 715 states and 1033 transitions.
[2025-02-07 22:55:31,524 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:31,524 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 130
[2025-02-07 22:55:31,524 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:31,525 INFO  L225             Difference]: With dead ends: 715
[2025-02-07 22:55:31,525 INFO  L226             Difference]: Without dead ends: 392
[2025-02-07 22:55:31,526 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:55:31,526 INFO  L435           NwaCegarLoop]: 442 mSDtfsCounter, 926 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:31,526 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 885 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:31,527 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 392 states.
[2025-02-07 22:55:31,534 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392.
[2025-02-07 22:55:31,535 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 392 states, 387 states have (on average 1.449612403100775) internal successors, (561), 387 states have internal predecessors, (561), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-02-07 22:55:31,536 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 567 transitions.
[2025-02-07 22:55:31,536 INFO  L78                 Accepts]: Start accepts. Automaton has 392 states and 567 transitions. Word has length 130
[2025-02-07 22:55:31,536 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:31,536 INFO  L471      AbstractCegarLoop]: Abstraction has 392 states and 567 transitions.
[2025-02-07 22:55:31,537 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:31,537 INFO  L276                IsEmpty]: Start isEmpty. Operand 392 states and 567 transitions.
[2025-02-07 22:55:31,537 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 132
[2025-02-07 22:55:31,537 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:31,537 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:31,538 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-07 22:55:31,538 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:31,538 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:31,538 INFO  L85        PathProgramCache]: Analyzing trace with hash -132021469, now seen corresponding path program 1 times
[2025-02-07 22:55:31,538 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:31,538 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865680395]
[2025-02-07 22:55:31,538 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:31,538 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:31,571 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes.
[2025-02-07 22:55:31,621 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements.
[2025-02-07 22:55:31,622 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:31,622 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:31,803 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:31,804 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:31,804 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865680395]
[2025-02-07 22:55:31,804 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865680395] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:31,804 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:31,804 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:31,804 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954640052]
[2025-02-07 22:55:31,804 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:31,804 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:31,804 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:31,805 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:31,805 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:31,805 INFO  L87              Difference]: Start difference. First operand 392 states and 567 transitions. Second operand  has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:32,014 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:32,014 INFO  L93              Difference]: Finished difference Result 715 states and 1031 transitions.
[2025-02-07 22:55:32,014 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:32,014 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 131
[2025-02-07 22:55:32,015 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:32,016 INFO  L225             Difference]: With dead ends: 715
[2025-02-07 22:55:32,016 INFO  L226             Difference]: Without dead ends: 392
[2025-02-07 22:55:32,016 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:55:32,017 INFO  L435           NwaCegarLoop]: 442 mSDtfsCounter, 464 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:32,017 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 891 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:32,017 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 392 states.
[2025-02-07 22:55:32,023 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392.
[2025-02-07 22:55:32,023 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 392 states, 387 states have (on average 1.4470284237726099) internal successors, (560), 387 states have internal predecessors, (560), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-02-07 22:55:32,025 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 566 transitions.
[2025-02-07 22:55:32,025 INFO  L78                 Accepts]: Start accepts. Automaton has 392 states and 566 transitions. Word has length 131
[2025-02-07 22:55:32,025 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:32,025 INFO  L471      AbstractCegarLoop]: Abstraction has 392 states and 566 transitions.
[2025-02-07 22:55:32,025 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:32,025 INFO  L276                IsEmpty]: Start isEmpty. Operand 392 states and 566 transitions.
[2025-02-07 22:55:32,026 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 133
[2025-02-07 22:55:32,026 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:32,026 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:32,026 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-07 22:55:32,026 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:32,027 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:32,027 INFO  L85        PathProgramCache]: Analyzing trace with hash -121325496, now seen corresponding path program 1 times
[2025-02-07 22:55:32,027 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:32,027 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666095555]
[2025-02-07 22:55:32,027 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:32,027 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:32,050 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes.
[2025-02-07 22:55:32,095 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements.
[2025-02-07 22:55:32,095 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:32,095 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:32,393 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:32,393 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:32,393 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666095555]
[2025-02-07 22:55:32,393 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666095555] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:32,393 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:32,394 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-07 22:55:32,394 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586265180]
[2025-02-07 22:55:32,394 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:32,394 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-07 22:55:32,394 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:32,395 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-07 22:55:32,395 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-02-07 22:55:32,395 INFO  L87              Difference]: Start difference. First operand 392 states and 566 transitions. Second operand  has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:32,809 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:32,810 INFO  L93              Difference]: Finished difference Result 779 states and 1122 transitions.
[2025-02-07 22:55:32,810 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-07 22:55:32,810 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 132
[2025-02-07 22:55:32,810 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:32,812 INFO  L225             Difference]: With dead ends: 779
[2025-02-07 22:55:32,812 INFO  L226             Difference]: Without dead ends: 396
[2025-02-07 22:55:32,813 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2025-02-07 22:55:32,813 INFO  L435           NwaCegarLoop]: 483 mSDtfsCounter, 600 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 2270 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:32,813 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 2270 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-07 22:55:32,814 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 396 states.
[2025-02-07 22:55:32,820 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 394.
[2025-02-07 22:55:32,820 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 394 states, 389 states have (on average 1.442159383033419) internal successors, (561), 389 states have internal predecessors, (561), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-02-07 22:55:32,822 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 567 transitions.
[2025-02-07 22:55:32,822 INFO  L78                 Accepts]: Start accepts. Automaton has 394 states and 567 transitions. Word has length 132
[2025-02-07 22:55:32,822 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:32,822 INFO  L471      AbstractCegarLoop]: Abstraction has 394 states and 567 transitions.
[2025-02-07 22:55:32,822 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:32,822 INFO  L276                IsEmpty]: Start isEmpty. Operand 394 states and 567 transitions.
[2025-02-07 22:55:32,823 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2025-02-07 22:55:32,823 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:32,823 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:32,823 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-02-07 22:55:32,823 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:32,823 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:32,824 INFO  L85        PathProgramCache]: Analyzing trace with hash -129999352, now seen corresponding path program 1 times
[2025-02-07 22:55:32,824 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:32,824 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231429895]
[2025-02-07 22:55:32,824 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:32,824 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:32,847 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes.
[2025-02-07 22:55:32,893 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements.
[2025-02-07 22:55:32,894 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:32,894 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:33,356 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-02-07 22:55:33,357 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:33,357 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231429895]
[2025-02-07 22:55:33,357 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231429895] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:33,357 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:33,357 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-07 22:55:33,357 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14446716]
[2025-02-07 22:55:33,360 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:33,361 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-07 22:55:33,361 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:33,361 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-07 22:55:33,361 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:55:33,361 INFO  L87              Difference]: Start difference. First operand 394 states and 567 transitions. Second operand  has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:33,712 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:33,712 INFO  L93              Difference]: Finished difference Result 841 states and 1198 transitions.
[2025-02-07 22:55:33,712 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-07 22:55:33,712 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 133
[2025-02-07 22:55:33,713 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:33,714 INFO  L225             Difference]: With dead ends: 841
[2025-02-07 22:55:33,714 INFO  L226             Difference]: Without dead ends: 516
[2025-02-07 22:55:33,715 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2025-02-07 22:55:33,715 INFO  L435           NwaCegarLoop]: 456 mSDtfsCounter, 697 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1818 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:33,716 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1818 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-07 22:55:33,716 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 516 states.
[2025-02-07 22:55:33,725 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516.
[2025-02-07 22:55:33,726 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 516 states, 508 states have (on average 1.419291338582677) internal successors, (721), 508 states have internal predecessors, (721), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-02-07 22:55:33,727 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 733 transitions.
[2025-02-07 22:55:33,728 INFO  L78                 Accepts]: Start accepts. Automaton has 516 states and 733 transitions. Word has length 133
[2025-02-07 22:55:33,728 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:33,728 INFO  L471      AbstractCegarLoop]: Abstraction has 516 states and 733 transitions.
[2025-02-07 22:55:33,728 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:33,728 INFO  L276                IsEmpty]: Start isEmpty. Operand 516 states and 733 transitions.
[2025-02-07 22:55:33,731 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 322
[2025-02-07 22:55:33,731 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:33,731 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:33,731 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-02-07 22:55:33,731 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:33,731 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:33,732 INFO  L85        PathProgramCache]: Analyzing trace with hash -1810076834, now seen corresponding path program 1 times
[2025-02-07 22:55:33,732 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:33,732 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671094941]
[2025-02-07 22:55:33,732 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:33,732 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:33,793 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes.
[2025-02-07 22:55:33,862 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements.
[2025-02-07 22:55:33,862 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:33,862 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:34,168 INFO  L134       CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:55:34,168 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:34,168 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671094941]
[2025-02-07 22:55:34,168 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671094941] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:34,169 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:34,169 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:34,169 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034616817]
[2025-02-07 22:55:34,169 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:34,169 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:34,170 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:34,170 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:34,170 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:34,171 INFO  L87              Difference]: Start difference. First operand 516 states and 733 transitions. Second operand  has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:34,344 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:34,344 INFO  L93              Difference]: Finished difference Result 841 states and 1197 transitions.
[2025-02-07 22:55:34,345 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:34,345 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 321
[2025-02-07 22:55:34,346 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:34,347 INFO  L225             Difference]: With dead ends: 841
[2025-02-07 22:55:34,347 INFO  L226             Difference]: Without dead ends: 516
[2025-02-07 22:55:34,347 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:55:34,348 INFO  L435           NwaCegarLoop]: 441 mSDtfsCounter, 936 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:34,348 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 883 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-07 22:55:34,349 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 516 states.
[2025-02-07 22:55:34,359 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516.
[2025-02-07 22:55:34,360 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 516 states, 508 states have (on average 1.4173228346456692) internal successors, (720), 508 states have internal predecessors, (720), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-02-07 22:55:34,361 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 732 transitions.
[2025-02-07 22:55:34,361 INFO  L78                 Accepts]: Start accepts. Automaton has 516 states and 732 transitions. Word has length 321
[2025-02-07 22:55:34,361 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:34,362 INFO  L471      AbstractCegarLoop]: Abstraction has 516 states and 732 transitions.
[2025-02-07 22:55:34,362 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 58.8) internal successors, (294), 5 states have internal predecessors, (294), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:34,362 INFO  L276                IsEmpty]: Start isEmpty. Operand 516 states and 732 transitions.
[2025-02-07 22:55:34,364 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 323
[2025-02-07 22:55:34,365 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:34,365 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:34,365 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-02-07 22:55:34,365 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:34,366 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:34,366 INFO  L85        PathProgramCache]: Analyzing trace with hash -317520216, now seen corresponding path program 1 times
[2025-02-07 22:55:34,366 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:34,366 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491504937]
[2025-02-07 22:55:34,366 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:34,366 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:34,422 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes.
[2025-02-07 22:55:34,494 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements.
[2025-02-07 22:55:34,494 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:34,494 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:34,792 INFO  L134       CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:55:34,793 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:34,793 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491504937]
[2025-02-07 22:55:34,793 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491504937] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:34,793 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:34,793 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:34,793 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174723752]
[2025-02-07 22:55:34,793 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:34,794 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:34,794 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:34,794 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:34,794 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:34,795 INFO  L87              Difference]: Start difference. First operand 516 states and 732 transitions. Second operand  has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:34,975 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:34,976 INFO  L93              Difference]: Finished difference Result 841 states and 1195 transitions.
[2025-02-07 22:55:34,976 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:34,976 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 322
[2025-02-07 22:55:34,978 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:34,980 INFO  L225             Difference]: With dead ends: 841
[2025-02-07 22:55:34,980 INFO  L226             Difference]: Without dead ends: 516
[2025-02-07 22:55:34,980 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:55:34,981 INFO  L435           NwaCegarLoop]: 441 mSDtfsCounter, 920 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:34,981 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 883 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:34,983 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 516 states.
[2025-02-07 22:55:34,994 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516.
[2025-02-07 22:55:34,994 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 516 states, 508 states have (on average 1.4153543307086613) internal successors, (719), 508 states have internal predecessors, (719), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-02-07 22:55:34,996 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 731 transitions.
[2025-02-07 22:55:34,996 INFO  L78                 Accepts]: Start accepts. Automaton has 516 states and 731 transitions. Word has length 322
[2025-02-07 22:55:34,996 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:34,996 INFO  L471      AbstractCegarLoop]: Abstraction has 516 states and 731 transitions.
[2025-02-07 22:55:34,996 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:34,996 INFO  L276                IsEmpty]: Start isEmpty. Operand 516 states and 731 transitions.
[2025-02-07 22:55:34,998 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 324
[2025-02-07 22:55:34,999 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:34,999 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:34,999 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-02-07 22:55:34,999 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:34,999 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:35,000 INFO  L85        PathProgramCache]: Analyzing trace with hash -1071195729, now seen corresponding path program 1 times
[2025-02-07 22:55:35,000 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:35,000 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734103721]
[2025-02-07 22:55:35,000 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:35,000 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:35,058 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes.
[2025-02-07 22:55:35,130 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements.
[2025-02-07 22:55:35,130 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:35,130 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:35,473 INFO  L134       CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:55:35,473 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:35,473 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734103721]
[2025-02-07 22:55:35,473 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734103721] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:35,473 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:35,473 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:35,473 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488447880]
[2025-02-07 22:55:35,473 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:35,474 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:35,474 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:35,474 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:35,475 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:35,475 INFO  L87              Difference]: Start difference. First operand 516 states and 731 transitions. Second operand  has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:35,671 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:35,671 INFO  L93              Difference]: Finished difference Result 841 states and 1193 transitions.
[2025-02-07 22:55:35,672 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:35,672 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 323
[2025-02-07 22:55:35,672 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:35,674 INFO  L225             Difference]: With dead ends: 841
[2025-02-07 22:55:35,674 INFO  L226             Difference]: Without dead ends: 516
[2025-02-07 22:55:35,674 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:55:35,675 INFO  L435           NwaCegarLoop]: 441 mSDtfsCounter, 498 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:35,675 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 889 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:35,677 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 516 states.
[2025-02-07 22:55:35,689 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516.
[2025-02-07 22:55:35,690 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 516 states, 508 states have (on average 1.4133858267716535) internal successors, (718), 508 states have internal predecessors, (718), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-02-07 22:55:35,691 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 730 transitions.
[2025-02-07 22:55:35,691 INFO  L78                 Accepts]: Start accepts. Automaton has 516 states and 730 transitions. Word has length 323
[2025-02-07 22:55:35,692 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:35,692 INFO  L471      AbstractCegarLoop]: Abstraction has 516 states and 730 transitions.
[2025-02-07 22:55:35,692 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:35,692 INFO  L276                IsEmpty]: Start isEmpty. Operand 516 states and 730 transitions.
[2025-02-07 22:55:35,695 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 325
[2025-02-07 22:55:35,695 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:35,695 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:35,695 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-02-07 22:55:35,695 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:35,695 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:35,695 INFO  L85        PathProgramCache]: Analyzing trace with hash -1083323047, now seen corresponding path program 1 times
[2025-02-07 22:55:35,695 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:35,695 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667855804]
[2025-02-07 22:55:35,695 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:35,696 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:35,773 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes.
[2025-02-07 22:55:35,875 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements.
[2025-02-07 22:55:35,875 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:35,875 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:36,152 INFO  L134       CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:55:36,153 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:36,153 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667855804]
[2025-02-07 22:55:36,153 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667855804] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:36,153 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:36,153 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:36,153 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155625834]
[2025-02-07 22:55:36,154 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:36,154 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:36,154 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:36,155 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:36,155 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:36,155 INFO  L87              Difference]: Start difference. First operand 516 states and 730 transitions. Second operand  has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:36,329 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:36,329 INFO  L93              Difference]: Finished difference Result 841 states and 1191 transitions.
[2025-02-07 22:55:36,332 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:36,332 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 324
[2025-02-07 22:55:36,332 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:36,334 INFO  L225             Difference]: With dead ends: 841
[2025-02-07 22:55:36,334 INFO  L226             Difference]: Without dead ends: 516
[2025-02-07 22:55:36,334 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:55:36,337 INFO  L435           NwaCegarLoop]: 441 mSDtfsCounter, 490 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:36,337 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 889 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-07 22:55:36,338 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 516 states.
[2025-02-07 22:55:36,347 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516.
[2025-02-07 22:55:36,347 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 516 states, 508 states have (on average 1.4114173228346456) internal successors, (717), 508 states have internal predecessors, (717), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-02-07 22:55:36,350 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 729 transitions.
[2025-02-07 22:55:36,350 INFO  L78                 Accepts]: Start accepts. Automaton has 516 states and 729 transitions. Word has length 324
[2025-02-07 22:55:36,351 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:36,351 INFO  L471      AbstractCegarLoop]: Abstraction has 516 states and 729 transitions.
[2025-02-07 22:55:36,351 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:36,351 INFO  L276                IsEmpty]: Start isEmpty. Operand 516 states and 729 transitions.
[2025-02-07 22:55:36,354 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 326
[2025-02-07 22:55:36,354 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:36,354 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:36,355 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-02-07 22:55:36,355 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:36,356 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:36,356 INFO  L85        PathProgramCache]: Analyzing trace with hash -1957255808, now seen corresponding path program 1 times
[2025-02-07 22:55:36,356 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:36,356 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586752551]
[2025-02-07 22:55:36,356 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:36,356 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:36,415 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes.
[2025-02-07 22:55:36,518 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements.
[2025-02-07 22:55:36,518 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:36,518 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:36,775 INFO  L134       CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:55:36,776 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:36,776 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586752551]
[2025-02-07 22:55:36,776 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586752551] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:36,776 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:36,776 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:36,776 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613750659]
[2025-02-07 22:55:36,776 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:36,777 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:36,777 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:36,777 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:36,777 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:36,778 INFO  L87              Difference]: Start difference. First operand 516 states and 729 transitions. Second operand  has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:36,937 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:36,938 INFO  L93              Difference]: Finished difference Result 841 states and 1189 transitions.
[2025-02-07 22:55:36,938 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:36,938 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 325
[2025-02-07 22:55:36,938 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:36,940 INFO  L225             Difference]: With dead ends: 841
[2025-02-07 22:55:36,940 INFO  L226             Difference]: Without dead ends: 516
[2025-02-07 22:55:36,940 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:55:36,941 INFO  L435           NwaCegarLoop]: 449 mSDtfsCounter, 865 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:36,941 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 899 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-07 22:55:36,941 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 516 states.
[2025-02-07 22:55:36,949 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516.
[2025-02-07 22:55:36,949 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 516 states, 508 states have (on average 1.4094488188976377) internal successors, (716), 508 states have internal predecessors, (716), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-02-07 22:55:36,951 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 728 transitions.
[2025-02-07 22:55:36,951 INFO  L78                 Accepts]: Start accepts. Automaton has 516 states and 728 transitions. Word has length 325
[2025-02-07 22:55:36,951 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:36,951 INFO  L471      AbstractCegarLoop]: Abstraction has 516 states and 728 transitions.
[2025-02-07 22:55:36,952 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:36,952 INFO  L276                IsEmpty]: Start isEmpty. Operand 516 states and 728 transitions.
[2025-02-07 22:55:36,954 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 327
[2025-02-07 22:55:36,954 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:36,954 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:36,954 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-02-07 22:55:36,955 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:36,955 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:36,955 INFO  L85        PathProgramCache]: Analyzing trace with hash -1308710518, now seen corresponding path program 1 times
[2025-02-07 22:55:36,955 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:36,955 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164642729]
[2025-02-07 22:55:36,955 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:36,956 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:37,011 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes.
[2025-02-07 22:55:37,084 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements.
[2025-02-07 22:55:37,084 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:37,085 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:37,379 INFO  L134       CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:55:37,379 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:37,379 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164642729]
[2025-02-07 22:55:37,379 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164642729] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:37,379 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:37,380 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:37,380 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574486183]
[2025-02-07 22:55:37,380 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:37,380 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:37,380 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:37,381 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:37,381 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:37,381 INFO  L87              Difference]: Start difference. First operand 516 states and 728 transitions. Second operand  has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:37,534 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:37,535 INFO  L93              Difference]: Finished difference Result 841 states and 1187 transitions.
[2025-02-07 22:55:37,535 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:37,535 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 326
[2025-02-07 22:55:37,535 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:37,537 INFO  L225             Difference]: With dead ends: 841
[2025-02-07 22:55:37,537 INFO  L226             Difference]: Without dead ends: 516
[2025-02-07 22:55:37,537 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:55:37,538 INFO  L435           NwaCegarLoop]: 449 mSDtfsCounter, 849 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:37,538 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 899 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-07 22:55:37,539 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 516 states.
[2025-02-07 22:55:37,546 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516.
[2025-02-07 22:55:37,546 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 516 states, 508 states have (on average 1.4074803149606299) internal successors, (715), 508 states have internal predecessors, (715), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-02-07 22:55:37,548 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 727 transitions.
[2025-02-07 22:55:37,550 INFO  L78                 Accepts]: Start accepts. Automaton has 516 states and 727 transitions. Word has length 326
[2025-02-07 22:55:37,550 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:37,550 INFO  L471      AbstractCegarLoop]: Abstraction has 516 states and 727 transitions.
[2025-02-07 22:55:37,550 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:37,550 INFO  L276                IsEmpty]: Start isEmpty. Operand 516 states and 727 transitions.
[2025-02-07 22:55:37,552 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 328
[2025-02-07 22:55:37,552 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:37,552 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:37,552 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-02-07 22:55:37,552 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:37,553 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:37,553 INFO  L85        PathProgramCache]: Analyzing trace with hash -1148121391, now seen corresponding path program 1 times
[2025-02-07 22:55:37,553 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:37,553 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53472596]
[2025-02-07 22:55:37,553 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:37,553 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:37,608 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes.
[2025-02-07 22:55:37,681 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements.
[2025-02-07 22:55:37,681 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:37,681 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:37,995 INFO  L134       CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:55:37,996 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:37,996 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53472596]
[2025-02-07 22:55:37,996 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53472596] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:37,996 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:37,996 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:37,996 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308775301]
[2025-02-07 22:55:37,996 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:37,997 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:37,997 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:37,998 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:37,998 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:37,998 INFO  L87              Difference]: Start difference. First operand 516 states and 727 transitions. Second operand  has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:38,285 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:38,285 INFO  L93              Difference]: Finished difference Result 841 states and 1185 transitions.
[2025-02-07 22:55:38,285 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:38,286 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 327
[2025-02-07 22:55:38,286 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:38,287 INFO  L225             Difference]: With dead ends: 841
[2025-02-07 22:55:38,287 INFO  L226             Difference]: Without dead ends: 516
[2025-02-07 22:55:38,288 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:55:38,288 INFO  L435           NwaCegarLoop]: 336 mSDtfsCounter, 789 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:38,290 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 673 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-07 22:55:38,291 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 516 states.
[2025-02-07 22:55:38,299 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516.
[2025-02-07 22:55:38,302 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 516 states, 508 states have (on average 1.405511811023622) internal successors, (714), 508 states have internal predecessors, (714), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-02-07 22:55:38,304 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 726 transitions.
[2025-02-07 22:55:38,304 INFO  L78                 Accepts]: Start accepts. Automaton has 516 states and 726 transitions. Word has length 327
[2025-02-07 22:55:38,305 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:38,305 INFO  L471      AbstractCegarLoop]: Abstraction has 516 states and 726 transitions.
[2025-02-07 22:55:38,305 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:38,305 INFO  L276                IsEmpty]: Start isEmpty. Operand 516 states and 726 transitions.
[2025-02-07 22:55:38,306 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 329
[2025-02-07 22:55:38,306 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:38,306 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:38,307 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2025-02-07 22:55:38,307 INFO  L396      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:38,307 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:38,307 INFO  L85        PathProgramCache]: Analyzing trace with hash -1965761733, now seen corresponding path program 1 times
[2025-02-07 22:55:38,307 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:38,307 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107440151]
[2025-02-07 22:55:38,307 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:38,307 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:38,362 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes.
[2025-02-07 22:55:38,600 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements.
[2025-02-07 22:55:38,600 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:38,600 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:39,068 INFO  L134       CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:55:39,068 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:39,068 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107440151]
[2025-02-07 22:55:39,068 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107440151] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:39,069 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:39,069 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 22:55:39,069 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976185900]
[2025-02-07 22:55:39,069 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:39,069 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:55:39,069 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:39,070 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:55:39,070 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:55:39,071 INFO  L87              Difference]: Start difference. First operand 516 states and 726 transitions. Second operand  has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:39,227 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:39,227 INFO  L93              Difference]: Finished difference Result 841 states and 1183 transitions.
[2025-02-07 22:55:39,227 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:39,228 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 328
[2025-02-07 22:55:39,229 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:39,230 INFO  L225             Difference]: With dead ends: 841
[2025-02-07 22:55:39,230 INFO  L226             Difference]: Without dead ends: 516
[2025-02-07 22:55:39,231 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:39,231 INFO  L435           NwaCegarLoop]: 448 mSDtfsCounter, 381 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:39,231 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 897 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-07 22:55:39,232 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 516 states.
[2025-02-07 22:55:39,243 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516.
[2025-02-07 22:55:39,243 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 516 states, 508 states have (on average 1.4035433070866141) internal successors, (713), 508 states have internal predecessors, (713), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-02-07 22:55:39,245 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 725 transitions.
[2025-02-07 22:55:39,245 INFO  L78                 Accepts]: Start accepts. Automaton has 516 states and 725 transitions. Word has length 328
[2025-02-07 22:55:39,245 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:39,245 INFO  L471      AbstractCegarLoop]: Abstraction has 516 states and 725 transitions.
[2025-02-07 22:55:39,246 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:39,246 INFO  L276                IsEmpty]: Start isEmpty. Operand 516 states and 725 transitions.
[2025-02-07 22:55:39,248 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 330
[2025-02-07 22:55:39,248 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:39,248 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:39,248 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2025-02-07 22:55:39,248 INFO  L396      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:39,249 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:39,249 INFO  L85        PathProgramCache]: Analyzing trace with hash 1217502118, now seen corresponding path program 1 times
[2025-02-07 22:55:39,249 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:39,249 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058134438]
[2025-02-07 22:55:39,249 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:39,249 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:39,322 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes.
[2025-02-07 22:55:39,627 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements.
[2025-02-07 22:55:39,627 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:39,628 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:39,959 INFO  L134       CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:55:39,959 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:39,959 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058134438]
[2025-02-07 22:55:39,959 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058134438] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:39,960 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:39,960 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:39,960 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473495260]
[2025-02-07 22:55:39,960 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:39,960 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:39,960 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:39,961 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:39,961 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:39,961 INFO  L87              Difference]: Start difference. First operand 516 states and 725 transitions. Second operand  has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:40,152 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:40,152 INFO  L93              Difference]: Finished difference Result 841 states and 1181 transitions.
[2025-02-07 22:55:40,152 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:40,153 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 329
[2025-02-07 22:55:40,153 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:40,154 INFO  L225             Difference]: With dead ends: 841
[2025-02-07 22:55:40,154 INFO  L226             Difference]: Without dead ends: 516
[2025-02-07 22:55:40,155 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:55:40,156 INFO  L435           NwaCegarLoop]: 437 mSDtfsCounter, 453 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:40,156 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 881 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:40,157 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 516 states.
[2025-02-07 22:55:40,164 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516.
[2025-02-07 22:55:40,165 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 516 states, 508 states have (on average 1.4015748031496063) internal successors, (712), 508 states have internal predecessors, (712), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-02-07 22:55:40,166 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 724 transitions.
[2025-02-07 22:55:40,166 INFO  L78                 Accepts]: Start accepts. Automaton has 516 states and 724 transitions. Word has length 329
[2025-02-07 22:55:40,166 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:40,166 INFO  L471      AbstractCegarLoop]: Abstraction has 516 states and 724 transitions.
[2025-02-07 22:55:40,166 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:40,166 INFO  L276                IsEmpty]: Start isEmpty. Operand 516 states and 724 transitions.
[2025-02-07 22:55:40,168 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 331
[2025-02-07 22:55:40,168 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:40,168 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:40,168 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2025-02-07 22:55:40,168 INFO  L396      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:40,168 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:40,168 INFO  L85        PathProgramCache]: Analyzing trace with hash -1462308975, now seen corresponding path program 1 times
[2025-02-07 22:55:40,168 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:40,168 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946979385]
[2025-02-07 22:55:40,168 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:40,169 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:40,239 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes.
[2025-02-07 22:55:40,447 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements.
[2025-02-07 22:55:40,447 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:40,447 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:40,766 INFO  L134       CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:55:40,767 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:40,767 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946979385]
[2025-02-07 22:55:40,767 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946979385] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:40,767 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:40,767 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:40,767 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357749230]
[2025-02-07 22:55:40,767 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:40,768 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:40,768 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:40,768 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:40,768 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:40,769 INFO  L87              Difference]: Start difference. First operand 516 states and 724 transitions. Second operand  has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:40,953 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:40,954 INFO  L93              Difference]: Finished difference Result 841 states and 1179 transitions.
[2025-02-07 22:55:40,954 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:40,954 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 330
[2025-02-07 22:55:40,954 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:40,956 INFO  L225             Difference]: With dead ends: 841
[2025-02-07 22:55:40,956 INFO  L226             Difference]: Without dead ends: 516
[2025-02-07 22:55:40,956 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:55:40,957 INFO  L435           NwaCegarLoop]: 437 mSDtfsCounter, 850 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:40,957 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 875 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:40,957 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 516 states.
[2025-02-07 22:55:40,964 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516.
[2025-02-07 22:55:40,964 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 516 states, 508 states have (on average 1.3996062992125984) internal successors, (711), 508 states have internal predecessors, (711), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-02-07 22:55:40,965 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 723 transitions.
[2025-02-07 22:55:40,965 INFO  L78                 Accepts]: Start accepts. Automaton has 516 states and 723 transitions. Word has length 330
[2025-02-07 22:55:40,965 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:40,965 INFO  L471      AbstractCegarLoop]: Abstraction has 516 states and 723 transitions.
[2025-02-07 22:55:40,966 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:40,966 INFO  L276                IsEmpty]: Start isEmpty. Operand 516 states and 723 transitions.
[2025-02-07 22:55:40,967 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 332
[2025-02-07 22:55:40,967 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:40,967 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:40,967 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2025-02-07 22:55:40,967 INFO  L396      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:40,967 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:40,968 INFO  L85        PathProgramCache]: Analyzing trace with hash 1005575427, now seen corresponding path program 1 times
[2025-02-07 22:55:40,968 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:40,968 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746941625]
[2025-02-07 22:55:40,968 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:40,968 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:41,018 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes.
[2025-02-07 22:55:41,192 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements.
[2025-02-07 22:55:41,192 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:41,192 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:41,526 INFO  L134       CoverageAnalysis]: Checked inductivity of 143 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:55:41,526 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:41,527 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746941625]
[2025-02-07 22:55:41,527 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746941625] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:41,527 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:41,527 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 22:55:41,527 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812315705]
[2025-02-07 22:55:41,527 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:41,527 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:55:41,527 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:41,528 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:55:41,528 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:55:41,528 INFO  L87              Difference]: Start difference. First operand 516 states and 723 transitions. Second operand  has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:41,695 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:41,695 INFO  L93              Difference]: Finished difference Result 841 states and 1177 transitions.
[2025-02-07 22:55:41,696 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:55:41,696 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 331
[2025-02-07 22:55:41,696 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:41,698 INFO  L225             Difference]: With dead ends: 841
[2025-02-07 22:55:41,698 INFO  L226             Difference]: Without dead ends: 516
[2025-02-07 22:55:41,698 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:41,699 INFO  L435           NwaCegarLoop]: 437 mSDtfsCounter, 390 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:41,699 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 875 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:41,699 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 516 states.
[2025-02-07 22:55:41,708 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516.
[2025-02-07 22:55:41,708 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 516 states, 508 states have (on average 1.3976377952755905) internal successors, (710), 508 states have internal predecessors, (710), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-02-07 22:55:41,709 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 722 transitions.
[2025-02-07 22:55:41,709 INFO  L78                 Accepts]: Start accepts. Automaton has 516 states and 722 transitions. Word has length 331
[2025-02-07 22:55:41,709 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:41,709 INFO  L471      AbstractCegarLoop]: Abstraction has 516 states and 722 transitions.
[2025-02-07 22:55:41,709 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:41,709 INFO  L276                IsEmpty]: Start isEmpty. Operand 516 states and 722 transitions.
[2025-02-07 22:55:41,710 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 333
[2025-02-07 22:55:41,710 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:41,710 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:41,711 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2025-02-07 22:55:41,711 INFO  L396      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:41,711 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:41,711 INFO  L85        PathProgramCache]: Analyzing trace with hash 1769034230, now seen corresponding path program 1 times
[2025-02-07 22:55:41,711 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:41,711 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828951811]
[2025-02-07 22:55:41,711 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:41,711 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:41,764 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes.
[2025-02-07 22:55:42,050 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements.
[2025-02-07 22:55:42,050 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:42,050 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:42,650 INFO  L134       CoverageAnalysis]: Checked inductivity of 143 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2025-02-07 22:55:42,650 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:42,650 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828951811]
[2025-02-07 22:55:42,650 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828951811] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:42,650 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:42,650 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:42,650 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787885793]
[2025-02-07 22:55:42,650 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:42,651 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:42,651 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:42,651 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:42,651 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:42,651 INFO  L87              Difference]: Start difference. First operand 516 states and 722 transitions. Second operand  has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:42,848 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:42,848 INFO  L93              Difference]: Finished difference Result 931 states and 1285 transitions.
[2025-02-07 22:55:42,848 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-07 22:55:42,849 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 332
[2025-02-07 22:55:42,849 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:42,850 INFO  L225             Difference]: With dead ends: 931
[2025-02-07 22:55:42,851 INFO  L226             Difference]: Without dead ends: 604
[2025-02-07 22:55:42,851 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-07 22:55:42,851 INFO  L435           NwaCegarLoop]: 452 mSDtfsCounter, 18 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1800 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:42,852 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1800 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:55:42,852 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 604 states.
[2025-02-07 22:55:42,859 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 600.
[2025-02-07 22:55:42,859 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 600 states, 592 states have (on average 1.3682432432432432) internal successors, (810), 592 states have internal predecessors, (810), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-02-07 22:55:42,860 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 822 transitions.
[2025-02-07 22:55:42,860 INFO  L78                 Accepts]: Start accepts. Automaton has 600 states and 822 transitions. Word has length 332
[2025-02-07 22:55:42,860 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:42,860 INFO  L471      AbstractCegarLoop]: Abstraction has 600 states and 822 transitions.
[2025-02-07 22:55:42,861 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:42,861 INFO  L276                IsEmpty]: Start isEmpty. Operand 600 states and 822 transitions.
[2025-02-07 22:55:42,862 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 335
[2025-02-07 22:55:42,862 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:42,862 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:42,863 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2025-02-07 22:55:42,863 INFO  L396      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:42,863 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:42,863 INFO  L85        PathProgramCache]: Analyzing trace with hash -1450962100, now seen corresponding path program 1 times
[2025-02-07 22:55:42,863 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:42,863 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126965609]
[2025-02-07 22:55:42,863 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:42,863 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:42,917 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes.
[2025-02-07 22:55:43,230 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements.
[2025-02-07 22:55:43,230 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:43,230 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:43,583 INFO  L134       CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:55:43,583 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:43,583 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126965609]
[2025-02-07 22:55:43,583 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126965609] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:43,583 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:43,583 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-07 22:55:43,584 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595950416]
[2025-02-07 22:55:43,584 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:43,584 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-07 22:55:43,584 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:43,584 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-07 22:55:43,584 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:55:43,584 INFO  L87              Difference]: Start difference. First operand 600 states and 822 transitions. Second operand  has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:44,115 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:44,116 INFO  L93              Difference]: Finished difference Result 1404 states and 1930 transitions.
[2025-02-07 22:55:44,116 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-07 22:55:44,116 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 334
[2025-02-07 22:55:44,116 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:44,119 INFO  L225             Difference]: With dead ends: 1404
[2025-02-07 22:55:44,119 INFO  L226             Difference]: Without dead ends: 1037
[2025-02-07 22:55:44,120 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-07 22:55:44,120 INFO  L435           NwaCegarLoop]: 384 mSDtfsCounter, 351 mSDsluCounter, 1506 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 1890 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:44,120 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 1890 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-07 22:55:44,121 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1037 states.
[2025-02-07 22:55:44,132 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 923.
[2025-02-07 22:55:44,133 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 923 states, 912 states have (on average 1.3640350877192982) internal successors, (1244), 912 states have internal predecessors, (1244), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2025-02-07 22:55:44,133 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1262 transitions.
[2025-02-07 22:55:44,134 INFO  L78                 Accepts]: Start accepts. Automaton has 923 states and 1262 transitions. Word has length 334
[2025-02-07 22:55:44,134 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:44,134 INFO  L471      AbstractCegarLoop]: Abstraction has 923 states and 1262 transitions.
[2025-02-07 22:55:44,134 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:44,134 INFO  L276                IsEmpty]: Start isEmpty. Operand 923 states and 1262 transitions.
[2025-02-07 22:55:44,136 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 336
[2025-02-07 22:55:44,136 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:44,136 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:44,136 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2025-02-07 22:55:44,136 INFO  L396      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:44,137 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:44,137 INFO  L85        PathProgramCache]: Analyzing trace with hash 1534612066, now seen corresponding path program 1 times
[2025-02-07 22:55:44,137 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:44,137 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764403001]
[2025-02-07 22:55:44,137 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:44,137 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:44,191 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes.
[2025-02-07 22:55:44,508 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements.
[2025-02-07 22:55:44,509 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:44,509 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:45,243 INFO  L134       CoverageAnalysis]: Checked inductivity of 144 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked.
[2025-02-07 22:55:45,247 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:45,247 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764403001]
[2025-02-07 22:55:45,247 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764403001] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:45,247 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:45,247 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-07 22:55:45,247 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706028959]
[2025-02-07 22:55:45,266 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:45,266 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-07 22:55:45,267 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:45,267 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-07 22:55:45,267 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:55:45,267 INFO  L87              Difference]: Start difference. First operand 923 states and 1262 transitions. Second operand  has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:45,827 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:45,827 INFO  L93              Difference]: Finished difference Result 1734 states and 2361 transitions.
[2025-02-07 22:55:45,827 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-07 22:55:45,827 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 335
[2025-02-07 22:55:45,828 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:45,830 INFO  L225             Difference]: With dead ends: 1734
[2025-02-07 22:55:45,830 INFO  L226             Difference]: Without dead ends: 929
[2025-02-07 22:55:45,831 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2025-02-07 22:55:45,832 INFO  L435           NwaCegarLoop]: 328 mSDtfsCounter, 511 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:45,832 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 1304 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-07 22:55:45,834 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 929 states.
[2025-02-07 22:55:45,847 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 926.
[2025-02-07 22:55:45,848 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 926 states, 915 states have (on average 1.3628415300546448) internal successors, (1247), 915 states have internal predecessors, (1247), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2025-02-07 22:55:45,849 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1265 transitions.
[2025-02-07 22:55:45,849 INFO  L78                 Accepts]: Start accepts. Automaton has 926 states and 1265 transitions. Word has length 335
[2025-02-07 22:55:45,850 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:45,850 INFO  L471      AbstractCegarLoop]: Abstraction has 926 states and 1265 transitions.
[2025-02-07 22:55:45,850 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:45,850 INFO  L276                IsEmpty]: Start isEmpty. Operand 926 states and 1265 transitions.
[2025-02-07 22:55:45,852 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 338
[2025-02-07 22:55:45,852 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:45,852 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:45,852 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2025-02-07 22:55:45,852 INFO  L396      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:45,853 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:45,853 INFO  L85        PathProgramCache]: Analyzing trace with hash 1559687964, now seen corresponding path program 1 times
[2025-02-07 22:55:45,853 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:45,853 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003057820]
[2025-02-07 22:55:45,853 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:45,853 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:45,909 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes.
[2025-02-07 22:55:46,213 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements.
[2025-02-07 22:55:46,214 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:46,214 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:47,010 INFO  L134       CoverageAnalysis]: Checked inductivity of 145 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked.
[2025-02-07 22:55:47,010 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:47,010 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003057820]
[2025-02-07 22:55:47,010 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003057820] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:47,010 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:47,011 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:55:47,011 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283157469]
[2025-02-07 22:55:47,011 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:47,011 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:55:47,011 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:47,012 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:55:47,012 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:47,012 INFO  L87              Difference]: Start difference. First operand 926 states and 1265 transitions. Second operand  has 5 states, 5 states have (on average 53.6) internal successors, (268), 5 states have internal predecessors, (268), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:47,350 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:47,350 INFO  L93              Difference]: Finished difference Result 1600 states and 2160 transitions.
[2025-02-07 22:55:47,351 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-07 22:55:47,351 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 53.6) internal successors, (268), 5 states have internal predecessors, (268), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 337
[2025-02-07 22:55:47,351 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:47,354 INFO  L225             Difference]: With dead ends: 1600
[2025-02-07 22:55:47,354 INFO  L226             Difference]: Without dead ends: 950
[2025-02-07 22:55:47,355 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:55:47,355 INFO  L435           NwaCegarLoop]: 339 mSDtfsCounter, 322 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:47,355 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1004 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-07 22:55:47,357 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 950 states.
[2025-02-07 22:55:47,366 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 944.
[2025-02-07 22:55:47,367 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 944 states, 933 states have (on average 1.3558413719185423) internal successors, (1265), 933 states have internal predecessors, (1265), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2025-02-07 22:55:47,367 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1283 transitions.
[2025-02-07 22:55:47,368 INFO  L78                 Accepts]: Start accepts. Automaton has 944 states and 1283 transitions. Word has length 337
[2025-02-07 22:55:47,368 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:47,368 INFO  L471      AbstractCegarLoop]: Abstraction has 944 states and 1283 transitions.
[2025-02-07 22:55:47,368 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 53.6) internal successors, (268), 5 states have internal predecessors, (268), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:47,368 INFO  L276                IsEmpty]: Start isEmpty. Operand 944 states and 1283 transitions.
[2025-02-07 22:55:47,370 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 340
[2025-02-07 22:55:47,370 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:47,370 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:47,370 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2025-02-07 22:55:47,370 INFO  L396      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:47,371 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:47,371 INFO  L85        PathProgramCache]: Analyzing trace with hash 295269890, now seen corresponding path program 1 times
[2025-02-07 22:55:47,371 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:47,371 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462367848]
[2025-02-07 22:55:47,371 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:47,371 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:47,423 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes.
[2025-02-07 22:55:47,775 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements.
[2025-02-07 22:55:47,775 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:47,775 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:48,078 INFO  L134       CoverageAnalysis]: Checked inductivity of 146 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked.
[2025-02-07 22:55:48,079 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:48,079 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462367848]
[2025-02-07 22:55:48,079 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462367848] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:48,079 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:48,079 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-07 22:55:48,079 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898020512]
[2025-02-07 22:55:48,079 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:48,080 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-07 22:55:48,080 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:48,081 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-07 22:55:48,081 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:55:48,081 INFO  L87              Difference]: Start difference. First operand 944 states and 1283 transitions. Second operand  has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:48,374 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:48,374 INFO  L93              Difference]: Finished difference Result 2094 states and 2820 transitions.
[2025-02-07 22:55:48,374 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-07 22:55:48,374 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 339
[2025-02-07 22:55:48,375 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:48,378 INFO  L225             Difference]: With dead ends: 2094
[2025-02-07 22:55:48,378 INFO  L226             Difference]: Without dead ends: 1414
[2025-02-07 22:55:48,378 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2025-02-07 22:55:48,380 INFO  L435           NwaCegarLoop]: 556 mSDtfsCounter, 755 mSDsluCounter, 1527 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 2083 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:48,380 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 2083 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-07 22:55:48,381 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1414 states.
[2025-02-07 22:55:48,395 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1188.
[2025-02-07 22:55:48,400 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1188 states, 1171 states have (on average 1.3706233988044407) internal successors, (1605), 1171 states have internal predecessors, (1605), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2025-02-07 22:55:48,402 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1635 transitions.
[2025-02-07 22:55:48,403 INFO  L78                 Accepts]: Start accepts. Automaton has 1188 states and 1635 transitions. Word has length 339
[2025-02-07 22:55:48,403 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:48,403 INFO  L471      AbstractCegarLoop]: Abstraction has 1188 states and 1635 transitions.
[2025-02-07 22:55:48,403 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:48,404 INFO  L276                IsEmpty]: Start isEmpty. Operand 1188 states and 1635 transitions.
[2025-02-07 22:55:48,406 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 340
[2025-02-07 22:55:48,406 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:48,406 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:48,406 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2025-02-07 22:55:48,406 INFO  L396      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:48,406 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:48,406 INFO  L85        PathProgramCache]: Analyzing trace with hash -1045756812, now seen corresponding path program 1 times
[2025-02-07 22:55:48,407 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:48,407 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521240433]
[2025-02-07 22:55:48,407 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:48,407 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:48,540 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes.
[2025-02-07 22:55:48,934 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements.
[2025-02-07 22:55:48,934 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:48,934 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:49,731 INFO  L134       CoverageAnalysis]: Checked inductivity of 145 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked.
[2025-02-07 22:55:49,732 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:49,732 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521240433]
[2025-02-07 22:55:49,732 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521240433] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:49,732 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:49,732 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-07 22:55:49,732 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788993874]
[2025-02-07 22:55:49,732 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:49,733 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-07 22:55:49,733 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:49,734 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-07 22:55:49,734 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:55:49,734 INFO  L87              Difference]: Start difference. First operand 1188 states and 1635 transitions. Second operand  has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:50,206 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:50,207 INFO  L93              Difference]: Finished difference Result 2042 states and 2728 transitions.
[2025-02-07 22:55:50,207 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-07 22:55:50,207 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 339
[2025-02-07 22:55:50,208 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:50,211 INFO  L225             Difference]: With dead ends: 2042
[2025-02-07 22:55:50,211 INFO  L226             Difference]: Without dead ends: 1386
[2025-02-07 22:55:50,212 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-07 22:55:50,212 INFO  L435           NwaCegarLoop]: 353 mSDtfsCounter, 350 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:50,212 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1360 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-07 22:55:50,213 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1386 states.
[2025-02-07 22:55:50,235 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1170.
[2025-02-07 22:55:50,236 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1170 states, 1153 states have (on average 1.3712055507372072) internal successors, (1581), 1153 states have internal predecessors, (1581), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2025-02-07 22:55:50,238 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1611 transitions.
[2025-02-07 22:55:50,238 INFO  L78                 Accepts]: Start accepts. Automaton has 1170 states and 1611 transitions. Word has length 339
[2025-02-07 22:55:50,238 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:50,239 INFO  L471      AbstractCegarLoop]: Abstraction has 1170 states and 1611 transitions.
[2025-02-07 22:55:50,239 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-02-07 22:55:50,239 INFO  L276                IsEmpty]: Start isEmpty. Operand 1170 states and 1611 transitions.
[2025-02-07 22:55:50,242 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 340
[2025-02-07 22:55:50,242 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:50,242 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:50,242 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2025-02-07 22:55:50,242 INFO  L396      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:50,243 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:50,243 INFO  L85        PathProgramCache]: Analyzing trace with hash -672507582, now seen corresponding path program 1 times
[2025-02-07 22:55:50,243 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:50,243 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171873750]
[2025-02-07 22:55:50,243 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:50,243 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:50,310 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes.
[2025-02-07 22:55:50,741 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements.
[2025-02-07 22:55:50,741 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:50,741 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:51,067 INFO  L134       CoverageAnalysis]: Checked inductivity of 146 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:55:51,067 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:51,067 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171873750]
[2025-02-07 22:55:51,067 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171873750] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:51,067 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:51,068 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-07 22:55:51,068 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666489670]
[2025-02-07 22:55:51,068 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:51,068 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-07 22:55:51,068 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:51,068 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-07 22:55:51,069 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:55:51,069 INFO  L87              Difference]: Start difference. First operand 1170 states and 1611 transitions. Second operand  has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:51,550 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:51,550 INFO  L93              Difference]: Finished difference Result 1561 states and 2147 transitions.
[2025-02-07 22:55:51,550 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-07 22:55:51,550 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 339
[2025-02-07 22:55:51,551 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:51,554 INFO  L225             Difference]: With dead ends: 1561
[2025-02-07 22:55:51,554 INFO  L226             Difference]: Without dead ends: 1193
[2025-02-07 22:55:51,554 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-07 22:55:51,555 INFO  L435           NwaCegarLoop]: 333 mSDtfsCounter, 999 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1002 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:51,555 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1002 Valid, 1310 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-07 22:55:51,556 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1193 states.
[2025-02-07 22:55:51,568 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1171.
[2025-02-07 22:55:51,569 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1171 states, 1154 states have (on average 1.3708838821490468) internal successors, (1582), 1154 states have internal predecessors, (1582), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2025-02-07 22:55:51,570 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1612 transitions.
[2025-02-07 22:55:51,570 INFO  L78                 Accepts]: Start accepts. Automaton has 1171 states and 1612 transitions. Word has length 339
[2025-02-07 22:55:51,571 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:51,571 INFO  L471      AbstractCegarLoop]: Abstraction has 1171 states and 1612 transitions.
[2025-02-07 22:55:51,571 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:51,571 INFO  L276                IsEmpty]: Start isEmpty. Operand 1171 states and 1612 transitions.
[2025-02-07 22:55:51,573 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 340
[2025-02-07 22:55:51,573 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:51,573 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:51,573 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2025-02-07 22:55:51,574 INFO  L396      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:51,574 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:51,574 INFO  L85        PathProgramCache]: Analyzing trace with hash -1170902095, now seen corresponding path program 1 times
[2025-02-07 22:55:51,574 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:51,574 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985058768]
[2025-02-07 22:55:51,574 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:51,574 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:51,625 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes.
[2025-02-07 22:55:51,892 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements.
[2025-02-07 22:55:51,893 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:51,893 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:52,692 INFO  L134       CoverageAnalysis]: Checked inductivity of 146 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked.
[2025-02-07 22:55:52,693 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:52,693 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985058768]
[2025-02-07 22:55:52,693 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985058768] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:52,693 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:52,693 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-07 22:55:52,693 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526448751]
[2025-02-07 22:55:52,693 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:52,693 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-07 22:55:52,693 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:52,694 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-07 22:55:52,694 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2025-02-07 22:55:52,694 INFO  L87              Difference]: Start difference. First operand 1171 states and 1612 transitions. Second operand  has 8 states, 8 states have (on average 32.625) internal successors, (261), 8 states have internal predecessors, (261), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:53,903 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:53,903 INFO  L93              Difference]: Finished difference Result 2561 states and 3510 transitions.
[2025-02-07 22:55:53,903 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-07 22:55:53,903 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 32.625) internal successors, (261), 8 states have internal predecessors, (261), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 339
[2025-02-07 22:55:53,904 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:53,908 INFO  L225             Difference]: With dead ends: 2561
[2025-02-07 22:55:53,908 INFO  L226             Difference]: Without dead ends: 2053
[2025-02-07 22:55:53,908 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2025-02-07 22:55:53,909 INFO  L435           NwaCegarLoop]: 757 mSDtfsCounter, 1312 mSDsluCounter, 2810 mSDsCounter, 0 mSdLazyCounter, 2524 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1318 SdHoareTripleChecker+Valid, 3567 SdHoareTripleChecker+Invalid, 2525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:53,909 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1318 Valid, 3567 Invalid, 2525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2524 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-02-07 22:55:53,910 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2053 states.
[2025-02-07 22:55:53,933 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 1311.
[2025-02-07 22:55:53,934 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1311 states, 1288 states have (on average 1.3726708074534162) internal successors, (1768), 1288 states have internal predecessors, (1768), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21)
[2025-02-07 22:55:53,935 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1810 transitions.
[2025-02-07 22:55:53,936 INFO  L78                 Accepts]: Start accepts. Automaton has 1311 states and 1810 transitions. Word has length 339
[2025-02-07 22:55:53,936 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:53,936 INFO  L471      AbstractCegarLoop]: Abstraction has 1311 states and 1810 transitions.
[2025-02-07 22:55:53,936 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 32.625) internal successors, (261), 8 states have internal predecessors, (261), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:55:53,936 INFO  L276                IsEmpty]: Start isEmpty. Operand 1311 states and 1810 transitions.
[2025-02-07 22:55:53,939 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 341
[2025-02-07 22:55:53,939 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:53,939 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:53,939 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2025-02-07 22:55:53,939 INFO  L396      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:53,939 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:53,940 INFO  L85        PathProgramCache]: Analyzing trace with hash 36372008, now seen corresponding path program 1 times
[2025-02-07 22:55:53,940 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:53,940 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554790984]
[2025-02-07 22:55:53,940 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:53,940 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:54,014 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes.
[2025-02-07 22:55:54,436 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements.
[2025-02-07 22:55:54,437 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:54,437 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:55,306 INFO  L134       CoverageAnalysis]: Checked inductivity of 146 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked.
[2025-02-07 22:55:55,306 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:55,306 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554790984]
[2025-02-07 22:55:55,306 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554790984] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:55,306 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:55,307 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-02-07 22:55:55,307 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669987536]
[2025-02-07 22:55:55,307 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:55,308 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-02-07 22:55:55,308 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:55,308 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-02-07 22:55:55,308 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2025-02-07 22:55:55,309 INFO  L87              Difference]: Start difference. First operand 1311 states and 1810 transitions. Second operand  has 11 states, 11 states have (on average 24.545454545454547) internal successors, (270), 11 states have internal predecessors, (270), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-02-07 22:55:56,329 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:56,330 INFO  L93              Difference]: Finished difference Result 2822 states and 3833 transitions.
[2025-02-07 22:55:56,330 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-02-07 22:55:56,330 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 24.545454545454547) internal successors, (270), 11 states have internal predecessors, (270), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 340
[2025-02-07 22:55:56,331 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:56,336 INFO  L225             Difference]: With dead ends: 2822
[2025-02-07 22:55:56,336 INFO  L226             Difference]: Without dead ends: 2099
[2025-02-07 22:55:56,337 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342
[2025-02-07 22:55:56,342 INFO  L435           NwaCegarLoop]: 489 mSDtfsCounter, 1728 mSDsluCounter, 2553 mSDsCounter, 0 mSdLazyCounter, 2270 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1729 SdHoareTripleChecker+Valid, 3042 SdHoareTripleChecker+Invalid, 2276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:56,342 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1729 Valid, 3042 Invalid, 2276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2270 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-07 22:55:56,344 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2099 states.
[2025-02-07 22:55:56,383 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 1454.
[2025-02-07 22:55:56,384 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1454 states, 1424 states have (on average 1.3799157303370786) internal successors, (1965), 1424 states have internal predecessors, (1965), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28)
[2025-02-07 22:55:56,390 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 2021 transitions.
[2025-02-07 22:55:56,390 INFO  L78                 Accepts]: Start accepts. Automaton has 1454 states and 2021 transitions. Word has length 340
[2025-02-07 22:55:56,390 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:56,390 INFO  L471      AbstractCegarLoop]: Abstraction has 1454 states and 2021 transitions.
[2025-02-07 22:55:56,390 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 24.545454545454547) internal successors, (270), 11 states have internal predecessors, (270), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-02-07 22:55:56,391 INFO  L276                IsEmpty]: Start isEmpty. Operand 1454 states and 2021 transitions.
[2025-02-07 22:55:56,396 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 343
[2025-02-07 22:55:56,396 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:56,397 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:56,397 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2025-02-07 22:55:56,397 INFO  L396      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:56,397 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:56,397 INFO  L85        PathProgramCache]: Analyzing trace with hash -560707216, now seen corresponding path program 1 times
[2025-02-07 22:55:56,397 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:56,397 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151915583]
[2025-02-07 22:55:56,398 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:56,398 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:56,489 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes.
[2025-02-07 22:55:57,015 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements.
[2025-02-07 22:55:57,015 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:57,015 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:57,329 INFO  L134       CoverageAnalysis]: Checked inductivity of 147 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked.
[2025-02-07 22:55:57,329 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:57,329 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151915583]
[2025-02-07 22:55:57,329 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151915583] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:57,329 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:57,329 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-07 22:55:57,329 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142877530]
[2025-02-07 22:55:57,329 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:57,330 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-07 22:55:57,330 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:57,330 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-07 22:55:57,330 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-02-07 22:55:57,331 INFO  L87              Difference]: Start difference. First operand 1454 states and 2021 transitions. Second operand  has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-02-07 22:55:57,782 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:57,783 INFO  L93              Difference]: Finished difference Result 2552 states and 3538 transitions.
[2025-02-07 22:55:57,783 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-07 22:55:57,783 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 342
[2025-02-07 22:55:57,783 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:57,787 INFO  L225             Difference]: With dead ends: 2552
[2025-02-07 22:55:57,787 INFO  L226             Difference]: Without dead ends: 1482
[2025-02-07 22:55:57,788 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2025-02-07 22:55:57,788 INFO  L435           NwaCegarLoop]: 327 mSDtfsCounter, 537 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:57,788 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 1306 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-07 22:55:57,789 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1482 states.
[2025-02-07 22:55:57,806 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1468.
[2025-02-07 22:55:57,808 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1468 states, 1438 states have (on average 1.3713490959666204) internal successors, (1972), 1438 states have internal predecessors, (1972), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28)
[2025-02-07 22:55:57,809 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 2028 transitions.
[2025-02-07 22:55:57,809 INFO  L78                 Accepts]: Start accepts. Automaton has 1468 states and 2028 transitions. Word has length 342
[2025-02-07 22:55:57,809 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:57,809 INFO  L471      AbstractCegarLoop]: Abstraction has 1468 states and 2028 transitions.
[2025-02-07 22:55:57,809 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-02-07 22:55:57,809 INFO  L276                IsEmpty]: Start isEmpty. Operand 1468 states and 2028 transitions.
[2025-02-07 22:55:57,811 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 345
[2025-02-07 22:55:57,811 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:57,812 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:57,812 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2025-02-07 22:55:57,812 INFO  L396      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:55:57,812 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:55:57,812 INFO  L85        PathProgramCache]: Analyzing trace with hash -430468324, now seen corresponding path program 1 times
[2025-02-07 22:55:57,812 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:55:57,812 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124224702]
[2025-02-07 22:55:57,812 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:55:57,813 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:55:57,883 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes.
[2025-02-07 22:55:58,339 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements.
[2025-02-07 22:55:58,340 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:55:58,340 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:55:59,375 INFO  L134       CoverageAnalysis]: Checked inductivity of 148 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked.
[2025-02-07 22:55:59,375 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:55:59,376 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124224702]
[2025-02-07 22:55:59,376 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124224702] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:55:59,376 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:55:59,376 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-07 22:55:59,376 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115368650]
[2025-02-07 22:55:59,376 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:55:59,376 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-07 22:55:59,376 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:55:59,377 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-07 22:55:59,377 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2025-02-07 22:55:59,377 INFO  L87              Difference]: Start difference. First operand 1468 states and 2028 transitions. Second operand  has 8 states, 8 states have (on average 31.875) internal successors, (255), 8 states have internal predecessors, (255), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-02-07 22:55:59,969 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:55:59,969 INFO  L93              Difference]: Finished difference Result 2572 states and 3538 transitions.
[2025-02-07 22:55:59,970 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-07 22:55:59,970 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 31.875) internal successors, (255), 8 states have internal predecessors, (255), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 344
[2025-02-07 22:55:59,970 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:55:59,973 INFO  L225             Difference]: With dead ends: 2572
[2025-02-07 22:55:59,973 INFO  L226             Difference]: Without dead ends: 1524
[2025-02-07 22:55:59,974 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2025-02-07 22:55:59,975 INFO  L435           NwaCegarLoop]: 331 mSDtfsCounter, 497 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-07 22:55:59,975 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 1944 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1321 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-07 22:55:59,976 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1524 states.
[2025-02-07 22:55:59,994 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1503.
[2025-02-07 22:55:59,995 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1503 states, 1473 states have (on average 1.3672776646300069) internal successors, (2014), 1473 states have internal predecessors, (2014), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28)
[2025-02-07 22:55:59,996 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 2070 transitions.
[2025-02-07 22:55:59,997 INFO  L78                 Accepts]: Start accepts. Automaton has 1503 states and 2070 transitions. Word has length 344
[2025-02-07 22:55:59,997 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:55:59,997 INFO  L471      AbstractCegarLoop]: Abstraction has 1503 states and 2070 transitions.
[2025-02-07 22:55:59,997 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 31.875) internal successors, (255), 8 states have internal predecessors, (255), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-02-07 22:55:59,997 INFO  L276                IsEmpty]: Start isEmpty. Operand 1503 states and 2070 transitions.
[2025-02-07 22:55:59,999 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 347
[2025-02-07 22:55:59,999 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:55:59,999 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:55:59,999 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2025-02-07 22:56:00,000 INFO  L396      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:00,000 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:00,000 INFO  L85        PathProgramCache]: Analyzing trace with hash -1148865072, now seen corresponding path program 1 times
[2025-02-07 22:56:00,000 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:00,000 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093008539]
[2025-02-07 22:56:00,000 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:00,000 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:00,054 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes.
[2025-02-07 22:56:00,479 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements.
[2025-02-07 22:56:00,479 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:00,479 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:01,529 INFO  L134       CoverageAnalysis]: Checked inductivity of 149 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:01,529 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:01,530 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093008539]
[2025-02-07 22:56:01,530 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093008539] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-07 22:56:01,530 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311069766]
[2025-02-07 22:56:01,530 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:01,530 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-07 22:56:01,530 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-07 22:56:01,532 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-07 22:56:01,534 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-02-07 22:56:02,212 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes.
[2025-02-07 22:56:02,408 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements.
[2025-02-07 22:56:02,408 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:02,408 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:02,417 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2061 conjuncts, 34 conjuncts are in the unsatisfiable core
[2025-02-07 22:56:02,426 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-07 22:56:03,030 INFO  L134       CoverageAnalysis]: Checked inductivity of 149 backedges. 82 proven. 3 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked.
[2025-02-07 22:56:03,031 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-07 22:56:04,003 INFO  L134       CoverageAnalysis]: Checked inductivity of 149 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:04,004 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [311069766] provided 1 perfect and 1 imperfect interpolant sequences
[2025-02-07 22:56:04,004 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-02-07 22:56:04,004 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11, 9] total 26
[2025-02-07 22:56:04,004 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320604535]
[2025-02-07 22:56:04,004 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:04,004 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-02-07 22:56:04,004 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:04,005 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-02-07 22:56:04,005 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650
[2025-02-07 22:56:04,005 INFO  L87              Difference]: Start difference. First operand 1503 states and 2070 transitions. Second operand  has 10 states, 10 states have (on average 31.9) internal successors, (319), 10 states have internal predecessors, (319), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-02-07 22:56:04,499 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:04,500 INFO  L93              Difference]: Finished difference Result 2384 states and 3262 transitions.
[2025-02-07 22:56:04,500 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-07 22:56:04,500 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 31.9) internal successors, (319), 10 states have internal predecessors, (319), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 346
[2025-02-07 22:56:04,500 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:04,503 INFO  L225             Difference]: With dead ends: 2384
[2025-02-07 22:56:04,503 INFO  L226             Difference]: Without dead ends: 1409
[2025-02-07 22:56:04,504 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 704 GetRequests, 677 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812
[2025-02-07 22:56:04,505 INFO  L435           NwaCegarLoop]: 326 mSDtfsCounter, 2430 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2431 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:04,505 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2431 Valid, 1296 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-07 22:56:04,506 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1409 states.
[2025-02-07 22:56:04,545 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1374.
[2025-02-07 22:56:04,546 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1374 states, 1351 states have (on average 1.3501110288675056) internal successors, (1824), 1351 states have internal predecessors, (1824), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21)
[2025-02-07 22:56:04,547 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 1866 transitions.
[2025-02-07 22:56:04,547 INFO  L78                 Accepts]: Start accepts. Automaton has 1374 states and 1866 transitions. Word has length 346
[2025-02-07 22:56:04,547 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:04,547 INFO  L471      AbstractCegarLoop]: Abstraction has 1374 states and 1866 transitions.
[2025-02-07 22:56:04,548 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 31.9) internal successors, (319), 10 states have internal predecessors, (319), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-02-07 22:56:04,548 INFO  L276                IsEmpty]: Start isEmpty. Operand 1374 states and 1866 transitions.
[2025-02-07 22:56:04,549 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 347
[2025-02-07 22:56:04,549 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:04,550 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:04,561 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-07 22:56:04,754 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-07 22:56:04,754 INFO  L396      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:04,755 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:04,755 INFO  L85        PathProgramCache]: Analyzing trace with hash 644088624, now seen corresponding path program 1 times
[2025-02-07 22:56:04,755 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:04,755 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309042961]
[2025-02-07 22:56:04,755 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:04,755 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:04,808 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes.
[2025-02-07 22:56:05,258 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements.
[2025-02-07 22:56:05,258 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:05,259 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:05,664 INFO  L134       CoverageAnalysis]: Checked inductivity of 149 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked.
[2025-02-07 22:56:05,664 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:05,664 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309042961]
[2025-02-07 22:56:05,664 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309042961] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:05,664 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:05,664 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-07 22:56:05,664 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787641854]
[2025-02-07 22:56:05,664 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:05,665 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-07 22:56:05,665 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:05,665 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-07 22:56:05,665 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:56:05,665 INFO  L87              Difference]: Start difference. First operand 1374 states and 1866 transitions. Second operand  has 6 states, 6 states have (on average 44.166666666666664) internal successors, (265), 6 states have internal predecessors, (265), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2025-02-07 22:56:06,114 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:06,115 INFO  L93              Difference]: Finished difference Result 2216 states and 2997 transitions.
[2025-02-07 22:56:06,115 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-07 22:56:06,115 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 44.166666666666664) internal successors, (265), 6 states have internal predecessors, (265), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 346
[2025-02-07 22:56:06,115 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:06,118 INFO  L225             Difference]: With dead ends: 2216
[2025-02-07 22:56:06,118 INFO  L226             Difference]: Without dead ends: 1388
[2025-02-07 22:56:06,119 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2025-02-07 22:56:06,121 INFO  L435           NwaCegarLoop]: 326 mSDtfsCounter, 486 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:06,121 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1296 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-07 22:56:06,122 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1388 states.
[2025-02-07 22:56:06,168 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1381.
[2025-02-07 22:56:06,169 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1381 states, 1358 states have (on average 1.3483063328424154) internal successors, (1831), 1358 states have internal predecessors, (1831), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21)
[2025-02-07 22:56:06,170 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1873 transitions.
[2025-02-07 22:56:06,171 INFO  L78                 Accepts]: Start accepts. Automaton has 1381 states and 1873 transitions. Word has length 346
[2025-02-07 22:56:06,171 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:06,171 INFO  L471      AbstractCegarLoop]: Abstraction has 1381 states and 1873 transitions.
[2025-02-07 22:56:06,171 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 44.166666666666664) internal successors, (265), 6 states have internal predecessors, (265), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2025-02-07 22:56:06,171 INFO  L276                IsEmpty]: Start isEmpty. Operand 1381 states and 1873 transitions.
[2025-02-07 22:56:06,173 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 349
[2025-02-07 22:56:06,173 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:06,173 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:06,173 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2025-02-07 22:56:06,173 INFO  L396      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:06,174 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:06,174 INFO  L85        PathProgramCache]: Analyzing trace with hash 1068076806, now seen corresponding path program 1 times
[2025-02-07 22:56:06,174 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:06,174 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122521061]
[2025-02-07 22:56:06,174 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:06,174 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:06,227 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes.
[2025-02-07 22:56:06,679 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements.
[2025-02-07 22:56:06,680 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:06,680 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:07,691 INFO  L134       CoverageAnalysis]: Checked inductivity of 150 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked.
[2025-02-07 22:56:07,692 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:07,692 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122521061]
[2025-02-07 22:56:07,692 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122521061] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:07,692 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:07,692 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-02-07 22:56:07,692 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39477109]
[2025-02-07 22:56:07,692 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:07,692 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-02-07 22:56:07,693 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:07,693 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-02-07 22:56:07,693 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2025-02-07 22:56:07,693 INFO  L87              Difference]: Start difference. First operand 1381 states and 1873 transitions. Second operand  has 10 states, 10 states have (on average 27.4) internal successors, (274), 10 states have internal predecessors, (274), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-02-07 22:56:08,546 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:08,546 INFO  L93              Difference]: Finished difference Result 2411 states and 3262 transitions.
[2025-02-07 22:56:08,546 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-02-07 22:56:08,546 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 27.4) internal successors, (274), 10 states have internal predecessors, (274), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 348
[2025-02-07 22:56:08,547 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:08,550 INFO  L225             Difference]: With dead ends: 2411
[2025-02-07 22:56:08,550 INFO  L226             Difference]: Without dead ends: 1770
[2025-02-07 22:56:08,551 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272
[2025-02-07 22:56:08,552 INFO  L435           NwaCegarLoop]: 677 mSDtfsCounter, 1683 mSDsluCounter, 4153 mSDsCounter, 0 mSdLazyCounter, 1515 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1688 SdHoareTripleChecker+Valid, 4830 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:08,552 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1688 Valid, 4830 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1515 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-07 22:56:08,553 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1770 states.
[2025-02-07 22:56:08,574 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1455.
[2025-02-07 22:56:08,576 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1455 states, 1428 states have (on average 1.3480392156862746) internal successors, (1925), 1428 states have internal predecessors, (1925), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25)
[2025-02-07 22:56:08,577 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 1975 transitions.
[2025-02-07 22:56:08,578 INFO  L78                 Accepts]: Start accepts. Automaton has 1455 states and 1975 transitions. Word has length 348
[2025-02-07 22:56:08,578 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:08,580 INFO  L471      AbstractCegarLoop]: Abstraction has 1455 states and 1975 transitions.
[2025-02-07 22:56:08,580 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 27.4) internal successors, (274), 10 states have internal predecessors, (274), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-02-07 22:56:08,580 INFO  L276                IsEmpty]: Start isEmpty. Operand 1455 states and 1975 transitions.
[2025-02-07 22:56:08,582 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 349
[2025-02-07 22:56:08,582 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:08,582 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:08,583 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2025-02-07 22:56:08,583 INFO  L396      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:08,583 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:08,583 INFO  L85        PathProgramCache]: Analyzing trace with hash 1825434513, now seen corresponding path program 1 times
[2025-02-07 22:56:08,583 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:08,583 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780402676]
[2025-02-07 22:56:08,583 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:08,583 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:08,656 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes.
[2025-02-07 22:56:09,087 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements.
[2025-02-07 22:56:09,088 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:09,088 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:10,037 INFO  L134       CoverageAnalysis]: Checked inductivity of 148 backedges. 4 proven. 84 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:10,038 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:10,038 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780402676]
[2025-02-07 22:56:10,038 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780402676] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-07 22:56:10,038 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770022542]
[2025-02-07 22:56:10,038 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:10,038 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-07 22:56:10,038 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-07 22:56:10,040 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-07 22:56:10,043 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-02-07 22:56:10,728 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes.
[2025-02-07 22:56:11,059 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements.
[2025-02-07 22:56:11,059 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:11,059 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:11,068 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2063 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-02-07 22:56:11,077 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-07 22:56:11,122 INFO  L134       CoverageAnalysis]: Checked inductivity of 148 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked.
[2025-02-07 22:56:11,123 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-07 22:56:11,123 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [770022542] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:11,123 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-07 22:56:11,123 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15
[2025-02-07 22:56:11,123 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012916133]
[2025-02-07 22:56:11,123 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:11,123 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-07 22:56:11,123 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:11,124 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-07 22:56:11,124 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210
[2025-02-07 22:56:11,124 INFO  L87              Difference]: Start difference. First operand 1455 states and 1975 transitions. Second operand  has 6 states, 5 states have (on average 59.8) internal successors, (299), 6 states have internal predecessors, (299), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-02-07 22:56:11,358 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:11,358 INFO  L93              Difference]: Finished difference Result 2310 states and 3123 transitions.
[2025-02-07 22:56:11,358 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-07 22:56:11,359 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 59.8) internal successors, (299), 6 states have internal predecessors, (299), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 348
[2025-02-07 22:56:11,359 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:11,361 INFO  L225             Difference]: With dead ends: 2310
[2025-02-07 22:56:11,361 INFO  L226             Difference]: Without dead ends: 1455
[2025-02-07 22:56:11,362 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210
[2025-02-07 22:56:11,362 INFO  L435           NwaCegarLoop]: 449 mSDtfsCounter, 0 mSDsluCounter, 1782 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2231 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:11,362 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2231 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 22:56:11,365 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1455 states.
[2025-02-07 22:56:11,384 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1455.
[2025-02-07 22:56:11,385 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1455 states, 1428 states have (on average 1.341736694677871) internal successors, (1916), 1428 states have internal predecessors, (1916), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25)
[2025-02-07 22:56:11,386 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 1966 transitions.
[2025-02-07 22:56:11,387 INFO  L78                 Accepts]: Start accepts. Automaton has 1455 states and 1966 transitions. Word has length 348
[2025-02-07 22:56:11,387 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:11,387 INFO  L471      AbstractCegarLoop]: Abstraction has 1455 states and 1966 transitions.
[2025-02-07 22:56:11,387 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 59.8) internal successors, (299), 6 states have internal predecessors, (299), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-02-07 22:56:11,387 INFO  L276                IsEmpty]: Start isEmpty. Operand 1455 states and 1966 transitions.
[2025-02-07 22:56:11,389 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 349
[2025-02-07 22:56:11,389 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:11,389 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:11,403 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-02-07 22:56:11,592 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-07 22:56:11,593 INFO  L396      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:11,593 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:11,593 INFO  L85        PathProgramCache]: Analyzing trace with hash 28863739, now seen corresponding path program 1 times
[2025-02-07 22:56:11,594 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:11,594 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83951421]
[2025-02-07 22:56:11,594 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:11,594 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:11,657 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes.
[2025-02-07 22:56:12,272 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements.
[2025-02-07 22:56:12,272 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:12,272 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:13,202 INFO  L134       CoverageAnalysis]: Checked inductivity of 148 backedges. 52 proven. 19 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked.
[2025-02-07 22:56:13,202 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:13,202 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83951421]
[2025-02-07 22:56:13,202 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83951421] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-07 22:56:13,202 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067046663]
[2025-02-07 22:56:13,203 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:13,203 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-07 22:56:13,203 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-07 22:56:13,205 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-07 22:56:13,206 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-02-07 22:56:13,963 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes.
[2025-02-07 22:56:14,285 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements.
[2025-02-07 22:56:14,286 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:14,286 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:14,297 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2063 conjuncts, 20 conjuncts are in the unsatisfiable core
[2025-02-07 22:56:14,302 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-07 22:56:14,458 INFO  L134       CoverageAnalysis]: Checked inductivity of 148 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2025-02-07 22:56:14,459 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-07 22:56:14,459 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067046663] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:14,459 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-07 22:56:14,459 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15
[2025-02-07 22:56:14,459 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023764488]
[2025-02-07 22:56:14,459 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:14,460 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-07 22:56:14,460 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:14,460 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-07 22:56:14,460 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210
[2025-02-07 22:56:14,460 INFO  L87              Difference]: Start difference. First operand 1455 states and 1966 transitions. Second operand  has 8 states, 8 states have (on average 40.125) internal successors, (321), 8 states have internal predecessors, (321), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:15,076 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:15,077 INFO  L93              Difference]: Finished difference Result 3090 states and 4170 transitions.
[2025-02-07 22:56:15,077 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-07 22:56:15,077 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 40.125) internal successors, (321), 8 states have internal predecessors, (321), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 348
[2025-02-07 22:56:15,077 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:15,081 INFO  L225             Difference]: With dead ends: 3090
[2025-02-07 22:56:15,081 INFO  L226             Difference]: Without dead ends: 2569
[2025-02-07 22:56:15,082 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272
[2025-02-07 22:56:15,082 INFO  L435           NwaCegarLoop]: 332 mSDtfsCounter, 928 mSDsluCounter, 1649 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 1981 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:15,083 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 1981 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-07 22:56:15,084 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2569 states.
[2025-02-07 22:56:15,114 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 2223.
[2025-02-07 22:56:15,115 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2223 states, 2174 states have (on average 1.3247470101195953) internal successors, (2880), 2174 states have internal predecessors, (2880), 47 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47)
[2025-02-07 22:56:15,117 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 2974 transitions.
[2025-02-07 22:56:15,117 INFO  L78                 Accepts]: Start accepts. Automaton has 2223 states and 2974 transitions. Word has length 348
[2025-02-07 22:56:15,117 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:15,118 INFO  L471      AbstractCegarLoop]: Abstraction has 2223 states and 2974 transitions.
[2025-02-07 22:56:15,118 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 40.125) internal successors, (321), 8 states have internal predecessors, (321), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:15,118 INFO  L276                IsEmpty]: Start isEmpty. Operand 2223 states and 2974 transitions.
[2025-02-07 22:56:15,120 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 349
[2025-02-07 22:56:15,120 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:15,121 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:15,137 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-02-07 22:56:15,325 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,SelfDestructingSolverStorable44
[2025-02-07 22:56:15,325 INFO  L396      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:15,325 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:15,326 INFO  L85        PathProgramCache]: Analyzing trace with hash 265118550, now seen corresponding path program 1 times
[2025-02-07 22:56:15,326 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:15,326 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351062309]
[2025-02-07 22:56:15,326 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:15,326 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:15,380 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes.
[2025-02-07 22:56:15,441 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements.
[2025-02-07 22:56:15,442 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:15,442 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:15,748 INFO  L134       CoverageAnalysis]: Checked inductivity of 147 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked.
[2025-02-07 22:56:15,748 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:15,748 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351062309]
[2025-02-07 22:56:15,748 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351062309] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:15,748 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:15,748 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 22:56:15,749 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469207659]
[2025-02-07 22:56:15,749 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:15,749 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:56:15,749 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:15,749 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:56:15,750 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:56:15,750 INFO  L87              Difference]: Start difference. First operand 2223 states and 2974 transitions. Second operand  has 5 states, 5 states have (on average 56.8) internal successors, (284), 5 states have internal predecessors, (284), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:15,923 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:15,924 INFO  L93              Difference]: Finished difference Result 3108 states and 4167 transitions.
[2025-02-07 22:56:15,924 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-07 22:56:15,925 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 56.8) internal successors, (284), 5 states have internal predecessors, (284), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 348
[2025-02-07 22:56:15,925 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:15,929 INFO  L225             Difference]: With dead ends: 3108
[2025-02-07 22:56:15,929 INFO  L226             Difference]: Without dead ends: 2393
[2025-02-07 22:56:15,931 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-07 22:56:15,931 INFO  L435           NwaCegarLoop]: 450 mSDtfsCounter, 16 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:15,931 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1790 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-07 22:56:15,932 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2393 states.
[2025-02-07 22:56:15,964 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 2393.
[2025-02-07 22:56:15,966 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2393 states, 2344 states have (on average 1.331911262798635) internal successors, (3122), 2344 states have internal predecessors, (3122), 47 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47)
[2025-02-07 22:56:15,968 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 3216 transitions.
[2025-02-07 22:56:15,970 INFO  L78                 Accepts]: Start accepts. Automaton has 2393 states and 3216 transitions. Word has length 348
[2025-02-07 22:56:15,970 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:15,970 INFO  L471      AbstractCegarLoop]: Abstraction has 2393 states and 3216 transitions.
[2025-02-07 22:56:15,971 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 56.8) internal successors, (284), 5 states have internal predecessors, (284), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:15,971 INFO  L276                IsEmpty]: Start isEmpty. Operand 2393 states and 3216 transitions.
[2025-02-07 22:56:15,974 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 350
[2025-02-07 22:56:15,974 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:15,974 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:15,974 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2025-02-07 22:56:15,974 INFO  L396      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:15,975 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:15,975 INFO  L85        PathProgramCache]: Analyzing trace with hash 153817065, now seen corresponding path program 1 times
[2025-02-07 22:56:15,975 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:15,975 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424788202]
[2025-02-07 22:56:15,975 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:15,975 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:16,028 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes.
[2025-02-07 22:56:16,744 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements.
[2025-02-07 22:56:16,744 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:16,744 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:17,524 INFO  L134       CoverageAnalysis]: Checked inductivity of 148 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked.
[2025-02-07 22:56:17,524 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:17,524 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424788202]
[2025-02-07 22:56:17,524 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424788202] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:17,524 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:17,524 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-02-07 22:56:17,524 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932419579]
[2025-02-07 22:56:17,524 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:17,524 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-02-07 22:56:17,525 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:17,525 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-02-07 22:56:17,525 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2025-02-07 22:56:17,525 INFO  L87              Difference]: Start difference. First operand 2393 states and 3216 transitions. Second operand  has 9 states, 9 states have (on average 31.11111111111111) internal successors, (280), 9 states have internal predecessors, (280), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-02-07 22:56:18,738 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:18,738 INFO  L93              Difference]: Finished difference Result 4897 states and 6499 transitions.
[2025-02-07 22:56:18,739 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-02-07 22:56:18,739 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 31.11111111111111) internal successors, (280), 9 states have internal predecessors, (280), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 349
[2025-02-07 22:56:18,739 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:18,749 INFO  L225             Difference]: With dead ends: 4897
[2025-02-07 22:56:18,749 INFO  L226             Difference]: Without dead ends: 3896
[2025-02-07 22:56:18,750 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272
[2025-02-07 22:56:18,755 INFO  L435           NwaCegarLoop]: 506 mSDtfsCounter, 1342 mSDsluCounter, 2302 mSDsCounter, 0 mSdLazyCounter, 2105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1343 SdHoareTripleChecker+Valid, 2808 SdHoareTripleChecker+Invalid, 2111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:18,755 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1343 Valid, 2808 Invalid, 2111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2105 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-02-07 22:56:18,758 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3896 states.
[2025-02-07 22:56:18,826 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3896 to 2956.
[2025-02-07 22:56:18,828 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2956 states, 2890 states have (on average 1.329757785467128) internal successors, (3843), 2890 states have internal predecessors, (3843), 64 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64)
[2025-02-07 22:56:18,831 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2956 states to 2956 states and 3971 transitions.
[2025-02-07 22:56:18,831 INFO  L78                 Accepts]: Start accepts. Automaton has 2956 states and 3971 transitions. Word has length 349
[2025-02-07 22:56:18,831 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:18,832 INFO  L471      AbstractCegarLoop]: Abstraction has 2956 states and 3971 transitions.
[2025-02-07 22:56:18,832 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 31.11111111111111) internal successors, (280), 9 states have internal predecessors, (280), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-02-07 22:56:18,832 INFO  L276                IsEmpty]: Start isEmpty. Operand 2956 states and 3971 transitions.
[2025-02-07 22:56:18,836 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 352
[2025-02-07 22:56:18,837 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:18,837 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:18,837 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2025-02-07 22:56:18,837 INFO  L396      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:18,837 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:18,837 INFO  L85        PathProgramCache]: Analyzing trace with hash -1041882619, now seen corresponding path program 1 times
[2025-02-07 22:56:18,838 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:18,838 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467361067]
[2025-02-07 22:56:18,838 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:18,838 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:18,915 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes.
[2025-02-07 22:56:19,587 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements.
[2025-02-07 22:56:19,588 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:19,588 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:20,616 INFO  L134       CoverageAnalysis]: Checked inductivity of 149 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:20,617 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:20,617 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467361067]
[2025-02-07 22:56:20,617 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467361067] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-07 22:56:20,617 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685001603]
[2025-02-07 22:56:20,617 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:20,617 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-07 22:56:20,617 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-07 22:56:20,619 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-07 22:56:20,620 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-02-07 22:56:21,412 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes.
[2025-02-07 22:56:21,783 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements.
[2025-02-07 22:56:21,783 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:21,783 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:21,793 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2072 conjuncts, 24 conjuncts are in the unsatisfiable core
[2025-02-07 22:56:21,799 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-07 22:56:22,031 INFO  L134       CoverageAnalysis]: Checked inductivity of 149 backedges. 83 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:22,032 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-07 22:56:22,385 INFO  L134       CoverageAnalysis]: Checked inductivity of 149 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:22,385 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685001603] provided 1 perfect and 1 imperfect interpolant sequences
[2025-02-07 22:56:22,385 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-02-07 22:56:22,385 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 8] total 22
[2025-02-07 22:56:22,385 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488159595]
[2025-02-07 22:56:22,386 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:22,386 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-07 22:56:22,386 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:22,386 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-07 22:56:22,387 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462
[2025-02-07 22:56:22,387 INFO  L87              Difference]: Start difference. First operand 2956 states and 3971 transitions. Second operand  has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 7 states have internal predecessors, (324), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:23,023 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:23,023 INFO  L93              Difference]: Finished difference Result 3832 states and 5160 transitions.
[2025-02-07 22:56:23,023 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-07 22:56:23,023 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 7 states have internal predecessors, (324), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 351
[2025-02-07 22:56:23,024 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:23,030 INFO  L225             Difference]: With dead ends: 3832
[2025-02-07 22:56:23,030 INFO  L226             Difference]: Without dead ends: 3393
[2025-02-07 22:56:23,033 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 714 GetRequests, 692 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552
[2025-02-07 22:56:23,033 INFO  L435           NwaCegarLoop]: 800 mSDtfsCounter, 351 mSDsluCounter, 3628 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 4428 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:23,033 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 4428 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-07 22:56:23,038 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3393 states.
[2025-02-07 22:56:23,082 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3393 to 3190.
[2025-02-07 22:56:23,084 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3190 states, 3120 states have (on average 1.3269230769230769) internal successors, (4140), 3120 states have internal predecessors, (4140), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68)
[2025-02-07 22:56:23,087 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3190 states to 3190 states and 4276 transitions.
[2025-02-07 22:56:23,088 INFO  L78                 Accepts]: Start accepts. Automaton has 3190 states and 4276 transitions. Word has length 351
[2025-02-07 22:56:23,088 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:23,088 INFO  L471      AbstractCegarLoop]: Abstraction has 3190 states and 4276 transitions.
[2025-02-07 22:56:23,088 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 46.285714285714285) internal successors, (324), 7 states have internal predecessors, (324), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:23,088 INFO  L276                IsEmpty]: Start isEmpty. Operand 3190 states and 4276 transitions.
[2025-02-07 22:56:23,092 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 353
[2025-02-07 22:56:23,092 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:23,093 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:23,107 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2025-02-07 22:56:23,293 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,SelfDestructingSolverStorable47
[2025-02-07 22:56:23,293 INFO  L396      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:23,294 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:23,294 INFO  L85        PathProgramCache]: Analyzing trace with hash -1533792353, now seen corresponding path program 1 times
[2025-02-07 22:56:23,294 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:23,294 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616551613]
[2025-02-07 22:56:23,294 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:23,295 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:23,377 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes.
[2025-02-07 22:56:23,954 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements.
[2025-02-07 22:56:23,954 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:23,954 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:25,000 INFO  L134       CoverageAnalysis]: Checked inductivity of 150 backedges. 4 proven. 86 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:25,001 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:25,001 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616551613]
[2025-02-07 22:56:25,001 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616551613] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-07 22:56:25,001 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199451930]
[2025-02-07 22:56:25,001 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:25,001 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-07 22:56:25,001 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-07 22:56:25,003 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-07 22:56:25,004 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-02-07 22:56:25,809 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes.
[2025-02-07 22:56:26,121 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements.
[2025-02-07 22:56:26,121 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:26,121 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:26,130 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2075 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-02-07 22:56:26,134 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-07 22:56:26,183 INFO  L134       CoverageAnalysis]: Checked inductivity of 150 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked.
[2025-02-07 22:56:26,183 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-07 22:56:26,183 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199451930] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:26,184 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-07 22:56:26,184 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15
[2025-02-07 22:56:26,184 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626497323]
[2025-02-07 22:56:26,184 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:26,184 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-07 22:56:26,184 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:26,185 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-07 22:56:26,188 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210
[2025-02-07 22:56:26,189 INFO  L87              Difference]: Start difference. First operand 3190 states and 4276 transitions. Second operand  has 6 states, 5 states have (on average 53.4) internal successors, (267), 6 states have internal predecessors, (267), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-02-07 22:56:26,521 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:26,522 INFO  L93              Difference]: Finished difference Result 5608 states and 7500 transitions.
[2025-02-07 22:56:26,522 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-07 22:56:26,522 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 53.4) internal successors, (267), 6 states have internal predecessors, (267), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 352
[2025-02-07 22:56:26,522 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:26,536 INFO  L225             Difference]: With dead ends: 5608
[2025-02-07 22:56:26,537 INFO  L226             Difference]: Without dead ends: 3190
[2025-02-07 22:56:26,540 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210
[2025-02-07 22:56:26,540 INFO  L435           NwaCegarLoop]: 450 mSDtfsCounter, 0 mSDsluCounter, 1782 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2232 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:26,540 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2232 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-07 22:56:26,545 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3190 states.
[2025-02-07 22:56:26,633 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3190 to 3162.
[2025-02-07 22:56:26,635 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3162 states, 3092 states have (on average 1.3240620957309186) internal successors, (4094), 3092 states have internal predecessors, (4094), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68)
[2025-02-07 22:56:26,637 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3162 states to 3162 states and 4230 transitions.
[2025-02-07 22:56:26,640 INFO  L78                 Accepts]: Start accepts. Automaton has 3162 states and 4230 transitions. Word has length 352
[2025-02-07 22:56:26,641 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:26,642 INFO  L471      AbstractCegarLoop]: Abstraction has 3162 states and 4230 transitions.
[2025-02-07 22:56:26,642 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 53.4) internal successors, (267), 6 states have internal predecessors, (267), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-02-07 22:56:26,642 INFO  L276                IsEmpty]: Start isEmpty. Operand 3162 states and 4230 transitions.
[2025-02-07 22:56:26,650 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 353
[2025-02-07 22:56:26,650 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:26,650 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:26,685 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-02-07 22:56:26,851 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,SelfDestructingSolverStorable48
[2025-02-07 22:56:26,851 INFO  L396      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:26,852 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:26,852 INFO  L85        PathProgramCache]: Analyzing trace with hash -1930664781, now seen corresponding path program 1 times
[2025-02-07 22:56:26,852 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:26,852 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794422878]
[2025-02-07 22:56:26,852 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:26,852 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:26,904 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes.
[2025-02-07 22:56:27,287 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements.
[2025-02-07 22:56:27,287 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:27,287 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:27,767 INFO  L134       CoverageAnalysis]: Checked inductivity of 152 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:27,768 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:27,768 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794422878]
[2025-02-07 22:56:27,769 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794422878] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:27,769 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:27,769 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-07 22:56:27,769 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98141269]
[2025-02-07 22:56:27,769 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:27,769 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-07 22:56:27,769 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:27,770 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-07 22:56:27,770 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:56:27,770 INFO  L87              Difference]: Start difference. First operand 3162 states and 4230 transitions. Second operand  has 6 states, 6 states have (on average 54.166666666666664) internal successors, (325), 6 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:28,509 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:28,510 INFO  L93              Difference]: Finished difference Result 4809 states and 6444 transitions.
[2025-02-07 22:56:28,510 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-07 22:56:28,510 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 54.166666666666664) internal successors, (325), 6 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 352
[2025-02-07 22:56:28,510 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:28,517 INFO  L225             Difference]: With dead ends: 4809
[2025-02-07 22:56:28,517 INFO  L226             Difference]: Without dead ends: 4140
[2025-02-07 22:56:28,519 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-07 22:56:28,519 INFO  L435           NwaCegarLoop]: 582 mSDtfsCounter, 744 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 2045 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:28,520 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 2045 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1374 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-07 22:56:28,521 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4140 states.
[2025-02-07 22:56:28,660 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4140 to 3334.
[2025-02-07 22:56:28,662 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3334 states, 3260 states have (on average 1.3251533742331287) internal successors, (4320), 3260 states have internal predecessors, (4320), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72)
[2025-02-07 22:56:28,666 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 4464 transitions.
[2025-02-07 22:56:28,667 INFO  L78                 Accepts]: Start accepts. Automaton has 3334 states and 4464 transitions. Word has length 352
[2025-02-07 22:56:28,667 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:28,667 INFO  L471      AbstractCegarLoop]: Abstraction has 3334 states and 4464 transitions.
[2025-02-07 22:56:28,667 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 54.166666666666664) internal successors, (325), 6 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:28,667 INFO  L276                IsEmpty]: Start isEmpty. Operand 3334 states and 4464 transitions.
[2025-02-07 22:56:28,673 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 353
[2025-02-07 22:56:28,673 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:28,673 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:28,673 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2025-02-07 22:56:28,673 INFO  L396      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:28,673 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:28,674 INFO  L85        PathProgramCache]: Analyzing trace with hash -486987729, now seen corresponding path program 1 times
[2025-02-07 22:56:28,674 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:28,674 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974257178]
[2025-02-07 22:56:28,674 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:28,674 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:28,764 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes.
[2025-02-07 22:56:29,082 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements.
[2025-02-07 22:56:29,083 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:29,083 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:29,970 INFO  L134       CoverageAnalysis]: Checked inductivity of 152 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:29,971 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:29,971 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974257178]
[2025-02-07 22:56:29,971 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974257178] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:29,971 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:29,971 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-02-07 22:56:29,971 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071712584]
[2025-02-07 22:56:29,971 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:29,972 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-02-07 22:56:29,972 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:29,972 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-02-07 22:56:29,972 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2025-02-07 22:56:29,973 INFO  L87              Difference]: Start difference. First operand 3334 states and 4464 transitions. Second operand  has 10 states, 10 states have (on average 32.5) internal successors, (325), 10 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:31,053 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:31,053 INFO  L93              Difference]: Finished difference Result 7592 states and 10194 transitions.
[2025-02-07 22:56:31,054 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-02-07 22:56:31,054 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 32.5) internal successors, (325), 10 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 352
[2025-02-07 22:56:31,054 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:31,061 INFO  L225             Difference]: With dead ends: 7592
[2025-02-07 22:56:31,061 INFO  L226             Difference]: Without dead ends: 6923
[2025-02-07 22:56:31,063 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156
[2025-02-07 22:56:31,064 INFO  L435           NwaCegarLoop]: 357 mSDtfsCounter, 1746 mSDsluCounter, 2364 mSDsCounter, 0 mSdLazyCounter, 1949 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1752 SdHoareTripleChecker+Valid, 2721 SdHoareTripleChecker+Invalid, 1952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:31,064 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1752 Valid, 2721 Invalid, 1952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1949 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-02-07 22:56:31,067 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6923 states.
[2025-02-07 22:56:31,195 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6923 to 3690.
[2025-02-07 22:56:31,197 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3690 states, 3600 states have (on average 1.3222222222222222) internal successors, (4760), 3600 states have internal predecessors, (4760), 88 states have call successors, (88), 1 states have call predecessors, (88), 1 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88)
[2025-02-07 22:56:31,204 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3690 states to 3690 states and 4936 transitions.
[2025-02-07 22:56:31,205 INFO  L78                 Accepts]: Start accepts. Automaton has 3690 states and 4936 transitions. Word has length 352
[2025-02-07 22:56:31,209 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:31,209 INFO  L471      AbstractCegarLoop]: Abstraction has 3690 states and 4936 transitions.
[2025-02-07 22:56:31,209 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 32.5) internal successors, (325), 10 states have internal predecessors, (325), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:31,209 INFO  L276                IsEmpty]: Start isEmpty. Operand 3690 states and 4936 transitions.
[2025-02-07 22:56:31,213 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 354
[2025-02-07 22:56:31,216 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:31,217 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:31,217 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2025-02-07 22:56:31,217 INFO  L396      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:31,217 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:31,217 INFO  L85        PathProgramCache]: Analyzing trace with hash 1505665061, now seen corresponding path program 1 times
[2025-02-07 22:56:31,218 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:31,218 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843045921]
[2025-02-07 22:56:31,218 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:31,218 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:31,304 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes.
[2025-02-07 22:56:31,634 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements.
[2025-02-07 22:56:31,634 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:31,634 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:32,034 INFO  L134       CoverageAnalysis]: Checked inductivity of 151 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked.
[2025-02-07 22:56:32,034 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:32,034 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843045921]
[2025-02-07 22:56:32,034 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843045921] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:32,034 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:32,035 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-07 22:56:32,035 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725847716]
[2025-02-07 22:56:32,035 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:32,035 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-07 22:56:32,035 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:32,037 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-07 22:56:32,037 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:56:32,037 INFO  L87              Difference]: Start difference. First operand 3690 states and 4936 transitions. Second operand  has 6 states, 6 states have (on average 43.5) internal successors, (261), 6 states have internal predecessors, (261), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-02-07 22:56:32,522 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:32,522 INFO  L93              Difference]: Finished difference Result 6096 states and 8138 transitions.
[2025-02-07 22:56:32,522 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-07 22:56:32,523 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 43.5) internal successors, (261), 6 states have internal predecessors, (261), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 353
[2025-02-07 22:56:32,523 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:32,527 INFO  L225             Difference]: With dead ends: 6096
[2025-02-07 22:56:32,527 INFO  L226             Difference]: Without dead ends: 3766
[2025-02-07 22:56:32,529 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2025-02-07 22:56:32,530 INFO  L435           NwaCegarLoop]: 326 mSDtfsCounter, 491 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:32,530 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 1296 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-07 22:56:32,531 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3766 states.
[2025-02-07 22:56:32,588 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3766 to 3654.
[2025-02-07 22:56:32,590 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3654 states, 3564 states have (on average 1.3204264870931537) internal successors, (4706), 3564 states have internal predecessors, (4706), 88 states have call successors, (88), 1 states have call predecessors, (88), 1 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88)
[2025-02-07 22:56:32,593 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 3654 states and 4882 transitions.
[2025-02-07 22:56:32,594 INFO  L78                 Accepts]: Start accepts. Automaton has 3654 states and 4882 transitions. Word has length 353
[2025-02-07 22:56:32,594 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:32,594 INFO  L471      AbstractCegarLoop]: Abstraction has 3654 states and 4882 transitions.
[2025-02-07 22:56:32,594 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 43.5) internal successors, (261), 6 states have internal predecessors, (261), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-02-07 22:56:32,594 INFO  L276                IsEmpty]: Start isEmpty. Operand 3654 states and 4882 transitions.
[2025-02-07 22:56:32,599 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 354
[2025-02-07 22:56:32,599 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:32,599 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:32,599 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2025-02-07 22:56:32,599 INFO  L396      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:32,599 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:32,600 INFO  L85        PathProgramCache]: Analyzing trace with hash 1335448246, now seen corresponding path program 1 times
[2025-02-07 22:56:32,600 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:32,600 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944871461]
[2025-02-07 22:56:32,600 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:32,600 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:32,653 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes.
[2025-02-07 22:56:32,718 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements.
[2025-02-07 22:56:32,718 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:32,718 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:33,090 INFO  L134       CoverageAnalysis]: Checked inductivity of 152 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked.
[2025-02-07 22:56:33,090 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:33,090 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944871461]
[2025-02-07 22:56:33,090 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944871461] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:56:33,090 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:56:33,090 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-07 22:56:33,090 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559771579]
[2025-02-07 22:56:33,090 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:56:33,091 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-07 22:56:33,091 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:33,091 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-07 22:56:33,092 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:56:33,092 INFO  L87              Difference]: Start difference. First operand 3654 states and 4882 transitions. Second operand  has 6 states, 6 states have (on average 46.666666666666664) internal successors, (280), 6 states have internal predecessors, (280), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:33,726 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:56:33,730 INFO  L93              Difference]: Finished difference Result 5180 states and 6904 transitions.
[2025-02-07 22:56:33,731 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-07 22:56:33,731 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 46.666666666666664) internal successors, (280), 6 states have internal predecessors, (280), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 353
[2025-02-07 22:56:33,731 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:56:33,737 INFO  L225             Difference]: With dead ends: 5180
[2025-02-07 22:56:33,738 INFO  L226             Difference]: Without dead ends: 3814
[2025-02-07 22:56:33,744 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:56:33,744 INFO  L435           NwaCegarLoop]: 336 mSDtfsCounter, 503 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-07 22:56:33,744 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1330 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-07 22:56:33,746 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3814 states.
[2025-02-07 22:56:33,863 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3814 to 3734.
[2025-02-07 22:56:33,865 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3734 states, 3644 states have (on average 1.3133918770581778) internal successors, (4786), 3644 states have internal predecessors, (4786), 88 states have call successors, (88), 1 states have call predecessors, (88), 1 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88)
[2025-02-07 22:56:33,876 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3734 states to 3734 states and 4962 transitions.
[2025-02-07 22:56:33,877 INFO  L78                 Accepts]: Start accepts. Automaton has 3734 states and 4962 transitions. Word has length 353
[2025-02-07 22:56:33,877 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:56:33,877 INFO  L471      AbstractCegarLoop]: Abstraction has 3734 states and 4962 transitions.
[2025-02-07 22:56:33,877 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 46.666666666666664) internal successors, (280), 6 states have internal predecessors, (280), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-02-07 22:56:33,877 INFO  L276                IsEmpty]: Start isEmpty. Operand 3734 states and 4962 transitions.
[2025-02-07 22:56:33,885 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 354
[2025-02-07 22:56:33,886 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:56:33,887 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:56:33,887 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2025-02-07 22:56:33,887 INFO  L396      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:56:33,887 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:56:33,887 INFO  L85        PathProgramCache]: Analyzing trace with hash -1713587367, now seen corresponding path program 1 times
[2025-02-07 22:56:33,887 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:56:33,887 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39136789]
[2025-02-07 22:56:33,887 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:33,888 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:56:33,993 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes.
[2025-02-07 22:56:34,601 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements.
[2025-02-07 22:56:34,601 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:34,601 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:37,414 INFO  L134       CoverageAnalysis]: Checked inductivity of 151 backedges. 51 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:37,414 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:56:37,414 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39136789]
[2025-02-07 22:56:37,414 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39136789] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-07 22:56:37,414 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870916418]
[2025-02-07 22:56:37,414 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:56:37,414 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-07 22:56:37,414 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-07 22:56:37,417 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-07 22:56:37,418 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-07 22:56:38,324 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes.
[2025-02-07 22:56:38,834 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements.
[2025-02-07 22:56:38,835 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:56:38,835 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:56:38,848 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2078 conjuncts, 30 conjuncts are in the unsatisfiable core
[2025-02-07 22:56:38,854 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-07 22:56:39,454 INFO  L134       CoverageAnalysis]: Checked inductivity of 151 backedges. 123 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2025-02-07 22:56:39,454 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-07 22:56:40,469 INFO  L134       CoverageAnalysis]: Checked inductivity of 151 backedges. 87 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-02-07 22:56:40,469 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870916418] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-07 22:56:40,470 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-07 22:56:40,470 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 8] total 30
[2025-02-07 22:56:40,470 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336000353]
[2025-02-07 22:56:40,470 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-07 22:56:40,470 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2025-02-07 22:56:40,470 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:56:40,471 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2025-02-07 22:56:40,471 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870
[2025-02-07 22:56:40,471 INFO  L87              Difference]: Start difference. First operand 3734 states and 4962 transitions. Second operand  has 30 states, 30 states have (on average 27.766666666666666) internal successors, (833), 30 states have internal predecessors, (833), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18)