./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.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.h_Barrel.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 ae5f6e98a9adcbdf5e1e7125ae4ea5d0cf3bfadfc22b5bc300cef6d9a8d4cfbb
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-48c9605-m
[2025-02-07 23:13:07,583 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-07 23:13:07,661 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf
[2025-02-07 23:13:07,666 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-07 23:13:07,668 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-07 23:13:07,692 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-07 23:13:07,693 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-07 23:13:07,693 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-07 23:13:07,694 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-07 23:13:07,694 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-07 23:13:07,694 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-07 23:13:07,694 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-07 23:13:07,694 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-07 23:13:07,694 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-07 23:13:07,695 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-07 23:13:07,695 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-07 23:13:07,695 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-07 23:13:07,695 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-07 23:13:07,695 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-07 23:13:07,695 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-07 23:13:07,695 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-07 23:13:07,695 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-07 23:13:07,696 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-07 23:13:07,696 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-07 23:13:07,696 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-07 23:13:07,696 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-07 23:13:07,696 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-07 23:13:07,696 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-07 23:13:07,696 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-07 23:13:07,696 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-07 23:13:07,697 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-07 23:13:07,697 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-07 23:13:07,697 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-07 23:13:07,697 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-07 23:13:07,697 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-07 23:13:07,697 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-07 23:13:07,697 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-07 23:13:07,698 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-07 23:13:07,698 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-07 23:13:07,698 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-07 23:13:07,698 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 -> ae5f6e98a9adcbdf5e1e7125ae4ea5d0cf3bfadfc22b5bc300cef6d9a8d4cfbb
[2025-02-07 23:13:07,976 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-07 23:13:07,984 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-07 23:13:07,987 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-07 23:13:07,988 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-07 23:13:07,988 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-07 23:13:07,989 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.h_Barrel.c
[2025-02-07 23:13:09,401 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df016f0d6/8137021f78d94bcbb71a65ed5675a7e7/FLAG646c797d6
[2025-02-07 23:13:09,683 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-07 23:13:09,683 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c
[2025-02-07 23:13:09,693 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df016f0d6/8137021f78d94bcbb71a65ed5675a7e7/FLAG646c797d6
[2025-02-07 23:13:09,709 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df016f0d6/8137021f78d94bcbb71a65ed5675a7e7
[2025-02-07 23:13:09,711 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-07 23:13:09,713 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-07 23:13:09,716 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-07 23:13:09,717 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-07 23:13:09,722 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-07 23:13:09,724 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:13:09" (1/1) ...
[2025-02-07 23:13:09,725 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@375fede8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:09, skipping insertion in model container
[2025-02-07 23:13:09,725 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:13:09" (1/1) ...
[2025-02-07 23:13:09,744 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-07 23:13:09,897 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.h_Barrel.c[1248,1261]
[2025-02-07 23:13:10,003 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-07 23:13:10,016 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-07 23:13:10,024 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.h_Barrel.c[1248,1261]
[2025-02-07 23:13:10,080 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-07 23:13:10,099 INFO  L204         MainTranslator]: Completed translation
[2025-02-07 23:13:10,100 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:10 WrapperNode
[2025-02-07 23:13:10,100 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-07 23:13:10,101 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-07 23:13:10,102 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-07 23:13:10,102 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-07 23:13:10,111 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:10" (1/1) ...
[2025-02-07 23:13:10,127 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:10" (1/1) ...
[2025-02-07 23:13:10,231 INFO  L138                Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 549
[2025-02-07 23:13:10,232 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-07 23:13:10,233 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-07 23:13:10,233 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-07 23:13:10,233 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-07 23:13:10,241 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:10" (1/1) ...
[2025-02-07 23:13:10,242 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:10" (1/1) ...
[2025-02-07 23:13:10,262 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:10" (1/1) ...
[2025-02-07 23:13:10,316 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 23:13:10,317 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:10" (1/1) ...
[2025-02-07 23:13:10,317 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:10" (1/1) ...
[2025-02-07 23:13:10,351 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:10" (1/1) ...
[2025-02-07 23:13:10,361 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:10" (1/1) ...
[2025-02-07 23:13:10,375 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:10" (1/1) ...
[2025-02-07 23:13:10,386 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:10" (1/1) ...
[2025-02-07 23:13:10,404 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-07 23:13:10,406 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-07 23:13:10,406 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-07 23:13:10,407 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-07 23:13:10,408 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:10" (1/1) ...
[2025-02-07 23:13:10,417 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-07 23:13:10,430 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-07 23:13:10,448 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 23:13:10,452 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 23:13:10,476 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-07 23:13:10,477 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-07 23:13:10,477 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-07 23:13:10,477 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-07 23:13:10,617 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-07 23:13:10,619 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-07 23:13:11,612 INFO  L?                        ?]: Removed 357 outVars from TransFormulas that were not future-live.
[2025-02-07 23:13:11,612 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-07 23:13:11,666 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-07 23:13:11,666 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-07 23:13:11,667 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:13:11 BoogieIcfgContainer
[2025-02-07 23:13:11,667 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-07 23:13:11,673 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-07 23:13:11,673 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-07 23:13:11,677 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-07 23:13:11,678 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:13:09" (1/3) ...
[2025-02-07 23:13:11,678 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21fe3398 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:13:11, skipping insertion in model container
[2025-02-07 23:13:11,679 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:10" (2/3) ...
[2025-02-07 23:13:11,680 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21fe3398 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:13:11, skipping insertion in model container
[2025-02-07 23:13:11,680 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:13:11" (3/3) ...
[2025-02-07 23:13:11,681 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Barrel.c
[2025-02-07 23:13:11,697 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-07 23:13:11,698 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_Barrel.c that has 1 procedures, 156 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-07 23:13:11,763 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-07 23:13:11,775 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;@68721957, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-07 23:13:11,777 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-07 23:13:11,782 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 156 states, 154 states have (on average 1.5) internal successors, (231), 155 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:11,792 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2025-02-07 23:13:11,792 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:11,793 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:11,793 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:11,799 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:11,800 INFO  L85        PathProgramCache]: Analyzing trace with hash 1365911206, now seen corresponding path program 1 times
[2025-02-07 23:13:11,807 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:11,810 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002544289]
[2025-02-07 23:13:11,811 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:11,811 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:11,952 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes.
[2025-02-07 23:13:12,193 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements.
[2025-02-07 23:13:12,194 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:12,194 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:12,988 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:12,989 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:12,989 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002544289]
[2025-02-07 23:13:12,991 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002544289] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:12,991 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:12,991 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:13:12,993 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145530083]
[2025-02-07 23:13:12,993 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:12,997 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 23:13:12,998 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:13,019 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 23:13:13,019 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:13:13,022 INFO  L87              Difference]: Start difference. First operand  has 156 states, 154 states have (on average 1.5) internal successors, (231), 155 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:13,187 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:13,189 INFO  L93              Difference]: Finished difference Result 295 states and 439 transitions.
[2025-02-07 23:13:13,190 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:13:13,191 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78
[2025-02-07 23:13:13,191 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:13,201 INFO  L225             Difference]: With dead ends: 295
[2025-02-07 23:13:13,202 INFO  L226             Difference]: Without dead ends: 156
[2025-02-07 23:13:13,204 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 23:13:13,207 INFO  L435           NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:13,207 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 562 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-07 23:13:13,221 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 156 states.
[2025-02-07 23:13:13,236 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156.
[2025-02-07 23:13:13,238 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 156 states, 155 states have (on average 1.4838709677419355) internal successors, (230), 155 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:13,243 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 230 transitions.
[2025-02-07 23:13:13,244 INFO  L78                 Accepts]: Start accepts. Automaton has 156 states and 230 transitions. Word has length 78
[2025-02-07 23:13:13,245 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:13,245 INFO  L471      AbstractCegarLoop]: Abstraction has 156 states and 230 transitions.
[2025-02-07 23:13:13,245 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:13,245 INFO  L276                IsEmpty]: Start isEmpty. Operand 156 states and 230 transitions.
[2025-02-07 23:13:13,247 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2025-02-07 23:13:13,248 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:13,248 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:13,249 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-07 23:13:13,249 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:13,249 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:13,250 INFO  L85        PathProgramCache]: Analyzing trace with hash -601746431, now seen corresponding path program 1 times
[2025-02-07 23:13:13,250 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:13,250 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966555871]
[2025-02-07 23:13:13,250 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:13,250 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:13,287 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes.
[2025-02-07 23:13:13,355 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements.
[2025-02-07 23:13:13,355 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:13,355 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:13,666 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:13,667 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:13,667 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966555871]
[2025-02-07 23:13:13,668 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966555871] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:13,668 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:13,668 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:13:13,668 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378004727]
[2025-02-07 23:13:13,668 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:13,670 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 23:13:13,670 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:13,671 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 23:13:13,671 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:13:13,671 INFO  L87              Difference]: Start difference. First operand 156 states and 230 transitions. Second operand  has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:13,824 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:13,824 INFO  L93              Difference]: Finished difference Result 297 states and 438 transitions.
[2025-02-07 23:13:13,827 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:13:13,827 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79
[2025-02-07 23:13:13,828 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:13,828 INFO  L225             Difference]: With dead ends: 297
[2025-02-07 23:13:13,829 INFO  L226             Difference]: Without dead ends: 158
[2025-02-07 23:13:13,829 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 23:13:13,830 INFO  L435           NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:13,830 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 559 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-07 23:13:13,831 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 158 states.
[2025-02-07 23:13:13,841 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158.
[2025-02-07 23:13:13,841 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 158 states, 157 states have (on average 1.4777070063694266) internal successors, (232), 157 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:13,842 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 232 transitions.
[2025-02-07 23:13:13,845 INFO  L78                 Accepts]: Start accepts. Automaton has 158 states and 232 transitions. Word has length 79
[2025-02-07 23:13:13,846 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:13,846 INFO  L471      AbstractCegarLoop]: Abstraction has 158 states and 232 transitions.
[2025-02-07 23:13:13,846 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:13,846 INFO  L276                IsEmpty]: Start isEmpty. Operand 158 states and 232 transitions.
[2025-02-07 23:13:13,848 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2025-02-07 23:13:13,848 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:13,848 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:13,848 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-07 23:13:13,848 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:13,849 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:13,849 INFO  L85        PathProgramCache]: Analyzing trace with hash 457239041, now seen corresponding path program 1 times
[2025-02-07 23:13:13,849 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:13,849 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101663101]
[2025-02-07 23:13:13,849 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:13,853 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:13,885 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes.
[2025-02-07 23:13:14,073 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements.
[2025-02-07 23:13:14,073 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:14,073 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:14,456 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:14,457 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:14,457 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101663101]
[2025-02-07 23:13:14,457 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101663101] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:14,457 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:14,457 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:13:14,458 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373361433]
[2025-02-07 23:13:14,458 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:14,458 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 23:13:14,458 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:14,459 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 23:13:14,459 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 23:13:14,460 INFO  L87              Difference]: Start difference. First operand 158 states and 232 transitions. Second operand  has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:14,608 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:14,608 INFO  L93              Difference]: Finished difference Result 303 states and 445 transitions.
[2025-02-07 23:13:14,608 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-07 23:13:14,609 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80
[2025-02-07 23:13:14,609 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:14,610 INFO  L225             Difference]: With dead ends: 303
[2025-02-07 23:13:14,610 INFO  L226             Difference]: Without dead ends: 162
[2025-02-07 23:13:14,610 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-07 23:13:14,611 INFO  L435           NwaCegarLoop]: 188 mSDtfsCounter, 162 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:14,611 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 557 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-07 23:13:14,615 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 162 states.
[2025-02-07 23:13:14,623 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161.
[2025-02-07 23:13:14,624 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 161 states, 160 states have (on average 1.46875) internal successors, (235), 160 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:14,625 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 235 transitions.
[2025-02-07 23:13:14,625 INFO  L78                 Accepts]: Start accepts. Automaton has 161 states and 235 transitions. Word has length 80
[2025-02-07 23:13:14,626 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:14,626 INFO  L471      AbstractCegarLoop]: Abstraction has 161 states and 235 transitions.
[2025-02-07 23:13:14,626 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:14,626 INFO  L276                IsEmpty]: Start isEmpty. Operand 161 states and 235 transitions.
[2025-02-07 23:13:14,628 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2025-02-07 23:13:14,630 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:14,631 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:14,631 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-07 23:13:14,631 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:14,631 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:14,632 INFO  L85        PathProgramCache]: Analyzing trace with hash -729124448, now seen corresponding path program 1 times
[2025-02-07 23:13:14,632 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:14,632 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820693869]
[2025-02-07 23:13:14,632 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:14,632 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:14,671 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes.
[2025-02-07 23:13:15,296 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements.
[2025-02-07 23:13:15,296 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:15,296 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:16,510 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:16,510 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:16,510 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820693869]
[2025-02-07 23:13:16,510 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820693869] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:16,511 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:16,511 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-07 23:13:16,511 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851301641]
[2025-02-07 23:13:16,511 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:16,511 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-07 23:13:16,511 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:16,512 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-07 23:13:16,512 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-02-07 23:13:16,512 INFO  L87              Difference]: Start difference. First operand 161 states and 235 transitions. Second operand  has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:16,961 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:16,962 INFO  L93              Difference]: Finished difference Result 457 states and 667 transitions.
[2025-02-07 23:13:16,962 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-07 23:13:16,962 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81
[2025-02-07 23:13:16,963 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:16,965 INFO  L225             Difference]: With dead ends: 457
[2025-02-07 23:13:16,965 INFO  L226             Difference]: Without dead ends: 313
[2025-02-07 23:13:16,966 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2025-02-07 23:13:16,967 INFO  L435           NwaCegarLoop]: 164 mSDtfsCounter, 213 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:16,967 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1125 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-07 23:13:16,968 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 313 states.
[2025-02-07 23:13:16,982 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 169.
[2025-02-07 23:13:16,986 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 169 states, 168 states have (on average 1.4583333333333333) internal successors, (245), 168 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:16,987 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 245 transitions.
[2025-02-07 23:13:16,987 INFO  L78                 Accepts]: Start accepts. Automaton has 169 states and 245 transitions. Word has length 81
[2025-02-07 23:13:16,987 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:16,987 INFO  L471      AbstractCegarLoop]: Abstraction has 169 states and 245 transitions.
[2025-02-07 23:13:16,987 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:16,987 INFO  L276                IsEmpty]: Start isEmpty. Operand 169 states and 245 transitions.
[2025-02-07 23:13:16,988 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 83
[2025-02-07 23:13:16,988 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:16,988 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:16,988 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-07 23:13:16,988 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:16,989 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:16,989 INFO  L85        PathProgramCache]: Analyzing trace with hash 373216015, now seen corresponding path program 1 times
[2025-02-07 23:13:16,989 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:16,989 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965147049]
[2025-02-07 23:13:16,989 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:16,989 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:17,030 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes.
[2025-02-07 23:13:17,225 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements.
[2025-02-07 23:13:17,226 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:17,226 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:18,042 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:18,042 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:18,042 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965147049]
[2025-02-07 23:13:18,042 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965147049] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:18,042 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:18,042 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-07 23:13:18,042 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19427270]
[2025-02-07 23:13:18,042 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:18,043 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-02-07 23:13:18,043 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:18,043 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-02-07 23:13:18,043 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2025-02-07 23:13:18,044 INFO  L87              Difference]: Start difference. First operand 169 states and 245 transitions. Second operand  has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:18,454 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:18,454 INFO  L93              Difference]: Finished difference Result 462 states and 672 transitions.
[2025-02-07 23:13:18,454 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-02-07 23:13:18,454 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82
[2025-02-07 23:13:18,454 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:18,456 INFO  L225             Difference]: With dead ends: 462
[2025-02-07 23:13:18,456 INFO  L226             Difference]: Without dead ends: 318
[2025-02-07 23:13:18,456 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132
[2025-02-07 23:13:18,457 INFO  L435           NwaCegarLoop]: 164 mSDtfsCounter, 428 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:18,457 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 1124 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-07 23:13:18,458 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 318 states.
[2025-02-07 23:13:18,463 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 182.
[2025-02-07 23:13:18,464 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 182 states, 181 states have (on average 1.4530386740331491) internal successors, (263), 181 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:18,464 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 263 transitions.
[2025-02-07 23:13:18,465 INFO  L78                 Accepts]: Start accepts. Automaton has 182 states and 263 transitions. Word has length 82
[2025-02-07 23:13:18,465 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:18,465 INFO  L471      AbstractCegarLoop]: Abstraction has 182 states and 263 transitions.
[2025-02-07 23:13:18,465 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:18,465 INFO  L276                IsEmpty]: Start isEmpty. Operand 182 states and 263 transitions.
[2025-02-07 23:13:18,466 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2025-02-07 23:13:18,466 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:18,466 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:18,466 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-07 23:13:18,467 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:18,467 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:18,467 INFO  L85        PathProgramCache]: Analyzing trace with hash -272657974, now seen corresponding path program 1 times
[2025-02-07 23:13:18,467 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:18,467 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17482916]
[2025-02-07 23:13:18,467 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:18,467 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:18,494 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes.
[2025-02-07 23:13:18,654 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements.
[2025-02-07 23:13:18,654 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:18,655 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:19,362 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:19,362 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:19,362 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17482916]
[2025-02-07 23:13:19,362 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17482916] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:19,362 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:19,363 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-07 23:13:19,363 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587829214]
[2025-02-07 23:13:19,363 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:19,363 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-07 23:13:19,363 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:19,364 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-07 23:13:19,364 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-02-07 23:13:19,364 INFO  L87              Difference]: Start difference. First operand 182 states and 263 transitions. Second operand  has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:19,781 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:19,782 INFO  L93              Difference]: Finished difference Result 467 states and 678 transitions.
[2025-02-07 23:13:19,782 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-07 23:13:19,782 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83
[2025-02-07 23:13:19,783 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:19,785 INFO  L225             Difference]: With dead ends: 467
[2025-02-07 23:13:19,785 INFO  L226             Difference]: Without dead ends: 323
[2025-02-07 23:13:19,786 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2025-02-07 23:13:19,786 INFO  L435           NwaCegarLoop]: 165 mSDtfsCounter, 203 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:19,791 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 1148 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-07 23:13:19,792 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 323 states.
[2025-02-07 23:13:19,800 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 195.
[2025-02-07 23:13:19,801 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 195 states, 194 states have (on average 1.4484536082474226) internal successors, (281), 194 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:19,802 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 281 transitions.
[2025-02-07 23:13:19,803 INFO  L78                 Accepts]: Start accepts. Automaton has 195 states and 281 transitions. Word has length 83
[2025-02-07 23:13:19,803 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:19,803 INFO  L471      AbstractCegarLoop]: Abstraction has 195 states and 281 transitions.
[2025-02-07 23:13:19,803 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:19,803 INFO  L276                IsEmpty]: Start isEmpty. Operand 195 states and 281 transitions.
[2025-02-07 23:13:19,804 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2025-02-07 23:13:19,804 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:19,804 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:19,805 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-07 23:13:19,805 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:19,805 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:19,805 INFO  L85        PathProgramCache]: Analyzing trace with hash 1440614981, now seen corresponding path program 1 times
[2025-02-07 23:13:19,805 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:19,806 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210650901]
[2025-02-07 23:13:19,806 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:19,806 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:19,837 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes.
[2025-02-07 23:13:19,974 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements.
[2025-02-07 23:13:19,974 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:19,974 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:20,627 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:20,628 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:20,628 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210650901]
[2025-02-07 23:13:20,628 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210650901] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:20,628 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:20,628 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-07 23:13:20,628 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908903636]
[2025-02-07 23:13:20,628 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:20,629 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-07 23:13:20,629 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:20,629 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-07 23:13:20,630 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-02-07 23:13:20,630 INFO  L87              Difference]: Start difference. First operand 195 states and 281 transitions. Second operand  has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:20,871 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:20,872 INFO  L93              Difference]: Finished difference Result 361 states and 523 transitions.
[2025-02-07 23:13:20,872 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-07 23:13:20,872 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83
[2025-02-07 23:13:20,873 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:20,874 INFO  L225             Difference]: With dead ends: 361
[2025-02-07 23:13:20,874 INFO  L226             Difference]: Without dead ends: 204
[2025-02-07 23:13:20,874 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-02-07 23:13:20,875 INFO  L435           NwaCegarLoop]: 180 mSDtfsCounter, 4 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:20,875 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1066 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 23:13:20,876 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 204 states.
[2025-02-07 23:13:20,879 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201.
[2025-02-07 23:13:20,880 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 201 states, 200 states have (on average 1.445) internal successors, (289), 200 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:20,881 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 289 transitions.
[2025-02-07 23:13:20,881 INFO  L78                 Accepts]: Start accepts. Automaton has 201 states and 289 transitions. Word has length 83
[2025-02-07 23:13:20,881 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:20,881 INFO  L471      AbstractCegarLoop]: Abstraction has 201 states and 289 transitions.
[2025-02-07 23:13:20,881 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:20,882 INFO  L276                IsEmpty]: Start isEmpty. Operand 201 states and 289 transitions.
[2025-02-07 23:13:20,882 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2025-02-07 23:13:20,882 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:20,883 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:20,883 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-07 23:13:20,883 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:20,883 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:20,883 INFO  L85        PathProgramCache]: Analyzing trace with hash -1810408490, now seen corresponding path program 1 times
[2025-02-07 23:13:20,883 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:20,884 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647762299]
[2025-02-07 23:13:20,884 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:20,884 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:20,912 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes.
[2025-02-07 23:13:20,979 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements.
[2025-02-07 23:13:20,979 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:20,979 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:21,484 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:21,484 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:21,484 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647762299]
[2025-02-07 23:13:21,484 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647762299] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:21,484 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:21,484 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:13:21,484 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078454919]
[2025-02-07 23:13:21,484 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:21,485 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 23:13:21,485 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:21,485 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 23:13:21,485 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:13:21,485 INFO  L87              Difference]: Start difference. First operand 201 states and 289 transitions. Second operand  has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:21,567 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:21,568 INFO  L93              Difference]: Finished difference Result 370 states and 534 transitions.
[2025-02-07 23:13:21,568 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:13:21,568 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83
[2025-02-07 23:13:21,568 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:21,569 INFO  L225             Difference]: With dead ends: 370
[2025-02-07 23:13:21,569 INFO  L226             Difference]: Without dead ends: 198
[2025-02-07 23:13:21,570 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:13:21,570 INFO  L435           NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:21,570 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 371 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-07 23:13:21,571 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 198 states.
[2025-02-07 23:13:21,576 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198.
[2025-02-07 23:13:21,578 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 198 states, 197 states have (on average 1.4365482233502538) internal successors, (283), 197 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:21,579 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 283 transitions.
[2025-02-07 23:13:21,579 INFO  L78                 Accepts]: Start accepts. Automaton has 198 states and 283 transitions. Word has length 83
[2025-02-07 23:13:21,579 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:21,579 INFO  L471      AbstractCegarLoop]: Abstraction has 198 states and 283 transitions.
[2025-02-07 23:13:21,579 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:21,580 INFO  L276                IsEmpty]: Start isEmpty. Operand 198 states and 283 transitions.
[2025-02-07 23:13:21,580 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2025-02-07 23:13:21,580 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:21,580 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:21,581 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-07 23:13:21,582 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:21,584 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:21,584 INFO  L85        PathProgramCache]: Analyzing trace with hash 750712384, now seen corresponding path program 1 times
[2025-02-07 23:13:21,585 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:21,585 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093629475]
[2025-02-07 23:13:21,585 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:21,585 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:21,617 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes.
[2025-02-07 23:13:21,721 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements.
[2025-02-07 23:13:21,721 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:21,721 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:22,214 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:22,216 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:22,216 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093629475]
[2025-02-07 23:13:22,216 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093629475] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:22,216 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:22,216 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:13:22,217 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690787685]
[2025-02-07 23:13:22,217 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:22,217 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 23:13:22,217 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:22,218 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 23:13:22,218 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:13:22,219 INFO  L87              Difference]: Start difference. First operand 198 states and 283 transitions. Second operand  has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:22,326 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:22,326 INFO  L93              Difference]: Finished difference Result 359 states and 515 transitions.
[2025-02-07 23:13:22,326 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:13:22,327 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83
[2025-02-07 23:13:22,327 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:22,328 INFO  L225             Difference]: With dead ends: 359
[2025-02-07 23:13:22,328 INFO  L226             Difference]: Without dead ends: 185
[2025-02-07 23:13:22,329 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:13:22,329 INFO  L435           NwaCegarLoop]: 186 mSDtfsCounter, 0 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:22,329 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 552 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-07 23:13:22,330 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 185 states.
[2025-02-07 23:13:22,334 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185.
[2025-02-07 23:13:22,336 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 185 states, 184 states have (on average 1.4293478260869565) internal successors, (263), 184 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:22,337 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 263 transitions.
[2025-02-07 23:13:22,337 INFO  L78                 Accepts]: Start accepts. Automaton has 185 states and 263 transitions. Word has length 83
[2025-02-07 23:13:22,337 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:22,338 INFO  L471      AbstractCegarLoop]: Abstraction has 185 states and 263 transitions.
[2025-02-07 23:13:22,338 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:22,338 INFO  L276                IsEmpty]: Start isEmpty. Operand 185 states and 263 transitions.
[2025-02-07 23:13:22,338 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2025-02-07 23:13:22,338 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:22,339 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:22,339 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-07 23:13:22,339 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:22,342 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:22,342 INFO  L85        PathProgramCache]: Analyzing trace with hash -1105702471, now seen corresponding path program 1 times
[2025-02-07 23:13:22,343 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:22,343 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926764167]
[2025-02-07 23:13:22,343 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:22,343 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:22,375 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes.
[2025-02-07 23:13:22,513 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements.
[2025-02-07 23:13:22,513 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:22,513 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:23,075 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:23,076 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:23,076 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926764167]
[2025-02-07 23:13:23,076 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926764167] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:23,076 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:23,076 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-07 23:13:23,076 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221133706]
[2025-02-07 23:13:23,076 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:23,076 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-07 23:13:23,076 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:23,077 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-07 23:13:23,077 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-02-07 23:13:23,077 INFO  L87              Difference]: Start difference. First operand 185 states and 263 transitions. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:23,466 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:23,467 INFO  L93              Difference]: Finished difference Result 465 states and 669 transitions.
[2025-02-07 23:13:23,467 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-07 23:13:23,467 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84
[2025-02-07 23:13:23,468 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:23,469 INFO  L225             Difference]: With dead ends: 465
[2025-02-07 23:13:23,469 INFO  L226             Difference]: Without dead ends: 318
[2025-02-07 23:13:23,470 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2025-02-07 23:13:23,470 INFO  L435           NwaCegarLoop]: 163 mSDtfsCounter, 187 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:23,472 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1134 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-07 23:13:23,473 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 318 states.
[2025-02-07 23:13:23,482 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 198.
[2025-02-07 23:13:23,483 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 198 states, 197 states have (on average 1.4263959390862944) internal successors, (281), 197 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:23,484 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 281 transitions.
[2025-02-07 23:13:23,485 INFO  L78                 Accepts]: Start accepts. Automaton has 198 states and 281 transitions. Word has length 84
[2025-02-07 23:13:23,486 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:23,486 INFO  L471      AbstractCegarLoop]: Abstraction has 198 states and 281 transitions.
[2025-02-07 23:13:23,486 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:23,486 INFO  L276                IsEmpty]: Start isEmpty. Operand 198 states and 281 transitions.
[2025-02-07 23:13:23,487 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2025-02-07 23:13:23,488 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:23,488 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:23,488 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-07 23:13:23,488 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:23,488 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:23,489 INFO  L85        PathProgramCache]: Analyzing trace with hash -280803274, now seen corresponding path program 1 times
[2025-02-07 23:13:23,489 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:23,489 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232602631]
[2025-02-07 23:13:23,489 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:23,489 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:23,520 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes.
[2025-02-07 23:13:23,616 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements.
[2025-02-07 23:13:23,617 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:23,617 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:24,336 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:24,337 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:24,337 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232602631]
[2025-02-07 23:13:24,337 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232602631] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:24,338 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:24,338 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-02-07 23:13:24,338 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764403204]
[2025-02-07 23:13:24,338 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:24,338 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-02-07 23:13:24,338 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:24,339 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-02-07 23:13:24,339 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110
[2025-02-07 23:13:24,340 INFO  L87              Difference]: Start difference. First operand 198 states and 281 transitions. Second operand  has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:24,678 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:24,678 INFO  L93              Difference]: Finished difference Result 371 states and 532 transitions.
[2025-02-07 23:13:24,678 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-02-07 23:13:24,679 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84
[2025-02-07 23:13:24,679 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:24,681 INFO  L225             Difference]: With dead ends: 371
[2025-02-07 23:13:24,681 INFO  L226             Difference]: Without dead ends: 211
[2025-02-07 23:13:24,681 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110
[2025-02-07 23:13:24,682 INFO  L435           NwaCegarLoop]: 172 mSDtfsCounter, 6 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:24,682 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1531 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-07 23:13:24,682 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 211 states.
[2025-02-07 23:13:24,687 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209.
[2025-02-07 23:13:24,688 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 209 states, 208 states have (on average 1.4230769230769231) internal successors, (296), 208 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:24,689 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 296 transitions.
[2025-02-07 23:13:24,689 INFO  L78                 Accepts]: Start accepts. Automaton has 209 states and 296 transitions. Word has length 84
[2025-02-07 23:13:24,689 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:24,689 INFO  L471      AbstractCegarLoop]: Abstraction has 209 states and 296 transitions.
[2025-02-07 23:13:24,690 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:24,690 INFO  L276                IsEmpty]: Start isEmpty. Operand 209 states and 296 transitions.
[2025-02-07 23:13:24,691 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2025-02-07 23:13:24,691 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:24,692 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:24,692 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-07 23:13:24,692 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:24,693 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:24,693 INFO  L85        PathProgramCache]: Analyzing trace with hash -666289682, now seen corresponding path program 1 times
[2025-02-07 23:13:24,693 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:24,693 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29877004]
[2025-02-07 23:13:24,693 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:24,693 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:24,721 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes.
[2025-02-07 23:13:24,814 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements.
[2025-02-07 23:13:24,815 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:24,815 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:25,379 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:25,380 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:25,380 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29877004]
[2025-02-07 23:13:25,380 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29877004] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:25,380 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:25,380 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:13:25,380 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836743309]
[2025-02-07 23:13:25,380 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:25,380 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 23:13:25,380 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:25,381 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 23:13:25,381 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:13:25,381 INFO  L87              Difference]: Start difference. First operand 209 states and 296 transitions. Second operand  has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:25,466 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:25,467 INFO  L93              Difference]: Finished difference Result 379 states and 540 transitions.
[2025-02-07 23:13:25,467 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:13:25,467 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84
[2025-02-07 23:13:25,467 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:25,468 INFO  L225             Difference]: With dead ends: 379
[2025-02-07 23:13:25,468 INFO  L226             Difference]: Without dead ends: 199
[2025-02-07 23:13:25,469 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:13:25,469 INFO  L435           NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:25,469 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 367 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-07 23:13:25,470 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 199 states.
[2025-02-07 23:13:25,476 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199.
[2025-02-07 23:13:25,480 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 199 states, 198 states have (on average 1.4141414141414141) internal successors, (280), 198 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:25,481 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 280 transitions.
[2025-02-07 23:13:25,481 INFO  L78                 Accepts]: Start accepts. Automaton has 199 states and 280 transitions. Word has length 84
[2025-02-07 23:13:25,481 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:25,481 INFO  L471      AbstractCegarLoop]: Abstraction has 199 states and 280 transitions.
[2025-02-07 23:13:25,481 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:25,481 INFO  L276                IsEmpty]: Start isEmpty. Operand 199 states and 280 transitions.
[2025-02-07 23:13:25,482 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2025-02-07 23:13:25,482 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:25,482 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:25,482 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-07 23:13:25,482 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:25,483 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:25,483 INFO  L85        PathProgramCache]: Analyzing trace with hash -868735207, now seen corresponding path program 1 times
[2025-02-07 23:13:25,483 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:25,483 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024711588]
[2025-02-07 23:13:25,483 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:25,483 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:25,515 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes.
[2025-02-07 23:13:25,633 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements.
[2025-02-07 23:13:25,633 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:25,633 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:26,374 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:26,375 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:26,375 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024711588]
[2025-02-07 23:13:26,375 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024711588] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:26,375 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:26,375 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-02-07 23:13:26,375 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165131892]
[2025-02-07 23:13:26,375 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:26,376 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-02-07 23:13:26,376 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:26,377 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-02-07 23:13:26,377 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182
[2025-02-07 23:13:26,377 INFO  L87              Difference]: Start difference. First operand 199 states and 280 transitions. Second operand  has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:26,863 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:26,864 INFO  L93              Difference]: Finished difference Result 368 states and 525 transitions.
[2025-02-07 23:13:26,864 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-02-07 23:13:26,864 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85
[2025-02-07 23:13:26,864 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:26,865 INFO  L225             Difference]: With dead ends: 368
[2025-02-07 23:13:26,865 INFO  L226             Difference]: Without dead ends: 212
[2025-02-07 23:13:26,866 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182
[2025-02-07 23:13:26,867 INFO  L435           NwaCegarLoop]: 165 mSDtfsCounter, 9 mSDsluCounter, 1954 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2119 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:26,867 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2119 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-07 23:13:26,868 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 212 states.
[2025-02-07 23:13:26,872 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210.
[2025-02-07 23:13:26,873 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 210 states, 209 states have (on average 1.4114832535885167) internal successors, (295), 209 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:26,874 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 295 transitions.
[2025-02-07 23:13:26,874 INFO  L78                 Accepts]: Start accepts. Automaton has 210 states and 295 transitions. Word has length 85
[2025-02-07 23:13:26,874 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:26,874 INFO  L471      AbstractCegarLoop]: Abstraction has 210 states and 295 transitions.
[2025-02-07 23:13:26,874 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:26,875 INFO  L276                IsEmpty]: Start isEmpty. Operand 210 states and 295 transitions.
[2025-02-07 23:13:26,876 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2025-02-07 23:13:26,876 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:26,876 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:26,877 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-07 23:13:26,877 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:26,877 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:26,877 INFO  L85        PathProgramCache]: Analyzing trace with hash 810839028, now seen corresponding path program 1 times
[2025-02-07 23:13:26,877 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:26,877 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944122592]
[2025-02-07 23:13:26,877 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:26,877 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:26,902 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes.
[2025-02-07 23:13:27,040 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements.
[2025-02-07 23:13:27,040 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:27,040 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:27,576 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:27,576 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:27,576 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944122592]
[2025-02-07 23:13:27,577 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944122592] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:27,577 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:27,577 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-07 23:13:27,577 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364785377]
[2025-02-07 23:13:27,577 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:27,577 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-07 23:13:27,577 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:27,578 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-07 23:13:27,578 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-02-07 23:13:27,578 INFO  L87              Difference]: Start difference. First operand 210 states and 295 transitions. Second operand  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:27,931 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:27,931 INFO  L93              Difference]: Finished difference Result 501 states and 715 transitions.
[2025-02-07 23:13:27,932 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-07 23:13:27,932 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85
[2025-02-07 23:13:27,933 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:27,934 INFO  L225             Difference]: With dead ends: 501
[2025-02-07 23:13:27,934 INFO  L226             Difference]: Without dead ends: 335
[2025-02-07 23:13:27,935 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2025-02-07 23:13:27,937 INFO  L435           NwaCegarLoop]: 162 mSDtfsCounter, 176 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:27,938 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 1097 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-07 23:13:27,939 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 335 states.
[2025-02-07 23:13:27,948 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 223.
[2025-02-07 23:13:27,950 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 223 states, 222 states have (on average 1.40990990990991) internal successors, (313), 222 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:27,951 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 313 transitions.
[2025-02-07 23:13:27,951 INFO  L78                 Accepts]: Start accepts. Automaton has 223 states and 313 transitions. Word has length 85
[2025-02-07 23:13:27,951 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:27,952 INFO  L471      AbstractCegarLoop]: Abstraction has 223 states and 313 transitions.
[2025-02-07 23:13:27,952 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:27,952 INFO  L276                IsEmpty]: Start isEmpty. Operand 223 states and 313 transitions.
[2025-02-07 23:13:27,953 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2025-02-07 23:13:27,953 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:27,953 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:27,953 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-07 23:13:27,953 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:27,954 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:27,954 INFO  L85        PathProgramCache]: Analyzing trace with hash 1822726188, now seen corresponding path program 1 times
[2025-02-07 23:13:27,954 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:27,954 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300157668]
[2025-02-07 23:13:27,954 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:27,954 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:27,982 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes.
[2025-02-07 23:13:28,064 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements.
[2025-02-07 23:13:28,064 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:28,064 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:28,694 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:28,695 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:28,695 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300157668]
[2025-02-07 23:13:28,695 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300157668] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:28,695 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:28,695 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-07 23:13:28,695 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383302261]
[2025-02-07 23:13:28,695 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:28,696 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-07 23:13:28,696 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:28,696 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-07 23:13:28,696 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-02-07 23:13:28,697 INFO  L87              Difference]: Start difference. First operand 223 states and 313 transitions. Second operand  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:28,888 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:28,888 INFO  L93              Difference]: Finished difference Result 411 states and 584 transitions.
[2025-02-07 23:13:28,888 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-07 23:13:28,889 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85
[2025-02-07 23:13:28,889 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:28,890 INFO  L225             Difference]: With dead ends: 411
[2025-02-07 23:13:28,890 INFO  L226             Difference]: Without dead ends: 233
[2025-02-07 23:13:28,890 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-02-07 23:13:28,891 INFO  L435           NwaCegarLoop]: 181 mSDtfsCounter, 3 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:28,891 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1065 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 23:13:28,891 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 233 states.
[2025-02-07 23:13:28,895 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231.
[2025-02-07 23:13:28,895 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 231 states, 230 states have (on average 1.4043478260869566) internal successors, (323), 230 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:28,896 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 323 transitions.
[2025-02-07 23:13:28,896 INFO  L78                 Accepts]: Start accepts. Automaton has 231 states and 323 transitions. Word has length 85
[2025-02-07 23:13:28,897 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:28,897 INFO  L471      AbstractCegarLoop]: Abstraction has 231 states and 323 transitions.
[2025-02-07 23:13:28,897 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:28,897 INFO  L276                IsEmpty]: Start isEmpty. Operand 231 states and 323 transitions.
[2025-02-07 23:13:28,897 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2025-02-07 23:13:28,898 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:28,898 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:28,898 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-07 23:13:28,898 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:28,898 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:28,898 INFO  L85        PathProgramCache]: Analyzing trace with hash -1732892061, now seen corresponding path program 1 times
[2025-02-07 23:13:28,898 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:28,898 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209892819]
[2025-02-07 23:13:28,899 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:28,899 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:28,923 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes.
[2025-02-07 23:13:29,055 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements.
[2025-02-07 23:13:29,056 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:29,056 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:29,817 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:29,817 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:29,818 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209892819]
[2025-02-07 23:13:29,819 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209892819] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:29,819 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:29,819 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-07 23:13:29,819 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810560826]
[2025-02-07 23:13:29,819 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:29,819 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-07 23:13:29,819 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:29,820 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-07 23:13:29,820 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-02-07 23:13:29,820 INFO  L87              Difference]: Start difference. First operand 231 states and 323 transitions. Second operand  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:30,179 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:30,179 INFO  L93              Difference]: Finished difference Result 522 states and 742 transitions.
[2025-02-07 23:13:30,180 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-07 23:13:30,180 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86
[2025-02-07 23:13:30,180 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:30,182 INFO  L225             Difference]: With dead ends: 522
[2025-02-07 23:13:30,182 INFO  L226             Difference]: Without dead ends: 348
[2025-02-07 23:13:30,182 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2025-02-07 23:13:30,183 INFO  L435           NwaCegarLoop]: 162 mSDtfsCounter, 170 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:30,183 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 1065 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-07 23:13:30,185 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 348 states.
[2025-02-07 23:13:30,191 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 244.
[2025-02-07 23:13:30,191 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 244 states, 243 states have (on average 1.4032921810699588) internal successors, (341), 243 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:30,192 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 341 transitions.
[2025-02-07 23:13:30,193 INFO  L78                 Accepts]: Start accepts. Automaton has 244 states and 341 transitions. Word has length 86
[2025-02-07 23:13:30,193 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:30,193 INFO  L471      AbstractCegarLoop]: Abstraction has 244 states and 341 transitions.
[2025-02-07 23:13:30,193 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:30,193 INFO  L276                IsEmpty]: Start isEmpty. Operand 244 states and 341 transitions.
[2025-02-07 23:13:30,194 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2025-02-07 23:13:30,194 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:30,194 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:30,194 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-07 23:13:30,195 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:30,195 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:30,195 INFO  L85        PathProgramCache]: Analyzing trace with hash 1790765645, now seen corresponding path program 1 times
[2025-02-07 23:13:30,196 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:30,196 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734604893]
[2025-02-07 23:13:30,196 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:30,196 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:30,225 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes.
[2025-02-07 23:13:30,431 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements.
[2025-02-07 23:13:30,431 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:30,431 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:31,237 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:31,237 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:31,237 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734604893]
[2025-02-07 23:13:31,237 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734604893] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:31,237 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:31,237 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2025-02-07 23:13:31,237 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741311205]
[2025-02-07 23:13:31,237 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:31,238 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2025-02-07 23:13:31,238 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:31,238 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2025-02-07 23:13:31,238 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272
[2025-02-07 23:13:31,239 INFO  L87              Difference]: Start difference. First operand 244 states and 341 transitions. Second operand  has 17 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:31,849 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:31,849 INFO  L93              Difference]: Finished difference Result 451 states and 639 transitions.
[2025-02-07 23:13:31,849 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2025-02-07 23:13:31,849 INFO  L78                 Accepts]: Start accepts. Automaton has  has 17 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86
[2025-02-07 23:13:31,850 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:31,851 INFO  L225             Difference]: With dead ends: 451
[2025-02-07 23:13:31,851 INFO  L226             Difference]: Without dead ends: 264
[2025-02-07 23:13:31,852 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272
[2025-02-07 23:13:31,853 INFO  L435           NwaCegarLoop]: 159 mSDtfsCounter, 14 mSDsluCounter, 2199 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2358 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:31,853 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2358 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-07 23:13:31,854 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 264 states.
[2025-02-07 23:13:31,859 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262.
[2025-02-07 23:13:31,859 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 262 states, 261 states have (on average 1.4022988505747127) internal successors, (366), 261 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:31,861 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 366 transitions.
[2025-02-07 23:13:31,861 INFO  L78                 Accepts]: Start accepts. Automaton has 262 states and 366 transitions. Word has length 86
[2025-02-07 23:13:31,862 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:31,862 INFO  L471      AbstractCegarLoop]: Abstraction has 262 states and 366 transitions.
[2025-02-07 23:13:31,862 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:31,863 INFO  L276                IsEmpty]: Start isEmpty. Operand 262 states and 366 transitions.
[2025-02-07 23:13:31,864 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2025-02-07 23:13:31,864 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:31,865 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:31,865 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-02-07 23:13:31,865 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:31,865 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:31,866 INFO  L85        PathProgramCache]: Analyzing trace with hash 882466720, now seen corresponding path program 1 times
[2025-02-07 23:13:31,866 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:31,866 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877402002]
[2025-02-07 23:13:31,866 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:31,866 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:31,896 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes.
[2025-02-07 23:13:31,974 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements.
[2025-02-07 23:13:31,974 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:31,974 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:32,355 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:32,356 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:32,356 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877402002]
[2025-02-07 23:13:32,356 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877402002] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:32,356 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:32,356 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:13:32,356 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99208231]
[2025-02-07 23:13:32,356 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:32,356 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 23:13:32,356 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:32,356 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 23:13:32,357 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:13:32,357 INFO  L87              Difference]: Start difference. First operand 262 states and 366 transitions. Second operand  has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:32,426 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:32,427 INFO  L93              Difference]: Finished difference Result 471 states and 665 transitions.
[2025-02-07 23:13:32,427 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:13:32,427 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86
[2025-02-07 23:13:32,427 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:32,428 INFO  L225             Difference]: With dead ends: 471
[2025-02-07 23:13:32,428 INFO  L226             Difference]: Without dead ends: 259
[2025-02-07 23:13:32,429 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:13:32,429 INFO  L435           NwaCegarLoop]: 184 mSDtfsCounter, 0 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:32,429 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 365 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-07 23:13:32,430 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 259 states.
[2025-02-07 23:13:32,435 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259.
[2025-02-07 23:13:32,435 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 259 states, 258 states have (on average 1.3953488372093024) internal successors, (360), 258 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:32,436 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 360 transitions.
[2025-02-07 23:13:32,437 INFO  L78                 Accepts]: Start accepts. Automaton has 259 states and 360 transitions. Word has length 86
[2025-02-07 23:13:32,438 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:32,438 INFO  L471      AbstractCegarLoop]: Abstraction has 259 states and 360 transitions.
[2025-02-07 23:13:32,439 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:32,439 INFO  L276                IsEmpty]: Start isEmpty. Operand 259 states and 360 transitions.
[2025-02-07 23:13:32,439 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2025-02-07 23:13:32,439 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:32,440 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:32,440 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-02-07 23:13:32,440 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:32,440 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:32,440 INFO  L85        PathProgramCache]: Analyzing trace with hash 1650917406, now seen corresponding path program 1 times
[2025-02-07 23:13:32,440 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:32,440 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070084155]
[2025-02-07 23:13:32,441 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:32,441 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:32,473 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes.
[2025-02-07 23:13:32,591 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements.
[2025-02-07 23:13:32,591 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:32,591 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:33,063 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:33,064 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:33,064 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070084155]
[2025-02-07 23:13:33,064 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070084155] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:33,064 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:33,064 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-07 23:13:33,064 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75638323]
[2025-02-07 23:13:33,064 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:33,065 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-02-07 23:13:33,065 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:33,065 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-02-07 23:13:33,066 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2025-02-07 23:13:33,066 INFO  L87              Difference]: Start difference. First operand 259 states and 360 transitions. Second operand  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:33,425 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:33,426 INFO  L93              Difference]: Finished difference Result 556 states and 786 transitions.
[2025-02-07 23:13:33,426 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-02-07 23:13:33,426 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87
[2025-02-07 23:13:33,426 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:33,428 INFO  L225             Difference]: With dead ends: 556
[2025-02-07 23:13:33,428 INFO  L226             Difference]: Without dead ends: 368
[2025-02-07 23:13:33,428 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132
[2025-02-07 23:13:33,429 INFO  L435           NwaCegarLoop]: 160 mSDtfsCounter, 531 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:33,429 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 1085 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-07 23:13:33,430 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 368 states.
[2025-02-07 23:13:33,434 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 272.
[2025-02-07 23:13:33,435 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 272 states, 271 states have (on average 1.3948339483394834) internal successors, (378), 271 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:33,436 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 378 transitions.
[2025-02-07 23:13:33,436 INFO  L78                 Accepts]: Start accepts. Automaton has 272 states and 378 transitions. Word has length 87
[2025-02-07 23:13:33,436 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:33,436 INFO  L471      AbstractCegarLoop]: Abstraction has 272 states and 378 transitions.
[2025-02-07 23:13:33,436 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:33,436 INFO  L276                IsEmpty]: Start isEmpty. Operand 272 states and 378 transitions.
[2025-02-07 23:13:33,437 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2025-02-07 23:13:33,437 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:33,437 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:33,437 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-02-07 23:13:33,437 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:33,437 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:33,438 INFO  L85        PathProgramCache]: Analyzing trace with hash 1183177165, now seen corresponding path program 1 times
[2025-02-07 23:13:33,438 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:33,438 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899591555]
[2025-02-07 23:13:33,438 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:33,438 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:33,463 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes.
[2025-02-07 23:13:33,665 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements.
[2025-02-07 23:13:33,665 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:33,666 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:34,687 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:34,687 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:34,687 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899591555]
[2025-02-07 23:13:34,687 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899591555] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:34,687 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:34,687 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2025-02-07 23:13:34,687 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089409379]
[2025-02-07 23:13:34,687 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:34,688 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2025-02-07 23:13:34,688 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:34,688 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2025-02-07 23:13:34,688 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380
[2025-02-07 23:13:34,689 INFO  L87              Difference]: Start difference. First operand 272 states and 378 transitions. Second operand  has 20 states, 20 states have (on average 4.35) internal successors, (87), 20 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:35,508 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:35,508 INFO  L93              Difference]: Finished difference Result 547 states and 772 transitions.
[2025-02-07 23:13:35,509 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2025-02-07 23:13:35,509 INFO  L78                 Accepts]: Start accepts. Automaton has  has 20 states, 20 states have (on average 4.35) internal successors, (87), 20 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87
[2025-02-07 23:13:35,509 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:35,510 INFO  L225             Difference]: With dead ends: 547
[2025-02-07 23:13:35,511 INFO  L226             Difference]: Without dead ends: 346
[2025-02-07 23:13:35,511 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380
[2025-02-07 23:13:35,512 INFO  L435           NwaCegarLoop]: 154 mSDtfsCounter, 16 mSDsluCounter, 2734 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2888 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:35,512 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2888 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-07 23:13:35,512 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 346 states.
[2025-02-07 23:13:35,517 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 344.
[2025-02-07 23:13:35,518 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 344 states, 343 states have (on average 1.3994169096209912) internal successors, (480), 343 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:35,519 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 480 transitions.
[2025-02-07 23:13:35,520 INFO  L78                 Accepts]: Start accepts. Automaton has 344 states and 480 transitions. Word has length 87
[2025-02-07 23:13:35,520 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:35,520 INFO  L471      AbstractCegarLoop]: Abstraction has 344 states and 480 transitions.
[2025-02-07 23:13:35,520 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 20 states have (on average 4.35) internal successors, (87), 20 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:35,520 INFO  L276                IsEmpty]: Start isEmpty. Operand 344 states and 480 transitions.
[2025-02-07 23:13:35,521 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2025-02-07 23:13:35,521 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:35,521 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:35,521 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-02-07 23:13:35,522 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:35,522 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:35,522 INFO  L85        PathProgramCache]: Analyzing trace with hash -998392099, now seen corresponding path program 1 times
[2025-02-07 23:13:35,522 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:35,523 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435407287]
[2025-02-07 23:13:35,523 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:35,523 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:35,549 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes.
[2025-02-07 23:13:35,617 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements.
[2025-02-07 23:13:35,618 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:35,618 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:36,154 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:36,154 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:36,154 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435407287]
[2025-02-07 23:13:36,154 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435407287] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:36,154 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:36,154 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-07 23:13:36,154 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559661209]
[2025-02-07 23:13:36,155 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:36,156 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-07 23:13:36,156 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:36,156 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-07 23:13:36,156 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-02-07 23:13:36,157 INFO  L87              Difference]: Start difference. First operand 344 states and 480 transitions. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:36,343 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:36,344 INFO  L93              Difference]: Finished difference Result 628 states and 886 transitions.
[2025-02-07 23:13:36,344 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-07 23:13:36,344 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87
[2025-02-07 23:13:36,344 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:36,346 INFO  L225             Difference]: With dead ends: 628
[2025-02-07 23:13:36,346 INFO  L226             Difference]: Without dead ends: 359
[2025-02-07 23:13:36,346 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-02-07 23:13:36,348 INFO  L435           NwaCegarLoop]: 180 mSDtfsCounter, 3 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:36,348 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1059 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 23:13:36,350 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 359 states.
[2025-02-07 23:13:36,356 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 355.
[2025-02-07 23:13:36,357 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 355 states, 354 states have (on average 1.3954802259887005) internal successors, (494), 354 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:36,358 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 494 transitions.
[2025-02-07 23:13:36,358 INFO  L78                 Accepts]: Start accepts. Automaton has 355 states and 494 transitions. Word has length 87
[2025-02-07 23:13:36,359 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:36,359 INFO  L471      AbstractCegarLoop]: Abstraction has 355 states and 494 transitions.
[2025-02-07 23:13:36,359 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:36,360 INFO  L276                IsEmpty]: Start isEmpty. Operand 355 states and 494 transitions.
[2025-02-07 23:13:36,360 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2025-02-07 23:13:36,360 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:36,360 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:36,360 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-02-07 23:13:36,360 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:36,361 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:36,361 INFO  L85        PathProgramCache]: Analyzing trace with hash -1544217349, now seen corresponding path program 1 times
[2025-02-07 23:13:36,361 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:36,361 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722074607]
[2025-02-07 23:13:36,361 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:36,361 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:36,384 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes.
[2025-02-07 23:13:36,447 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements.
[2025-02-07 23:13:36,448 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:36,448 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:36,783 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:36,783 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:36,784 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722074607]
[2025-02-07 23:13:36,784 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722074607] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:36,784 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:36,784 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:13:36,784 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357010697]
[2025-02-07 23:13:36,784 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:36,785 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 23:13:36,785 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:36,785 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 23:13:36,785 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:13:36,786 INFO  L87              Difference]: Start difference. First operand 355 states and 494 transitions. Second operand  has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:36,854 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:36,854 INFO  L93              Difference]: Finished difference Result 645 states and 905 transitions.
[2025-02-07 23:13:36,858 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:13:36,858 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87
[2025-02-07 23:13:36,858 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:36,860 INFO  L225             Difference]: With dead ends: 645
[2025-02-07 23:13:36,860 INFO  L226             Difference]: Without dead ends: 324
[2025-02-07 23:13:36,860 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:13:36,864 INFO  L435           NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:36,864 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 363 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-07 23:13:36,865 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 324 states.
[2025-02-07 23:13:36,870 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324.
[2025-02-07 23:13:36,871 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 324 states, 323 states have (on average 1.3777089783281733) internal successors, (445), 323 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:36,872 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 445 transitions.
[2025-02-07 23:13:36,872 INFO  L78                 Accepts]: Start accepts. Automaton has 324 states and 445 transitions. Word has length 87
[2025-02-07 23:13:36,873 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:36,873 INFO  L471      AbstractCegarLoop]: Abstraction has 324 states and 445 transitions.
[2025-02-07 23:13:36,873 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:36,873 INFO  L276                IsEmpty]: Start isEmpty. Operand 324 states and 445 transitions.
[2025-02-07 23:13:36,874 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2025-02-07 23:13:36,874 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:36,874 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:36,874 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-02-07 23:13:36,874 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:36,875 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:36,875 INFO  L85        PathProgramCache]: Analyzing trace with hash -238134003, now seen corresponding path program 1 times
[2025-02-07 23:13:36,875 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:36,876 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766102259]
[2025-02-07 23:13:36,876 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:36,876 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:36,900 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes.
[2025-02-07 23:13:37,025 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements.
[2025-02-07 23:13:37,026 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:37,026 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:37,493 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:37,494 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:37,494 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766102259]
[2025-02-07 23:13:37,494 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766102259] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:37,494 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:37,494 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-07 23:13:37,495 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537557897]
[2025-02-07 23:13:37,495 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:37,495 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-07 23:13:37,495 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:37,496 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-07 23:13:37,496 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-02-07 23:13:37,496 INFO  L87              Difference]: Start difference. First operand 324 states and 445 transitions. Second operand  has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:37,783 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:37,783 INFO  L93              Difference]: Finished difference Result 682 states and 952 transitions.
[2025-02-07 23:13:37,783 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-07 23:13:37,784 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88
[2025-02-07 23:13:37,784 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:37,785 INFO  L225             Difference]: With dead ends: 682
[2025-02-07 23:13:37,785 INFO  L226             Difference]: Without dead ends: 425
[2025-02-07 23:13:37,786 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2025-02-07 23:13:37,786 INFO  L435           NwaCegarLoop]: 160 mSDtfsCounter, 145 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:37,787 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1113 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 23:13:37,787 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 425 states.
[2025-02-07 23:13:37,793 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 337.
[2025-02-07 23:13:37,793 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 337 states, 336 states have (on average 1.3779761904761905) internal successors, (463), 336 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:37,794 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 463 transitions.
[2025-02-07 23:13:37,795 INFO  L78                 Accepts]: Start accepts. Automaton has 337 states and 463 transitions. Word has length 88
[2025-02-07 23:13:37,795 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:37,795 INFO  L471      AbstractCegarLoop]: Abstraction has 337 states and 463 transitions.
[2025-02-07 23:13:37,795 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:37,795 INFO  L276                IsEmpty]: Start isEmpty. Operand 337 states and 463 transitions.
[2025-02-07 23:13:37,796 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2025-02-07 23:13:37,796 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:37,796 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:37,796 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-02-07 23:13:37,796 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:37,797 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:37,797 INFO  L85        PathProgramCache]: Analyzing trace with hash -503860546, now seen corresponding path program 1 times
[2025-02-07 23:13:37,797 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:37,797 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416635849]
[2025-02-07 23:13:37,797 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:37,797 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:37,819 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes.
[2025-02-07 23:13:38,036 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements.
[2025-02-07 23:13:38,037 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:38,037 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:39,090 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:39,091 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:39,091 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416635849]
[2025-02-07 23:13:39,091 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416635849] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:39,091 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:39,091 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23
[2025-02-07 23:13:39,091 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491377387]
[2025-02-07 23:13:39,091 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:39,092 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2025-02-07 23:13:39,092 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:39,092 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2025-02-07 23:13:39,093 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506
[2025-02-07 23:13:39,093 INFO  L87              Difference]: Start difference. First operand 337 states and 463 transitions. Second operand  has 23 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 23 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:39,890 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:39,890 INFO  L93              Difference]: Finished difference Result 648 states and 903 transitions.
[2025-02-07 23:13:39,890 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2025-02-07 23:13:39,890 INFO  L78                 Accepts]: Start accepts. Automaton has  has 23 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 23 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88
[2025-02-07 23:13:39,890 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:39,892 INFO  L225             Difference]: With dead ends: 648
[2025-02-07 23:13:39,892 INFO  L226             Difference]: Without dead ends: 378
[2025-02-07 23:13:39,893 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506
[2025-02-07 23:13:39,893 INFO  L435           NwaCegarLoop]: 145 mSDtfsCounter, 20 mSDsluCounter, 2863 mSDsCounter, 0 mSdLazyCounter, 1584 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3008 SdHoareTripleChecker+Invalid, 1599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:39,893 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3008 Invalid, 1599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1584 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-07 23:13:39,894 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 378 states.
[2025-02-07 23:13:39,901 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 376.
[2025-02-07 23:13:39,901 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 376 states, 375 states have (on average 1.3813333333333333) internal successors, (518), 375 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:39,903 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 518 transitions.
[2025-02-07 23:13:39,903 INFO  L78                 Accepts]: Start accepts. Automaton has 376 states and 518 transitions. Word has length 88
[2025-02-07 23:13:39,903 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:39,903 INFO  L471      AbstractCegarLoop]: Abstraction has 376 states and 518 transitions.
[2025-02-07 23:13:39,903 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 23 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 23 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:39,903 INFO  L276                IsEmpty]: Start isEmpty. Operand 376 states and 518 transitions.
[2025-02-07 23:13:39,904 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2025-02-07 23:13:39,904 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:39,904 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:39,905 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-02-07 23:13:39,905 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:39,905 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:39,905 INFO  L85        PathProgramCache]: Analyzing trace with hash 534274932, now seen corresponding path program 1 times
[2025-02-07 23:13:39,906 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:39,906 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595068570]
[2025-02-07 23:13:39,906 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:39,906 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:39,934 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes.
[2025-02-07 23:13:40,000 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements.
[2025-02-07 23:13:40,000 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:40,000 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:40,384 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:40,385 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:40,385 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595068570]
[2025-02-07 23:13:40,385 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595068570] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:40,385 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:40,386 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:13:40,386 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813880728]
[2025-02-07 23:13:40,386 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:40,386 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 23:13:40,386 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:40,387 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 23:13:40,387 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:13:40,388 INFO  L87              Difference]: Start difference. First operand 376 states and 518 transitions. Second operand  has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:40,452 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:40,452 INFO  L93              Difference]: Finished difference Result 689 states and 959 transitions.
[2025-02-07 23:13:40,452 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:13:40,453 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88
[2025-02-07 23:13:40,453 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:40,454 INFO  L225             Difference]: With dead ends: 689
[2025-02-07 23:13:40,454 INFO  L226             Difference]: Without dead ends: 373
[2025-02-07 23:13:40,455 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:13:40,455 INFO  L435           NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:40,456 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 361 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-07 23:13:40,456 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 373 states.
[2025-02-07 23:13:40,462 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373.
[2025-02-07 23:13:40,463 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 373 states, 372 states have (on average 1.3763440860215055) internal successors, (512), 372 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:40,464 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 512 transitions.
[2025-02-07 23:13:40,464 INFO  L78                 Accepts]: Start accepts. Automaton has 373 states and 512 transitions. Word has length 88
[2025-02-07 23:13:40,464 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:40,465 INFO  L471      AbstractCegarLoop]: Abstraction has 373 states and 512 transitions.
[2025-02-07 23:13:40,468 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:40,469 INFO  L276                IsEmpty]: Start isEmpty. Operand 373 states and 512 transitions.
[2025-02-07 23:13:40,469 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 90
[2025-02-07 23:13:40,469 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:40,469 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:40,469 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2025-02-07 23:13:40,470 INFO  L396      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:40,470 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:40,470 INFO  L85        PathProgramCache]: Analyzing trace with hash -1986237260, now seen corresponding path program 1 times
[2025-02-07 23:13:40,470 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:40,470 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63056825]
[2025-02-07 23:13:40,470 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:40,470 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:40,495 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes.
[2025-02-07 23:13:40,588 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements.
[2025-02-07 23:13:40,589 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:40,589 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:41,062 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:41,063 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:41,063 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63056825]
[2025-02-07 23:13:41,063 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63056825] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:41,063 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:41,063 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-07 23:13:41,063 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559124770]
[2025-02-07 23:13:41,063 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:41,064 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-07 23:13:41,064 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:41,064 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-07 23:13:41,065 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-02-07 23:13:41,066 INFO  L87              Difference]: Start difference. First operand 373 states and 512 transitions. Second operand  has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:41,246 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:41,246 INFO  L93              Difference]: Finished difference Result 677 states and 941 transitions.
[2025-02-07 23:13:41,246 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-07 23:13:41,247 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89
[2025-02-07 23:13:41,247 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:41,248 INFO  L225             Difference]: With dead ends: 677
[2025-02-07 23:13:41,248 INFO  L226             Difference]: Without dead ends: 385
[2025-02-07 23:13:41,249 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-02-07 23:13:41,249 INFO  L435           NwaCegarLoop]: 179 mSDtfsCounter, 3 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:41,250 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1052 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 23:13:41,251 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 385 states.
[2025-02-07 23:13:41,258 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 380.
[2025-02-07 23:13:41,259 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 380 states, 379 states have (on average 1.3746701846965699) internal successors, (521), 379 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:41,260 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 521 transitions.
[2025-02-07 23:13:41,260 INFO  L78                 Accepts]: Start accepts. Automaton has 380 states and 521 transitions. Word has length 89
[2025-02-07 23:13:41,260 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:41,260 INFO  L471      AbstractCegarLoop]: Abstraction has 380 states and 521 transitions.
[2025-02-07 23:13:41,261 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:41,261 INFO  L276                IsEmpty]: Start isEmpty. Operand 380 states and 521 transitions.
[2025-02-07 23:13:41,261 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 90
[2025-02-07 23:13:41,261 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:41,261 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:41,262 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2025-02-07 23:13:41,262 INFO  L396      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:41,263 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:41,263 INFO  L85        PathProgramCache]: Analyzing trace with hash 1863667272, now seen corresponding path program 1 times
[2025-02-07 23:13:41,263 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:41,263 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701046380]
[2025-02-07 23:13:41,263 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:41,263 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:41,286 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes.
[2025-02-07 23:13:41,455 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements.
[2025-02-07 23:13:41,456 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:41,456 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:41,928 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:41,929 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:41,929 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701046380]
[2025-02-07 23:13:41,929 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701046380] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:41,929 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:41,929 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-07 23:13:41,929 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582895245]
[2025-02-07 23:13:41,929 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:41,929 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-07 23:13:41,929 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:41,930 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-07 23:13:41,930 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-02-07 23:13:41,930 INFO  L87              Difference]: Start difference. First operand 380 states and 521 transitions. Second operand  has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:42,183 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:42,183 INFO  L93              Difference]: Finished difference Result 771 states and 1073 transitions.
[2025-02-07 23:13:42,184 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-07 23:13:42,184 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89
[2025-02-07 23:13:42,184 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:42,185 INFO  L225             Difference]: With dead ends: 771
[2025-02-07 23:13:42,185 INFO  L226             Difference]: Without dead ends: 473
[2025-02-07 23:13:42,186 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2025-02-07 23:13:42,186 INFO  L435           NwaCegarLoop]: 159 mSDtfsCounter, 139 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:42,186 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1028 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 23:13:42,187 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 473 states.
[2025-02-07 23:13:42,192 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 393.
[2025-02-07 23:13:42,193 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 393 states, 392 states have (on average 1.375) internal successors, (539), 392 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:42,194 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 539 transitions.
[2025-02-07 23:13:42,194 INFO  L78                 Accepts]: Start accepts. Automaton has 393 states and 539 transitions. Word has length 89
[2025-02-07 23:13:42,194 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:42,194 INFO  L471      AbstractCegarLoop]: Abstraction has 393 states and 539 transitions.
[2025-02-07 23:13:42,195 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:42,195 INFO  L276                IsEmpty]: Start isEmpty. Operand 393 states and 539 transitions.
[2025-02-07 23:13:42,195 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 90
[2025-02-07 23:13:42,195 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:42,196 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:42,196 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2025-02-07 23:13:42,196 INFO  L396      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:42,196 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:42,196 INFO  L85        PathProgramCache]: Analyzing trace with hash -589176478, now seen corresponding path program 1 times
[2025-02-07 23:13:42,196 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:42,197 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342036832]
[2025-02-07 23:13:42,197 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:42,197 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:42,220 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes.
[2025-02-07 23:13:42,403 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements.
[2025-02-07 23:13:42,403 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:42,403 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:43,825 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:43,826 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:43,826 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342036832]
[2025-02-07 23:13:43,826 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342036832] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:43,826 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:43,826 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28
[2025-02-07 23:13:43,827 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103136618]
[2025-02-07 23:13:43,827 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:43,828 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2025-02-07 23:13:43,828 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:43,828 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2025-02-07 23:13:43,829 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756
[2025-02-07 23:13:43,829 INFO  L87              Difference]: Start difference. First operand 393 states and 539 transitions. Second operand  has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:44,939 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:44,939 INFO  L93              Difference]: Finished difference Result 762 states and 1060 transitions.
[2025-02-07 23:13:44,939 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. 
[2025-02-07 23:13:44,940 INFO  L78                 Accepts]: Start accepts. Automaton has  has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89
[2025-02-07 23:13:44,940 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:44,941 INFO  L225             Difference]: With dead ends: 762
[2025-02-07 23:13:44,941 INFO  L226             Difference]: Without dead ends: 451
[2025-02-07 23:13:44,942 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=159, Invalid=2597, Unknown=0, NotChecked=0, Total=2756
[2025-02-07 23:13:44,943 INFO  L435           NwaCegarLoop]: 143 mSDtfsCounter, 157 mSDsluCounter, 3531 mSDsCounter, 0 mSdLazyCounter, 1942 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 3674 SdHoareTripleChecker+Invalid, 1942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:44,943 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 3674 Invalid, 1942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1942 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-07 23:13:44,944 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 451 states.
[2025-02-07 23:13:44,948 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 399.
[2025-02-07 23:13:44,949 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 399 states, 398 states have (on average 1.3718592964824121) internal successors, (546), 398 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:44,949 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 546 transitions.
[2025-02-07 23:13:44,950 INFO  L78                 Accepts]: Start accepts. Automaton has 399 states and 546 transitions. Word has length 89
[2025-02-07 23:13:44,950 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:44,950 INFO  L471      AbstractCegarLoop]: Abstraction has 399 states and 546 transitions.
[2025-02-07 23:13:44,950 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:44,950 INFO  L276                IsEmpty]: Start isEmpty. Operand 399 states and 546 transitions.
[2025-02-07 23:13:44,951 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 90
[2025-02-07 23:13:44,951 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:44,951 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:44,951 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2025-02-07 23:13:44,951 INFO  L396      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:44,952 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:44,952 INFO  L85        PathProgramCache]: Analyzing trace with hash 1973818998, now seen corresponding path program 1 times
[2025-02-07 23:13:44,952 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:44,952 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385460204]
[2025-02-07 23:13:44,952 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:44,952 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:44,974 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes.
[2025-02-07 23:13:45,055 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements.
[2025-02-07 23:13:45,055 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:45,055 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:45,440 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:45,441 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:45,441 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385460204]
[2025-02-07 23:13:45,441 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385460204] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:45,441 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:45,441 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:13:45,441 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258875953]
[2025-02-07 23:13:45,441 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:45,442 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 23:13:45,442 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:45,442 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 23:13:45,443 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:13:45,443 INFO  L87              Difference]: Start difference. First operand 399 states and 546 transitions. Second operand  has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:45,507 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:45,508 INFO  L93              Difference]: Finished difference Result 726 states and 1002 transitions.
[2025-02-07 23:13:45,508 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:13:45,508 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89
[2025-02-07 23:13:45,508 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:45,510 INFO  L225             Difference]: With dead ends: 726
[2025-02-07 23:13:45,510 INFO  L226             Difference]: Without dead ends: 371
[2025-02-07 23:13:45,510 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:13:45,511 INFO  L435           NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:45,511 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 359 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-07 23:13:45,511 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 371 states.
[2025-02-07 23:13:45,516 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371.
[2025-02-07 23:13:45,516 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 371 states, 370 states have (on average 1.3621621621621622) internal successors, (504), 370 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:45,517 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 504 transitions.
[2025-02-07 23:13:45,517 INFO  L78                 Accepts]: Start accepts. Automaton has 371 states and 504 transitions. Word has length 89
[2025-02-07 23:13:45,517 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:45,517 INFO  L471      AbstractCegarLoop]: Abstraction has 371 states and 504 transitions.
[2025-02-07 23:13:45,517 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:45,518 INFO  L276                IsEmpty]: Start isEmpty. Operand 371 states and 504 transitions.
[2025-02-07 23:13:45,518 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2025-02-07 23:13:45,518 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:45,518 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:45,518 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2025-02-07 23:13:45,519 INFO  L396      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:45,519 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:45,519 INFO  L85        PathProgramCache]: Analyzing trace with hash 579269928, now seen corresponding path program 1 times
[2025-02-07 23:13:45,519 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:45,519 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508542241]
[2025-02-07 23:13:45,519 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:45,519 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:45,545 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-02-07 23:13:45,646 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-02-07 23:13:45,647 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:45,647 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:46,174 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:46,174 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:46,174 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508542241]
[2025-02-07 23:13:46,175 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508542241] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:46,175 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:46,175 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-02-07 23:13:46,175 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592020230]
[2025-02-07 23:13:46,175 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:46,175 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-02-07 23:13:46,175 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:46,176 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-02-07 23:13:46,176 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2025-02-07 23:13:46,176 INFO  L87              Difference]: Start difference. First operand 371 states and 504 transitions. Second operand  has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:46,303 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:46,303 INFO  L93              Difference]: Finished difference Result 677 states and 933 transitions.
[2025-02-07 23:13:46,303 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-07 23:13:46,303 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90
[2025-02-07 23:13:46,304 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:46,305 INFO  L225             Difference]: With dead ends: 677
[2025-02-07 23:13:46,305 INFO  L226             Difference]: Without dead ends: 383
[2025-02-07 23:13:46,305 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2025-02-07 23:13:46,306 INFO  L435           NwaCegarLoop]: 178 mSDtfsCounter, 3 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:46,306 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1046 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-07 23:13:46,309 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 383 states.
[2025-02-07 23:13:46,312 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 378.
[2025-02-07 23:13:46,313 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 378 states, 377 states have (on average 1.3607427055702919) internal successors, (513), 377 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:46,314 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 513 transitions.
[2025-02-07 23:13:46,314 INFO  L78                 Accepts]: Start accepts. Automaton has 378 states and 513 transitions. Word has length 90
[2025-02-07 23:13:46,314 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:46,314 INFO  L471      AbstractCegarLoop]: Abstraction has 378 states and 513 transitions.
[2025-02-07 23:13:46,314 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:46,314 INFO  L276                IsEmpty]: Start isEmpty. Operand 378 states and 513 transitions.
[2025-02-07 23:13:46,315 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2025-02-07 23:13:46,315 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:46,315 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:46,315 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2025-02-07 23:13:46,315 INFO  L396      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:46,316 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:46,316 INFO  L85        PathProgramCache]: Analyzing trace with hash -334042697, now seen corresponding path program 1 times
[2025-02-07 23:13:46,316 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:46,316 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855899579]
[2025-02-07 23:13:46,316 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:46,316 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:46,338 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-02-07 23:13:46,503 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-02-07 23:13:46,504 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:46,504 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:47,047 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:47,047 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:47,047 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855899579]
[2025-02-07 23:13:47,047 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855899579] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:47,047 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:47,047 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-07 23:13:47,047 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745023383]
[2025-02-07 23:13:47,047 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:47,048 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-07 23:13:47,048 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:47,048 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-07 23:13:47,048 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-02-07 23:13:47,048 INFO  L87              Difference]: Start difference. First operand 378 states and 513 transitions. Second operand  has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:47,258 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:47,258 INFO  L93              Difference]: Finished difference Result 763 states and 1053 transitions.
[2025-02-07 23:13:47,259 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-07 23:13:47,259 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90
[2025-02-07 23:13:47,259 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:47,260 INFO  L225             Difference]: With dead ends: 763
[2025-02-07 23:13:47,260 INFO  L226             Difference]: Without dead ends: 463
[2025-02-07 23:13:47,261 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2025-02-07 23:13:47,261 INFO  L435           NwaCegarLoop]: 158 mSDtfsCounter, 121 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:47,261 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1099 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 23:13:47,261 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 463 states.
[2025-02-07 23:13:47,266 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 391.
[2025-02-07 23:13:47,266 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 391 states, 390 states have (on average 1.3615384615384616) internal successors, (531), 390 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:47,267 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 531 transitions.
[2025-02-07 23:13:47,267 INFO  L78                 Accepts]: Start accepts. Automaton has 391 states and 531 transitions. Word has length 90
[2025-02-07 23:13:47,267 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:47,267 INFO  L471      AbstractCegarLoop]: Abstraction has 391 states and 531 transitions.
[2025-02-07 23:13:47,267 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:47,267 INFO  L276                IsEmpty]: Start isEmpty. Operand 391 states and 531 transitions.
[2025-02-07 23:13:47,268 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2025-02-07 23:13:47,268 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:47,268 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:47,268 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2025-02-07 23:13:47,268 INFO  L396      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:47,269 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:47,269 INFO  L85        PathProgramCache]: Analyzing trace with hash 202501654, now seen corresponding path program 1 times
[2025-02-07 23:13:47,269 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:47,269 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003596645]
[2025-02-07 23:13:47,269 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:47,269 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:47,291 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-02-07 23:13:47,480 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-02-07 23:13:47,480 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:47,480 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:48,667 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:48,667 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:48,667 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003596645]
[2025-02-07 23:13:48,667 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003596645] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:48,667 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:48,667 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30
[2025-02-07 23:13:48,667 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569248709]
[2025-02-07 23:13:48,667 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:48,668 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2025-02-07 23:13:48,668 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:48,668 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2025-02-07 23:13:48,669 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870
[2025-02-07 23:13:48,669 INFO  L87              Difference]: Start difference. First operand 391 states and 531 transitions. Second operand  has 30 states, 30 states have (on average 3.0) internal successors, (90), 30 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:49,651 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:49,651 INFO  L93              Difference]: Finished difference Result 782 states and 1077 transitions.
[2025-02-07 23:13:49,651 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2025-02-07 23:13:49,651 INFO  L78                 Accepts]: Start accepts. Automaton has  has 30 states, 30 states have (on average 3.0) internal successors, (90), 30 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90
[2025-02-07 23:13:49,651 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:49,653 INFO  L225             Difference]: With dead ends: 782
[2025-02-07 23:13:49,653 INFO  L226             Difference]: Without dead ends: 455
[2025-02-07 23:13:49,654 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=1023, Unknown=0, NotChecked=0, Total=1122
[2025-02-07 23:13:49,654 INFO  L435           NwaCegarLoop]: 139 mSDtfsCounter, 110 mSDsluCounter, 3435 mSDsCounter, 0 mSdLazyCounter, 2098 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 2100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:49,654 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 3574 Invalid, 2100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2098 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-07 23:13:49,659 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 455 states.
[2025-02-07 23:13:49,664 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 386.
[2025-02-07 23:13:49,666 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 386 states, 385 states have (on average 1.3558441558441559) internal successors, (522), 385 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:49,666 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 522 transitions.
[2025-02-07 23:13:49,667 INFO  L78                 Accepts]: Start accepts. Automaton has 386 states and 522 transitions. Word has length 90
[2025-02-07 23:13:49,667 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:49,667 INFO  L471      AbstractCegarLoop]: Abstraction has 386 states and 522 transitions.
[2025-02-07 23:13:49,667 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 30 states, 30 states have (on average 3.0) internal successors, (90), 30 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:49,668 INFO  L276                IsEmpty]: Start isEmpty. Operand 386 states and 522 transitions.
[2025-02-07 23:13:49,668 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-02-07 23:13:49,668 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:49,668 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:49,668 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2025-02-07 23:13:49,669 INFO  L396      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:49,669 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:49,669 INFO  L85        PathProgramCache]: Analyzing trace with hash 208568440, now seen corresponding path program 1 times
[2025-02-07 23:13:49,669 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:49,669 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726172545]
[2025-02-07 23:13:49,669 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:49,669 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:49,692 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-02-07 23:13:49,770 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-02-07 23:13:49,770 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:49,770 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:50,051 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:50,052 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:50,052 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726172545]
[2025-02-07 23:13:50,052 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726172545] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:50,052 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:50,052 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:13:50,052 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353093780]
[2025-02-07 23:13:50,052 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:50,053 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 23:13:50,053 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:50,053 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 23:13:50,053 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:13:50,053 INFO  L87              Difference]: Start difference. First operand 386 states and 522 transitions. Second operand  has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:50,131 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:50,132 INFO  L93              Difference]: Finished difference Result 703 states and 962 transitions.
[2025-02-07 23:13:50,132 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:13:50,132 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91
[2025-02-07 23:13:50,132 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:50,134 INFO  L225             Difference]: With dead ends: 703
[2025-02-07 23:13:50,134 INFO  L226             Difference]: Without dead ends: 371
[2025-02-07 23:13:50,134 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:13:50,135 INFO  L435           NwaCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:50,135 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 534 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-07 23:13:50,135 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 371 states.
[2025-02-07 23:13:50,139 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371.
[2025-02-07 23:13:50,141 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 371 states, 370 states have (on average 1.3513513513513513) internal successors, (500), 370 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:50,142 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 500 transitions.
[2025-02-07 23:13:50,142 INFO  L78                 Accepts]: Start accepts. Automaton has 371 states and 500 transitions. Word has length 91
[2025-02-07 23:13:50,142 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:50,142 INFO  L471      AbstractCegarLoop]: Abstraction has 371 states and 500 transitions.
[2025-02-07 23:13:50,143 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:50,143 INFO  L276                IsEmpty]: Start isEmpty. Operand 371 states and 500 transitions.
[2025-02-07 23:13:50,143 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-02-07 23:13:50,143 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:50,143 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:50,143 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2025-02-07 23:13:50,144 INFO  L396      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:50,144 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:50,144 INFO  L85        PathProgramCache]: Analyzing trace with hash -1669507470, now seen corresponding path program 1 times
[2025-02-07 23:13:50,144 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:50,144 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682434862]
[2025-02-07 23:13:50,144 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:50,145 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:50,166 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-02-07 23:13:50,363 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-02-07 23:13:50,363 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:50,363 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:50,710 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:50,710 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:50,710 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682434862]
[2025-02-07 23:13:50,710 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682434862] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:50,710 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:50,710 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-07 23:13:50,710 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223038132]
[2025-02-07 23:13:50,710 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:50,710 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-07 23:13:50,710 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:50,711 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-07 23:13:50,711 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-02-07 23:13:50,712 INFO  L87              Difference]: Start difference. First operand 371 states and 500 transitions. Second operand  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:50,934 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:50,934 INFO  L93              Difference]: Finished difference Result 746 states and 1024 transitions.
[2025-02-07 23:13:50,934 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-07 23:13:50,935 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91
[2025-02-07 23:13:50,935 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:50,936 INFO  L225             Difference]: With dead ends: 746
[2025-02-07 23:13:50,936 INFO  L226             Difference]: Without dead ends: 448
[2025-02-07 23:13:50,936 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2025-02-07 23:13:50,937 INFO  L435           NwaCegarLoop]: 157 mSDtfsCounter, 103 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:50,937 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1092 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 23:13:50,938 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 448 states.
[2025-02-07 23:13:50,942 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 384.
[2025-02-07 23:13:50,943 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 384 states, 383 states have (on average 1.3524804177545693) internal successors, (518), 383 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:50,944 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 518 transitions.
[2025-02-07 23:13:50,944 INFO  L78                 Accepts]: Start accepts. Automaton has 384 states and 518 transitions. Word has length 91
[2025-02-07 23:13:50,944 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:50,944 INFO  L471      AbstractCegarLoop]: Abstraction has 384 states and 518 transitions.
[2025-02-07 23:13:50,944 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:50,945 INFO  L276                IsEmpty]: Start isEmpty. Operand 384 states and 518 transitions.
[2025-02-07 23:13:50,945 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-02-07 23:13:50,945 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:50,945 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:50,945 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2025-02-07 23:13:50,946 INFO  L396      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:50,946 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:50,946 INFO  L85        PathProgramCache]: Analyzing trace with hash 1924768148, now seen corresponding path program 1 times
[2025-02-07 23:13:50,946 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:50,946 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396771064]
[2025-02-07 23:13:50,946 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:50,946 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:50,969 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-02-07 23:13:51,227 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-02-07 23:13:51,227 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:51,227 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:52,608 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:52,608 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:52,608 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396771064]
[2025-02-07 23:13:52,608 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396771064] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:52,608 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:52,608 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33
[2025-02-07 23:13:52,608 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760704718]
[2025-02-07 23:13:52,608 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:52,609 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2025-02-07 23:13:52,609 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:52,609 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2025-02-07 23:13:52,610 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056
[2025-02-07 23:13:52,610 INFO  L87              Difference]: Start difference. First operand 384 states and 518 transitions. Second operand  has 33 states, 33 states have (on average 2.757575757575758) internal successors, (91), 33 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:54,325 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:54,326 INFO  L93              Difference]: Finished difference Result 823 states and 1132 transitions.
[2025-02-07 23:13:54,326 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. 
[2025-02-07 23:13:54,326 INFO  L78                 Accepts]: Start accepts. Automaton has  has 33 states, 33 states have (on average 2.757575757575758) internal successors, (91), 33 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91
[2025-02-07 23:13:54,326 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:54,327 INFO  L225             Difference]: With dead ends: 823
[2025-02-07 23:13:54,327 INFO  L226             Difference]: Without dead ends: 512
[2025-02-07 23:13:54,329 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=186, Invalid=3720, Unknown=0, NotChecked=0, Total=3906
[2025-02-07 23:13:54,329 INFO  L435           NwaCegarLoop]: 121 mSDtfsCounter, 143 mSDsluCounter, 3690 mSDsCounter, 0 mSdLazyCounter, 2995 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 3811 SdHoareTripleChecker+Invalid, 3017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:54,329 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 3811 Invalid, 3017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2995 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-02-07 23:13:54,330 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 512 states.
[2025-02-07 23:13:54,334 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 476.
[2025-02-07 23:13:54,335 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 476 states, 475 states have (on average 1.3557894736842104) internal successors, (644), 475 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:54,335 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 644 transitions.
[2025-02-07 23:13:54,335 INFO  L78                 Accepts]: Start accepts. Automaton has 476 states and 644 transitions. Word has length 91
[2025-02-07 23:13:54,336 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:54,336 INFO  L471      AbstractCegarLoop]: Abstraction has 476 states and 644 transitions.
[2025-02-07 23:13:54,336 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 33 states, 33 states have (on average 2.757575757575758) internal successors, (91), 33 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:54,336 INFO  L276                IsEmpty]: Start isEmpty. Operand 476 states and 644 transitions.
[2025-02-07 23:13:54,336 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-02-07 23:13:54,336 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:54,336 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:54,336 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2025-02-07 23:13:54,337 INFO  L396      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:54,337 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:54,337 INFO  L85        PathProgramCache]: Analyzing trace with hash -1650038427, now seen corresponding path program 1 times
[2025-02-07 23:13:54,337 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:54,337 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300269794]
[2025-02-07 23:13:54,337 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:54,337 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:54,364 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-02-07 23:13:54,435 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-02-07 23:13:54,435 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:54,435 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:54,695 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:54,695 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:54,695 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300269794]
[2025-02-07 23:13:54,695 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300269794] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:54,695 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:54,695 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:13:54,696 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909556113]
[2025-02-07 23:13:54,696 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:54,696 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 23:13:54,696 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:54,696 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 23:13:54,697 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:13:54,697 INFO  L87              Difference]: Start difference. First operand 476 states and 644 transitions. Second operand  has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:54,773 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:54,773 INFO  L93              Difference]: Finished difference Result 878 states and 1201 transitions.
[2025-02-07 23:13:54,774 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:13:54,774 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91
[2025-02-07 23:13:54,774 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:54,775 INFO  L225             Difference]: With dead ends: 878
[2025-02-07 23:13:54,775 INFO  L226             Difference]: Without dead ends: 466
[2025-02-07 23:13:54,776 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:13:54,777 INFO  L435           NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:54,778 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 531 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-07 23:13:54,778 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 466 states.
[2025-02-07 23:13:54,782 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466.
[2025-02-07 23:13:54,783 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 466 states, 465 states have (on average 1.3505376344086022) internal successors, (628), 465 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:54,783 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 628 transitions.
[2025-02-07 23:13:54,784 INFO  L78                 Accepts]: Start accepts. Automaton has 466 states and 628 transitions. Word has length 91
[2025-02-07 23:13:54,784 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:54,784 INFO  L471      AbstractCegarLoop]: Abstraction has 466 states and 628 transitions.
[2025-02-07 23:13:54,784 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:54,784 INFO  L276                IsEmpty]: Start isEmpty. Operand 466 states and 628 transitions.
[2025-02-07 23:13:54,784 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2025-02-07 23:13:54,785 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:54,785 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:54,785 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2025-02-07 23:13:54,785 INFO  L396      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:54,785 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:54,785 INFO  L85        PathProgramCache]: Analyzing trace with hash 1095094369, now seen corresponding path program 1 times
[2025-02-07 23:13:54,785 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:54,786 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037568303]
[2025-02-07 23:13:54,786 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:54,786 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:54,810 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes.
[2025-02-07 23:13:55,025 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements.
[2025-02-07 23:13:55,026 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:55,026 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:55,464 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:55,464 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:55,464 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037568303]
[2025-02-07 23:13:55,464 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037568303] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:55,464 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:55,464 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-07 23:13:55,464 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872714798]
[2025-02-07 23:13:55,464 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:55,464 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-07 23:13:55,464 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:55,465 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-07 23:13:55,465 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-02-07 23:13:55,465 INFO  L87              Difference]: Start difference. First operand 466 states and 628 transitions. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:55,647 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:55,647 INFO  L93              Difference]: Finished difference Result 896 states and 1228 transitions.
[2025-02-07 23:13:55,647 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-07 23:13:55,647 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92
[2025-02-07 23:13:55,647 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:55,648 INFO  L225             Difference]: With dead ends: 896
[2025-02-07 23:13:55,649 INFO  L226             Difference]: Without dead ends: 508
[2025-02-07 23:13:55,649 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2025-02-07 23:13:55,649 INFO  L435           NwaCegarLoop]: 157 mSDtfsCounter, 64 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:55,649 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 922 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 23:13:55,650 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 508 states.
[2025-02-07 23:13:55,654 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 479.
[2025-02-07 23:13:55,655 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 479 states, 478 states have (on average 1.3514644351464435) internal successors, (646), 478 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:55,655 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 646 transitions.
[2025-02-07 23:13:55,656 INFO  L78                 Accepts]: Start accepts. Automaton has 479 states and 646 transitions. Word has length 92
[2025-02-07 23:13:55,656 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:55,656 INFO  L471      AbstractCegarLoop]: Abstraction has 479 states and 646 transitions.
[2025-02-07 23:13:55,656 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:55,656 INFO  L276                IsEmpty]: Start isEmpty. Operand 479 states and 646 transitions.
[2025-02-07 23:13:55,656 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2025-02-07 23:13:55,657 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:55,657 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:55,657 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2025-02-07 23:13:55,657 INFO  L396      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:55,657 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:55,658 INFO  L85        PathProgramCache]: Analyzing trace with hash 610340588, now seen corresponding path program 1 times
[2025-02-07 23:13:55,658 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:55,658 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917347987]
[2025-02-07 23:13:55,658 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:55,658 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:55,678 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes.
[2025-02-07 23:13:55,775 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements.
[2025-02-07 23:13:55,775 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:55,775 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:57,183 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:57,183 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:57,183 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917347987]
[2025-02-07 23:13:57,183 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917347987] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:57,183 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:57,183 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36
[2025-02-07 23:13:57,183 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931238251]
[2025-02-07 23:13:57,183 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:57,184 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 36 states
[2025-02-07 23:13:57,184 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:57,184 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2025-02-07 23:13:57,184 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260
[2025-02-07 23:13:57,185 INFO  L87              Difference]: Start difference. First operand 479 states and 646 transitions. Second operand  has 36 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 36 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:58,596 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:58,596 INFO  L93              Difference]: Finished difference Result 1027 states and 1407 transitions.
[2025-02-07 23:13:58,596 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. 
[2025-02-07 23:13:58,597 INFO  L78                 Accepts]: Start accepts. Automaton has  has 36 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 36 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92
[2025-02-07 23:13:58,597 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:58,598 INFO  L225             Difference]: With dead ends: 1027
[2025-02-07 23:13:58,598 INFO  L226             Difference]: Without dead ends: 626
[2025-02-07 23:13:58,599 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=1258, Unknown=0, NotChecked=0, Total=1332
[2025-02-07 23:13:58,599 INFO  L435           NwaCegarLoop]: 147 mSDtfsCounter, 34 mSDsluCounter, 4897 mSDsCounter, 0 mSdLazyCounter, 3644 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 5044 SdHoareTripleChecker+Invalid, 3647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:58,599 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 5044 Invalid, 3647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3644 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-02-07 23:13:58,600 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 626 states.
[2025-02-07 23:13:58,606 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 609.
[2025-02-07 23:13:58,607 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 609 states, 608 states have (on average 1.3667763157894737) internal successors, (831), 608 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:58,608 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 831 transitions.
[2025-02-07 23:13:58,608 INFO  L78                 Accepts]: Start accepts. Automaton has 609 states and 831 transitions. Word has length 92
[2025-02-07 23:13:58,608 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:58,608 INFO  L471      AbstractCegarLoop]: Abstraction has 609 states and 831 transitions.
[2025-02-07 23:13:58,608 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 36 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 36 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:58,608 INFO  L276                IsEmpty]: Start isEmpty. Operand 609 states and 831 transitions.
[2025-02-07 23:13:58,609 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2025-02-07 23:13:58,609 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:58,609 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:58,609 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2025-02-07 23:13:58,609 INFO  L396      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:58,610 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:58,610 INFO  L85        PathProgramCache]: Analyzing trace with hash -360091395, now seen corresponding path program 1 times
[2025-02-07 23:13:58,610 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:58,610 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959685568]
[2025-02-07 23:13:58,610 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:58,610 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:58,632 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes.
[2025-02-07 23:13:58,749 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements.
[2025-02-07 23:13:58,750 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:58,750 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:13:59,235 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:13:59,235 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:13:59,235 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959685568]
[2025-02-07 23:13:59,235 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959685568] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:13:59,235 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:13:59,235 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-07 23:13:59,235 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165115326]
[2025-02-07 23:13:59,235 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:13:59,236 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-07 23:13:59,236 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:13:59,236 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-07 23:13:59,236 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-02-07 23:13:59,236 INFO  L87              Difference]: Start difference. First operand 609 states and 831 transitions. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:59,367 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:13:59,367 INFO  L93              Difference]: Finished difference Result 1146 states and 1582 transitions.
[2025-02-07 23:13:59,368 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-07 23:13:59,368 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92
[2025-02-07 23:13:59,368 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:13:59,369 INFO  L225             Difference]: With dead ends: 1146
[2025-02-07 23:13:59,369 INFO  L226             Difference]: Without dead ends: 617
[2025-02-07 23:13:59,370 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-02-07 23:13:59,370 INFO  L435           NwaCegarLoop]: 175 mSDtfsCounter, 3 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-07 23:13:59,371 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1200 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-07 23:13:59,371 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 617 states.
[2025-02-07 23:13:59,376 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 615.
[2025-02-07 23:13:59,377 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 615 states, 614 states have (on average 1.3648208469055374) internal successors, (838), 614 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:59,378 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 838 transitions.
[2025-02-07 23:13:59,378 INFO  L78                 Accepts]: Start accepts. Automaton has 615 states and 838 transitions. Word has length 92
[2025-02-07 23:13:59,378 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:13:59,378 INFO  L471      AbstractCegarLoop]: Abstraction has 615 states and 838 transitions.
[2025-02-07 23:13:59,379 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:13:59,379 INFO  L276                IsEmpty]: Start isEmpty. Operand 615 states and 838 transitions.
[2025-02-07 23:13:59,379 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2025-02-07 23:13:59,379 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:13:59,379 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:13:59,380 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2025-02-07 23:13:59,380 INFO  L396      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:13:59,380 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:13:59,380 INFO  L85        PathProgramCache]: Analyzing trace with hash 1034847978, now seen corresponding path program 1 times
[2025-02-07 23:13:59,380 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:13:59,380 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327608999]
[2025-02-07 23:13:59,381 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:13:59,381 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:13:59,403 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes.
[2025-02-07 23:13:59,530 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements.
[2025-02-07 23:13:59,531 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:13:59,531 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:14:01,354 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:14:01,354 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:14:01,354 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327608999]
[2025-02-07 23:14:01,354 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327608999] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:14:01,354 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:14:01,354 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39
[2025-02-07 23:14:01,354 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510592705]
[2025-02-07 23:14:01,354 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:14:01,355 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 39 states
[2025-02-07 23:14:01,355 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:14:01,355 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants.
[2025-02-07 23:14:01,355 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1405, Unknown=0, NotChecked=0, Total=1482
[2025-02-07 23:14:01,356 INFO  L87              Difference]: Start difference. First operand 615 states and 838 transitions. Second operand  has 39 states, 39 states have (on average 2.3846153846153846) internal successors, (93), 39 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:14:02,879 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:14:02,879 INFO  L93              Difference]: Finished difference Result 1235 states and 1702 transitions.
[2025-02-07 23:14:02,879 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. 
[2025-02-07 23:14:02,879 INFO  L78                 Accepts]: Start accepts. Automaton has  has 39 states, 39 states have (on average 2.3846153846153846) internal successors, (93), 39 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93
[2025-02-07 23:14:02,880 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:14:02,881 INFO  L225             Difference]: With dead ends: 1235
[2025-02-07 23:14:02,881 INFO  L226             Difference]: Without dead ends: 712
[2025-02-07 23:14:02,882 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=1405, Unknown=0, NotChecked=0, Total=1482
[2025-02-07 23:14:02,882 INFO  L435           NwaCegarLoop]: 147 mSDtfsCounter, 37 mSDsluCounter, 5182 mSDsCounter, 0 mSdLazyCounter, 4113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 5329 SdHoareTripleChecker+Invalid, 4114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-02-07 23:14:02,883 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 5329 Invalid, 4114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4113 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-02-07 23:14:02,883 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 712 states.
[2025-02-07 23:14:02,888 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 699.
[2025-02-07 23:14:02,889 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 699 states, 698 states have (on average 1.3710601719197708) internal successors, (957), 698 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:14:02,889 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 957 transitions.
[2025-02-07 23:14:02,890 INFO  L78                 Accepts]: Start accepts. Automaton has 699 states and 957 transitions. Word has length 93
[2025-02-07 23:14:02,890 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:14:02,890 INFO  L471      AbstractCegarLoop]: Abstraction has 699 states and 957 transitions.
[2025-02-07 23:14:02,890 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 39 states, 39 states have (on average 2.3846153846153846) internal successors, (93), 39 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:14:02,890 INFO  L276                IsEmpty]: Start isEmpty. Operand 699 states and 957 transitions.
[2025-02-07 23:14:02,890 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2025-02-07 23:14:02,890 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:14:02,891 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:14:02,891 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2025-02-07 23:14:02,891 INFO  L396      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:14:02,891 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:14:02,892 INFO  L85        PathProgramCache]: Analyzing trace with hash -843245412, now seen corresponding path program 1 times
[2025-02-07 23:14:02,892 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:14:02,892 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231296684]
[2025-02-07 23:14:02,892 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:14:02,892 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:14:02,915 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes.
[2025-02-07 23:14:03,044 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements.
[2025-02-07 23:14:03,044 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:14:03,044 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:14:03,352 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:14:03,352 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:14:03,352 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231296684]
[2025-02-07 23:14:03,352 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231296684] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:14:03,352 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:14:03,352 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-07 23:14:03,352 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511148593]
[2025-02-07 23:14:03,352 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:14:03,353 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-07 23:14:03,353 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:14:03,353 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-07 23:14:03,353 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-02-07 23:14:03,353 INFO  L87              Difference]: Start difference. First operand 699 states and 957 transitions. Second operand  has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:14:03,548 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:14:03,548 INFO  L93              Difference]: Finished difference Result 1339 states and 1855 transitions.
[2025-02-07 23:14:03,548 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-07 23:14:03,549 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93
[2025-02-07 23:14:03,549 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:14:03,550 INFO  L225             Difference]: With dead ends: 1339
[2025-02-07 23:14:03,550 INFO  L226             Difference]: Without dead ends: 733
[2025-02-07 23:14:03,551 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2025-02-07 23:14:03,551 INFO  L435           NwaCegarLoop]: 157 mSDtfsCounter, 57 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 23:14:03,551 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1086 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 23:14:03,552 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 733 states.
[2025-02-07 23:14:03,559 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 712.
[2025-02-07 23:14:03,560 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 712 states, 711 states have (on average 1.371308016877637) internal successors, (975), 711 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:14:03,560 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 975 transitions.
[2025-02-07 23:14:03,561 INFO  L78                 Accepts]: Start accepts. Automaton has 712 states and 975 transitions. Word has length 93
[2025-02-07 23:14:03,561 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:14:03,561 INFO  L471      AbstractCegarLoop]: Abstraction has 712 states and 975 transitions.
[2025-02-07 23:14:03,562 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:14:03,564 INFO  L276                IsEmpty]: Start isEmpty. Operand 712 states and 975 transitions.
[2025-02-07 23:14:03,564 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2025-02-07 23:14:03,564 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:14:03,565 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:14:03,565 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2025-02-07 23:14:03,565 INFO  L396      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:14:03,565 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:14:03,565 INFO  L85        PathProgramCache]: Analyzing trace with hash 1406197181, now seen corresponding path program 1 times
[2025-02-07 23:14:03,565 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:14:03,565 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822834304]
[2025-02-07 23:14:03,565 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:14:03,565 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:14:03,589 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes.
[2025-02-07 23:14:03,663 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements.
[2025-02-07 23:14:03,663 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:14:03,663 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:14:04,184 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:14:04,184 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:14:04,184 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822834304]
[2025-02-07 23:14:04,184 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822834304] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:14:04,184 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:14:04,185 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-07 23:14:04,185 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411242564]
[2025-02-07 23:14:04,185 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:14:04,185 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-07 23:14:04,185 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:14:04,185 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-07 23:14:04,185 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-02-07 23:14:04,186 INFO  L87              Difference]: Start difference. First operand 712 states and 975 transitions. Second operand  has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:14:04,311 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:14:04,311 INFO  L93              Difference]: Finished difference Result 1346 states and 1863 transitions.
[2025-02-07 23:14:04,311 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-07 23:14:04,311 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93
[2025-02-07 23:14:04,311 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:14:04,313 INFO  L225             Difference]: With dead ends: 1346
[2025-02-07 23:14:04,313 INFO  L226             Difference]: Without dead ends: 728
[2025-02-07 23:14:04,314 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-02-07 23:14:04,315 INFO  L435           NwaCegarLoop]: 175 mSDtfsCounter, 3 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1029 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.1s IncrementalHoareTripleChecker+Time
[2025-02-07 23:14:04,315 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1029 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-07 23:14:04,315 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 728 states.
[2025-02-07 23:14:04,323 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 723.
[2025-02-07 23:14:04,323 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 723 states, 722 states have (on average 1.368421052631579) internal successors, (988), 722 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:14:04,324 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 988 transitions.
[2025-02-07 23:14:04,324 INFO  L78                 Accepts]: Start accepts. Automaton has 723 states and 988 transitions. Word has length 93
[2025-02-07 23:14:04,324 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:14:04,324 INFO  L471      AbstractCegarLoop]: Abstraction has 723 states and 988 transitions.
[2025-02-07 23:14:04,324 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:14:04,325 INFO  L276                IsEmpty]: Start isEmpty. Operand 723 states and 988 transitions.
[2025-02-07 23:14:04,325 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 95
[2025-02-07 23:14:04,325 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:14:04,325 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:14:04,325 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2025-02-07 23:14:04,325 INFO  L396      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:14:04,326 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:14:04,326 INFO  L85        PathProgramCache]: Analyzing trace with hash 34672907, now seen corresponding path program 1 times
[2025-02-07 23:14:04,326 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:14:04,326 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597176728]
[2025-02-07 23:14:04,326 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:14:04,326 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:14:04,355 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes.
[2025-02-07 23:14:04,508 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements.
[2025-02-07 23:14:04,508 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:14:04,508 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:14:04,866 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:14:04,866 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:14:04,866 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597176728]
[2025-02-07 23:14:04,866 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597176728] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:14:04,866 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:14:04,866 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-07 23:14:04,866 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940091501]
[2025-02-07 23:14:04,866 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:14:04,866 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-07 23:14:04,866 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:14:04,867 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-07 23:14:04,867 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-02-07 23:14:04,867 INFO  L87              Difference]: Start difference. First operand 723 states and 988 transitions. Second operand  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:14:05,092 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:14:05,092 INFO  L93              Difference]: Finished difference Result 1363 states and 1884 transitions.
[2025-02-07 23:14:05,092 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-07 23:14:05,092 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94
[2025-02-07 23:14:05,093 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:14:05,094 INFO  L225             Difference]: With dead ends: 1363
[2025-02-07 23:14:05,094 INFO  L226             Difference]: Without dead ends: 749
[2025-02-07 23:14:05,095 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2025-02-07 23:14:05,095 INFO  L435           NwaCegarLoop]: 157 mSDtfsCounter, 53 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 23:14:05,095 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 920 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 23:14:05,096 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 749 states.
[2025-02-07 23:14:05,101 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 736.
[2025-02-07 23:14:05,101 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 736 states, 735 states have (on average 1.3687074829931973) internal successors, (1006), 735 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:14:05,102 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1006 transitions.
[2025-02-07 23:14:05,102 INFO  L78                 Accepts]: Start accepts. Automaton has 736 states and 1006 transitions. Word has length 94
[2025-02-07 23:14:05,102 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:14:05,103 INFO  L471      AbstractCegarLoop]: Abstraction has 736 states and 1006 transitions.
[2025-02-07 23:14:05,103 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:14:05,103 INFO  L276                IsEmpty]: Start isEmpty. Operand 736 states and 1006 transitions.
[2025-02-07 23:14:05,103 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 95
[2025-02-07 23:14:05,103 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:14:05,103 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:14:05,104 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2025-02-07 23:14:05,104 INFO  L396      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:14:05,104 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:14:05,104 INFO  L85        PathProgramCache]: Analyzing trace with hash 1352258718, now seen corresponding path program 1 times
[2025-02-07 23:14:05,104 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:14:05,105 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671601908]
[2025-02-07 23:14:05,105 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:14:05,105 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:14:05,127 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes.
[2025-02-07 23:14:05,228 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements.
[2025-02-07 23:14:05,229 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:14:05,229 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:14:06,952 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:14:06,953 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:14:06,953 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671601908]
[2025-02-07 23:14:06,953 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671601908] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:14:06,953 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:14:06,953 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42
[2025-02-07 23:14:06,953 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18113583]
[2025-02-07 23:14:06,953 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:14:06,953 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 42 states
[2025-02-07 23:14:06,953 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:14:06,954 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2025-02-07 23:14:06,954 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1639, Unknown=0, NotChecked=0, Total=1722
[2025-02-07 23:14:06,954 INFO  L87              Difference]: Start difference. First operand 736 states and 1006 transitions. Second operand  has 42 states, 42 states have (on average 2.238095238095238) internal successors, (94), 42 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:14:08,708 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:14:08,709 INFO  L93              Difference]: Finished difference Result 1395 states and 1922 transitions.
[2025-02-07 23:14:08,709 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. 
[2025-02-07 23:14:08,709 INFO  L78                 Accepts]: Start accepts. Automaton has  has 42 states, 42 states have (on average 2.238095238095238) internal successors, (94), 42 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94
[2025-02-07 23:14:08,709 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:14:08,711 INFO  L225             Difference]: With dead ends: 1395
[2025-02-07 23:14:08,711 INFO  L226             Difference]: Without dead ends: 768
[2025-02-07 23:14:08,712 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=83, Invalid=1639, Unknown=0, NotChecked=0, Total=1722
[2025-02-07 23:14:08,712 INFO  L435           NwaCegarLoop]: 143 mSDtfsCounter, 43 mSDsluCounter, 5457 mSDsCounter, 0 mSdLazyCounter, 4689 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 5600 SdHoareTripleChecker+Invalid, 4690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-02-07 23:14:08,712 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 5600 Invalid, 4690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4689 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-02-07 23:14:08,713 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 768 states.
[2025-02-07 23:14:08,717 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 752.
[2025-02-07 23:14:08,718 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 752 states, 751 states have (on average 1.3688415446071904) internal successors, (1028), 751 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:14:08,719 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1028 transitions.
[2025-02-07 23:14:08,719 INFO  L78                 Accepts]: Start accepts. Automaton has 752 states and 1028 transitions. Word has length 94
[2025-02-07 23:14:08,719 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:14:08,719 INFO  L471      AbstractCegarLoop]: Abstraction has 752 states and 1028 transitions.
[2025-02-07 23:14:08,719 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 42 states, 42 states have (on average 2.238095238095238) internal successors, (94), 42 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:14:08,719 INFO  L276                IsEmpty]: Start isEmpty. Operand 752 states and 1028 transitions.
[2025-02-07 23:14:08,720 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 95
[2025-02-07 23:14:08,720 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:14:08,720 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:14:08,720 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2025-02-07 23:14:08,721 INFO  L396      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:14:08,721 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:14:08,721 INFO  L85        PathProgramCache]: Analyzing trace with hash -1864403537, now seen corresponding path program 1 times
[2025-02-07 23:14:08,721 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:14:08,721 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806808730]
[2025-02-07 23:14:08,721 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:14:08,721 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:14:08,751 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes.
[2025-02-07 23:14:08,837 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements.
[2025-02-07 23:14:08,837 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:14:08,837 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:14:09,201 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:14:09,201 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:14:09,201 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806808730]
[2025-02-07 23:14:09,201 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806808730] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:14:09,201 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:14:09,201 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-07 23:14:09,201 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150139759]
[2025-02-07 23:14:09,202 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:14:09,202 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-07 23:14:09,202 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:14:09,202 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-07 23:14:09,202 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-02-07 23:14:09,202 INFO  L87              Difference]: Start difference. First operand 752 states and 1028 transitions. Second operand  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:14:09,310 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:14:09,311 INFO  L93              Difference]: Finished difference Result 1401 states and 1936 transitions.
[2025-02-07 23:14:09,311 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-07 23:14:09,311 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94
[2025-02-07 23:14:09,311 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:14:09,313 INFO  L225             Difference]: With dead ends: 1401
[2025-02-07 23:14:09,313 INFO  L226             Difference]: Without dead ends: 765
[2025-02-07 23:14:09,314 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-02-07 23:14:09,314 INFO  L435           NwaCegarLoop]: 175 mSDtfsCounter, 3 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-07 23:14:09,314 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1029 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-07 23:14:09,315 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 765 states.
[2025-02-07 23:14:09,318 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 759.
[2025-02-07 23:14:09,319 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 759 states, 758 states have (on average 1.3680738786279683) internal successors, (1037), 758 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:14:09,320 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1037 transitions.
[2025-02-07 23:14:09,320 INFO  L78                 Accepts]: Start accepts. Automaton has 759 states and 1037 transitions. Word has length 94
[2025-02-07 23:14:09,320 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:14:09,320 INFO  L471      AbstractCegarLoop]: Abstraction has 759 states and 1037 transitions.
[2025-02-07 23:14:09,320 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:14:09,320 INFO  L276                IsEmpty]: Start isEmpty. Operand 759 states and 1037 transitions.
[2025-02-07 23:14:09,321 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 95
[2025-02-07 23:14:09,321 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:14:09,321 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:14:09,321 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2025-02-07 23:14:09,321 INFO  L396      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:14:09,321 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:14:09,321 INFO  L85        PathProgramCache]: Analyzing trace with hash 1347345586, now seen corresponding path program 1 times
[2025-02-07 23:14:09,322 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:14:09,322 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540902006]
[2025-02-07 23:14:09,322 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:14:09,322 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:14:09,339 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes.
[2025-02-07 23:14:09,405 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements.
[2025-02-07 23:14:09,405 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:14:09,405 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:14:09,646 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:14:09,647 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:14:09,647 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540902006]
[2025-02-07 23:14:09,647 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540902006] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:14:09,647 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:14:09,647 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:14:09,647 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186048701]
[2025-02-07 23:14:09,647 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:14:09,647 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 23:14:09,647 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:14:09,647 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 23:14:09,647 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:14:09,647 INFO  L87              Difference]: Start difference. First operand 759 states and 1037 transitions. Second operand  has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:14:09,686 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:14:09,686 INFO  L93              Difference]: Finished difference Result 1431 states and 1972 transitions.
[2025-02-07 23:14:09,687 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:14:09,687 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94
[2025-02-07 23:14:09,687 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:14:09,688 INFO  L225             Difference]: With dead ends: 1431
[2025-02-07 23:14:09,688 INFO  L226             Difference]: Without dead ends: 741
[2025-02-07 23:14:09,689 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:14:09,689 INFO  L435           NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-07 23:14:09,689 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 353 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-07 23:14:09,690 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 741 states.
[2025-02-07 23:14:09,693 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741.
[2025-02-07 23:14:09,693 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 741 states, 740 states have (on average 1.3635135135135135) internal successors, (1009), 740 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:14:09,694 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1009 transitions.
[2025-02-07 23:14:09,694 INFO  L78                 Accepts]: Start accepts. Automaton has 741 states and 1009 transitions. Word has length 94
[2025-02-07 23:14:09,694 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:14:09,694 INFO  L471      AbstractCegarLoop]: Abstraction has 741 states and 1009 transitions.
[2025-02-07 23:14:09,694 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:14:09,694 INFO  L276                IsEmpty]: Start isEmpty. Operand 741 states and 1009 transitions.
[2025-02-07 23:14:09,695 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 96
[2025-02-07 23:14:09,695 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:14:09,695 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:14:09,695 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2025-02-07 23:14:09,695 INFO  L396      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:14:09,695 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:14:09,695 INFO  L85        PathProgramCache]: Analyzing trace with hash -1024289594, now seen corresponding path program 1 times
[2025-02-07 23:14:09,695 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:14:09,695 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349194509]
[2025-02-07 23:14:09,695 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:14:09,696 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:14:09,712 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes.
[2025-02-07 23:14:09,822 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements.
[2025-02-07 23:14:09,822 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:14:09,822 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:14:10,128 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:14:10,128 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:14:10,128 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349194509]
[2025-02-07 23:14:10,128 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349194509] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:14:10,128 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:14:10,128 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-07 23:14:10,128 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473235238]
[2025-02-07 23:14:10,128 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:14:10,129 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-07 23:14:10,129 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:14:10,129 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-07 23:14:10,129 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-02-07 23:14:10,129 INFO  L87              Difference]: Start difference. First operand 741 states and 1009 transitions. Second operand  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:14:10,291 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:14:10,292 INFO  L93              Difference]: Finished difference Result 1386 states and 1909 transitions.
[2025-02-07 23:14:10,292 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-07 23:14:10,292 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95
[2025-02-07 23:14:10,292 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:14:10,294 INFO  L225             Difference]: With dead ends: 1386
[2025-02-07 23:14:10,294 INFO  L226             Difference]: Without dead ends: 759
[2025-02-07 23:14:10,294 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-02-07 23:14:10,294 INFO  L435           NwaCegarLoop]: 156 mSDtfsCounter, 30 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-07 23:14:10,294 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 992 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-07 23:14:10,295 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 759 states.
[2025-02-07 23:14:10,298 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 754.
[2025-02-07 23:14:10,299 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 754 states, 753 states have (on average 1.3638778220451526) internal successors, (1027), 753 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:14:10,299 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1027 transitions.
[2025-02-07 23:14:10,299 INFO  L78                 Accepts]: Start accepts. Automaton has 754 states and 1027 transitions. Word has length 95
[2025-02-07 23:14:10,300 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:14:10,300 INFO  L471      AbstractCegarLoop]: Abstraction has 754 states and 1027 transitions.
[2025-02-07 23:14:10,300 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:14:10,300 INFO  L276                IsEmpty]: Start isEmpty. Operand 754 states and 1027 transitions.
[2025-02-07 23:14:10,300 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 96
[2025-02-07 23:14:10,300 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:14:10,300 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:14:10,300 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2025-02-07 23:14:10,300 INFO  L396      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:14:10,300 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:14:10,301 INFO  L85        PathProgramCache]: Analyzing trace with hash -1412261556, now seen corresponding path program 1 times
[2025-02-07 23:14:10,301 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:14:10,301 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2392981]
[2025-02-07 23:14:10,301 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:14:10,301 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:14:10,317 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes.
[2025-02-07 23:14:10,382 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements.
[2025-02-07 23:14:10,382 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:14:10,382 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:14:12,208 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:14:12,209 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:14:12,209 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2392981]
[2025-02-07 23:14:12,209 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2392981] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:14:12,209 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:14:12,209 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50
[2025-02-07 23:14:12,209 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020205740]
[2025-02-07 23:14:12,209 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:14:12,209 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 51 states
[2025-02-07 23:14:12,209 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:14:12,210 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants.
[2025-02-07 23:14:12,210 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2404, Unknown=0, NotChecked=0, Total=2550
[2025-02-07 23:14:12,211 INFO  L87              Difference]: Start difference. First operand 754 states and 1027 transitions. Second operand  has 51 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:14:14,592 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:14:14,592 INFO  L93              Difference]: Finished difference Result 1487 states and 2052 transitions.
[2025-02-07 23:14:14,592 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. 
[2025-02-07 23:14:14,592 INFO  L78                 Accepts]: Start accepts. Automaton has  has 51 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95
[2025-02-07 23:14:14,592 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:14:14,594 INFO  L225             Difference]: With dead ends: 1487
[2025-02-07 23:14:14,594 INFO  L226             Difference]: Without dead ends: 860
[2025-02-07 23:14:14,596 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652
[2025-02-07 23:14:14,596 INFO  L435           NwaCegarLoop]: 85 mSDtfsCounter, 244 mSDsluCounter, 3997 mSDsCounter, 0 mSdLazyCounter, 6092 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 4082 SdHoareTripleChecker+Invalid, 6138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 6092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2025-02-07 23:14:14,596 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 4082 Invalid, 6138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 6092 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2025-02-07 23:14:14,597 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 860 states.
[2025-02-07 23:14:14,601 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 856.
[2025-02-07 23:14:14,602 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 856 states, 855 states have (on average 1.3707602339181286) internal successors, (1172), 855 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:14:14,603 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1172 transitions.
[2025-02-07 23:14:14,603 INFO  L78                 Accepts]: Start accepts. Automaton has 856 states and 1172 transitions. Word has length 95
[2025-02-07 23:14:14,603 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:14:14,603 INFO  L471      AbstractCegarLoop]: Abstraction has 856 states and 1172 transitions.
[2025-02-07 23:14:14,603 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 51 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:14:14,603 INFO  L276                IsEmpty]: Start isEmpty. Operand 856 states and 1172 transitions.
[2025-02-07 23:14:14,603 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 96
[2025-02-07 23:14:14,603 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:14:14,603 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:14:14,603 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2025-02-07 23:14:14,604 INFO  L396      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:14:14,604 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:14:14,604 INFO  L85        PathProgramCache]: Analyzing trace with hash 353295707, now seen corresponding path program 1 times
[2025-02-07 23:14:14,604 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:14:14,604 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944631344]
[2025-02-07 23:14:14,604 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:14:14,604 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:14:14,623 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes.
[2025-02-07 23:14:14,737 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements.
[2025-02-07 23:14:14,738 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:14:14,738 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:14:15,969 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:14:15,969 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:14:15,969 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944631344]
[2025-02-07 23:14:15,969 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944631344] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:14:15,969 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:14:15,969 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34
[2025-02-07 23:14:15,969 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965144527]
[2025-02-07 23:14:15,970 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:14:15,970 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 34 states
[2025-02-07 23:14:15,970 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:14:15,970 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants.
[2025-02-07 23:14:15,970 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122
[2025-02-07 23:14:15,971 INFO  L87              Difference]: Start difference. First operand 856 states and 1172 transitions. Second operand  has 34 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 34 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:14:17,158 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:14:17,159 INFO  L93              Difference]: Finished difference Result 1956 states and 2717 transitions.
[2025-02-07 23:14:17,159 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. 
[2025-02-07 23:14:17,159 INFO  L78                 Accepts]: Start accepts. Automaton has  has 34 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 34 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95
[2025-02-07 23:14:17,159 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:14:17,162 INFO  L225             Difference]: With dead ends: 1956
[2025-02-07 23:14:17,162 INFO  L226             Difference]: Without dead ends: 1214
[2025-02-07 23:14:17,163 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122
[2025-02-07 23:14:17,164 INFO  L435           NwaCegarLoop]: 118 mSDtfsCounter, 34 mSDsluCounter, 3595 mSDsCounter, 0 mSdLazyCounter, 3018 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3713 SdHoareTripleChecker+Invalid, 3043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 3018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-02-07 23:14:17,164 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3713 Invalid, 3043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 3018 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-02-07 23:14:17,165 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1214 states.
[2025-02-07 23:14:17,173 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1208.
[2025-02-07 23:14:17,174 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1208 states, 1207 states have (on average 1.3827671913835957) internal successors, (1669), 1207 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:14:17,175 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1669 transitions.
[2025-02-07 23:14:17,175 INFO  L78                 Accepts]: Start accepts. Automaton has 1208 states and 1669 transitions. Word has length 95
[2025-02-07 23:14:17,175 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:14:17,175 INFO  L471      AbstractCegarLoop]: Abstraction has 1208 states and 1669 transitions.
[2025-02-07 23:14:17,175 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 34 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 34 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:14:17,176 INFO  L276                IsEmpty]: Start isEmpty. Operand 1208 states and 1669 transitions.
[2025-02-07 23:14:17,176 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 96
[2025-02-07 23:14:17,176 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:14:17,176 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:14:17,176 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2025-02-07 23:14:17,176 INFO  L396      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:14:17,176 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:14:17,176 INFO  L85        PathProgramCache]: Analyzing trace with hash -766231277, now seen corresponding path program 1 times
[2025-02-07 23:14:17,177 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:14:17,177 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465432054]
[2025-02-07 23:14:17,177 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:14:17,177 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:14:17,194 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes.
[2025-02-07 23:14:17,255 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements.
[2025-02-07 23:14:17,255 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:14:17,255 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat