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


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


Checking for ERROR reachability
Using default analysis
Version e2fb8bed
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 5bfb987fcec0e4e87ab47a565086b76b03edc9a60525cd8ee77a0c461c0fdaaa
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 08:30:47,423 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 08:30:47,465 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf
[2025-03-08 08:30:47,471 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 08:30:47,473 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 08:30:47,486 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 08:30:47,486 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 08:30:47,487 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 08:30:47,487 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 08:30:47,487 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 08:30:47,487 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 08:30:47,487 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 08:30:47,487 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 08:30:47,487 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 08:30:47,488 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 08:30:47,488 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 08:30:47,488 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 08:30:47,488 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 08:30:47,488 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 08:30:47,488 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 08:30:47,488 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 08:30:47,488 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 08:30:47,488 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 08:30:47,488 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 08:30:47,488 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 08:30:47,489 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 08:30:47,489 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 08:30:47,489 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 08:30:47,489 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 08:30:47,489 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 08:30:47,489 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 08:30:47,489 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 08:30:47,489 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 08:30:47,489 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 08:30:47,489 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 08:30:47,489 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 08:30:47,490 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 08:30:47,490 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 08:30:47,490 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 08:30:47,490 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 08:30:47,490 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/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 -> 5bfb987fcec0e4e87ab47a565086b76b03edc9a60525cd8ee77a0c461c0fdaaa
[2025-03-08 08:30:47,714 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 08:30:47,723 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 08:30:47,725 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 08:30:47,726 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 08:30:47,726 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 08:30:47,728 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c
[2025-03-08 08:30:48,880 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3889d3cc/58125c73238643b6b116e09a0b67386b/FLAG3d043ae53
[2025-03-08 08:30:49,103 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 08:30:49,105 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c
[2025-03-08 08:30:49,111 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3889d3cc/58125c73238643b6b116e09a0b67386b/FLAG3d043ae53
[2025-03-08 08:30:49,121 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3889d3cc/58125c73238643b6b116e09a0b67386b
[2025-03-08 08:30:49,123 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 08:30:49,124 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 08:30:49,126 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 08:30:49,126 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 08:30:49,129 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 08:30:49,130 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 08:30:49" (1/1) ...
[2025-03-08 08:30:49,132 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33211a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:30:49, skipping insertion in model container
[2025-03-08 08:30:49,132 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 08:30:49" (1/1) ...
[2025-03-08 08:30:49,160 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 08:30:49,271 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c[1279,1292]
[2025-03-08 08:30:49,425 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 08:30:49,431 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 08:30:49,438 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c[1279,1292]
[2025-03-08 08:30:49,515 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 08:30:49,527 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 08:30:49,527 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:30:49 WrapperNode
[2025-03-08 08:30:49,528 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 08:30:49,528 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 08:30:49,528 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 08:30:49,529 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 08:30:49,533 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:30:49" (1/1) ...
[2025-03-08 08:30:49,547 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:30:49" (1/1) ...
[2025-03-08 08:30:49,630 INFO  L138                Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1382
[2025-03-08 08:30:49,631 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 08:30:49,631 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 08:30:49,631 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 08:30:49,631 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 08:30:49,638 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:30:49" (1/1) ...
[2025-03-08 08:30:49,638 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:30:49" (1/1) ...
[2025-03-08 08:30:49,659 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:30:49" (1/1) ...
[2025-03-08 08:30:49,712 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-03-08 08:30:49,712 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:30:49" (1/1) ...
[2025-03-08 08:30:49,712 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:30:49" (1/1) ...
[2025-03-08 08:30:49,755 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:30:49" (1/1) ...
[2025-03-08 08:30:49,763 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:30:49" (1/1) ...
[2025-03-08 08:30:49,774 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:30:49" (1/1) ...
[2025-03-08 08:30:49,784 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:30:49" (1/1) ...
[2025-03-08 08:30:49,806 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 08:30:49,808 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 08:30:49,808 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 08:30:49,808 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 08:30:49,809 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:30:49" (1/1) ...
[2025-03-08 08:30:49,813 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 08:30:49,823 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 08:30:49,835 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 08:30:49,837 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 08:30:49,855 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 08:30:49,856 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 08:30:49,856 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 08:30:49,856 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 08:30:49,856 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 08:30:49,856 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 08:30:50,022 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 08:30:50,024 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 08:30:51,225 INFO  L?                        ?]: Removed 754 outVars from TransFormulas that were not future-live.
[2025-03-08 08:30:51,225 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 08:30:51,278 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 08:30:51,278 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 08:30:51,278 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:30:51 BoogieIcfgContainer
[2025-03-08 08:30:51,279 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 08:30:51,280 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 08:30:51,280 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 08:30:51,286 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 08:30:51,286 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 08:30:49" (1/3) ...
[2025-03-08 08:30:51,287 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77da45fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 08:30:51, skipping insertion in model container
[2025-03-08 08:30:51,287 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:30:49" (2/3) ...
[2025-03-08 08:30:51,288 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77da45fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 08:30:51, skipping insertion in model container
[2025-03-08 08:30:51,288 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:30:51" (3/3) ...
[2025-03-08 08:30:51,289 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c
[2025-03-08 08:30:51,299 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 08:30:51,300 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c that has 2 procedures, 392 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 08:30:51,354 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 08:30:51,363 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;@be202ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 08:30:51,365 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 08:30:51,371 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 392 states, 386 states have (on average 1.4922279792746114) internal successors, (576), 387 states have internal predecessors, (576), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-08 08:30:51,379 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 118
[2025-03-08 08:30:51,379 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:30:51,380 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:30:51,381 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:30:51,385 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:30:51,386 INFO  L85        PathProgramCache]: Analyzing trace with hash 9518675, now seen corresponding path program 1 times
[2025-03-08 08:30:51,391 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:30:51,393 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841657770]
[2025-03-08 08:30:51,393 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:30:51,394 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:30:51,470 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes.
[2025-03-08 08:30:51,520 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements.
[2025-03-08 08:30:51,521 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:30:51,521 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:30:51,705 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-03-08 08:30:51,705 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:30:51,705 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841657770]
[2025-03-08 08:30:51,706 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841657770] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 08:30:51,706 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497640879]
[2025-03-08 08:30:51,706 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:30:51,706 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 08:30:51,706 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 08:30:51,710 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 08:30:51,711 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-08 08:30:51,885 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes.
[2025-03-08 08:30:51,975 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements.
[2025-03-08 08:30:51,976 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:30:51,976 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:30:51,980 INFO  L256         TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-08 08:30:51,985 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 08:30:52,002 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-03-08 08:30:52,004 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 08:30:52,004 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [497640879] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:30:52,004 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 08:30:52,004 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-08 08:30:52,007 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412632930]
[2025-03-08 08:30:52,007 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:30:52,010 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 08:30:52,011 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:30:52,026 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 08:30:52,027 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 08:30:52,030 INFO  L87              Difference]: Start difference. First operand  has 392 states, 386 states have (on average 1.4922279792746114) internal successors, (576), 387 states have internal predecessors, (576), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand  has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-03-08 08:30:52,187 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:30:52,188 INFO  L93              Difference]: Finished difference Result 711 states and 1061 transitions.
[2025-03-08 08:30:52,189 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 08:30:52,190 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 117
[2025-03-08 08:30:52,190 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:30:52,198 INFO  L225             Difference]: With dead ends: 711
[2025-03-08 08:30:52,199 INFO  L226             Difference]: Without dead ends: 389
[2025-03-08 08:30:52,203 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 08:30:52,204 INFO  L435           NwaCegarLoop]: 484 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 08:30:52,205 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 484 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 08:30:52,217 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 389 states.
[2025-03-08 08:30:52,239 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389.
[2025-03-08 08:30:52,240 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 389 states, 384 states have (on average 1.4869791666666667) internal successors, (571), 384 states have internal predecessors, (571), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-08 08:30:52,243 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 577 transitions.
[2025-03-08 08:30:52,244 INFO  L78                 Accepts]: Start accepts. Automaton has 389 states and 577 transitions. Word has length 117
[2025-03-08 08:30:52,245 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:30:52,245 INFO  L471      AbstractCegarLoop]: Abstraction has 389 states and 577 transitions.
[2025-03-08 08:30:52,245 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-03-08 08:30:52,245 INFO  L276                IsEmpty]: Start isEmpty. Operand 389 states and 577 transitions.
[2025-03-08 08:30:52,248 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 118
[2025-03-08 08:30:52,248 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:30:52,248 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:30:52,256 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-08 08:30:52,453 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-03-08 08:30:52,453 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:30:52,454 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:30:52,454 INFO  L85        PathProgramCache]: Analyzing trace with hash -918513680, now seen corresponding path program 1 times
[2025-03-08 08:30:52,454 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:30:52,454 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922797529]
[2025-03-08 08:30:52,454 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:30:52,454 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:30:52,488 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes.
[2025-03-08 08:30:52,634 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements.
[2025-03-08 08:30:52,634 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:30:52,634 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:30:53,237 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-08 08:30:53,237 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:30:53,237 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922797529]
[2025-03-08 08:30:53,237 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922797529] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:30:53,237 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:30:53,237 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 08:30:53,237 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39598608]
[2025-03-08 08:30:53,237 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:30:53,238 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 08:30:53,238 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:30:53,239 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 08:30:53,239 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 08:30:53,241 INFO  L87              Difference]: Start difference. First operand 389 states and 577 transitions. Second operand  has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:30:53,441 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:30:53,441 INFO  L93              Difference]: Finished difference Result 393 states and 581 transitions.
[2025-03-08 08:30:53,442 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 08:30:53,442 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 117
[2025-03-08 08:30:53,443 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:30:53,445 INFO  L225             Difference]: With dead ends: 393
[2025-03-08 08:30:53,445 INFO  L226             Difference]: Without dead ends: 391
[2025-03-08 08:30:53,446 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-03-08 08:30:53,446 INFO  L435           NwaCegarLoop]: 482 mSDtfsCounter, 0 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 08:30:53,446 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1441 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 08:30:53,447 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 391 states.
[2025-03-08 08:30:53,463 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391.
[2025-03-08 08:30:53,465 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 391 states, 386 states have (on average 1.4844559585492227) internal successors, (573), 386 states have internal predecessors, (573), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-08 08:30:53,470 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 579 transitions.
[2025-03-08 08:30:53,470 INFO  L78                 Accepts]: Start accepts. Automaton has 391 states and 579 transitions. Word has length 117
[2025-03-08 08:30:53,471 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:30:53,471 INFO  L471      AbstractCegarLoop]: Abstraction has 391 states and 579 transitions.
[2025-03-08 08:30:53,471 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:30:53,471 INFO  L276                IsEmpty]: Start isEmpty. Operand 391 states and 579 transitions.
[2025-03-08 08:30:53,472 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2025-03-08 08:30:53,472 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:30:53,472 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:30:53,473 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 08:30:53,473 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:30:53,473 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:30:53,473 INFO  L85        PathProgramCache]: Analyzing trace with hash 1595526459, now seen corresponding path program 1 times
[2025-03-08 08:30:53,473 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:30:53,473 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802969098]
[2025-03-08 08:30:53,473 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:30:53,473 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:30:53,511 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes.
[2025-03-08 08:30:53,566 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements.
[2025-03-08 08:30:53,568 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:30:53,568 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:30:53,798 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-08 08:30:53,799 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:30:53,799 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802969098]
[2025-03-08 08:30:53,799 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802969098] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:30:53,799 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:30:53,799 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 08:30:53,799 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727568190]
[2025-03-08 08:30:53,799 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:30:53,799 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 08:30:53,799 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:30:53,800 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 08:30:53,800 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:30:53,801 INFO  L87              Difference]: Start difference. First operand 391 states and 579 transitions. Second operand  has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:30:54,254 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:30:54,254 INFO  L93              Difference]: Finished difference Result 971 states and 1441 transitions.
[2025-03-08 08:30:54,254 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 08:30:54,254 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 118
[2025-03-08 08:30:54,255 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:30:54,256 INFO  L225             Difference]: With dead ends: 971
[2025-03-08 08:30:54,256 INFO  L226             Difference]: Without dead ends: 391
[2025-03-08 08:30:54,257 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2025-03-08 08:30:54,258 INFO  L435           NwaCegarLoop]: 525 mSDtfsCounter, 1090 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 08:30:54,258 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 1416 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 08:30:54,259 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 391 states.
[2025-03-08 08:30:54,270 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391.
[2025-03-08 08:30:54,274 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 391 states, 386 states have (on average 1.4818652849740932) internal successors, (572), 386 states have internal predecessors, (572), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-08 08:30:54,276 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 578 transitions.
[2025-03-08 08:30:54,276 INFO  L78                 Accepts]: Start accepts. Automaton has 391 states and 578 transitions. Word has length 118
[2025-03-08 08:30:54,276 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:30:54,278 INFO  L471      AbstractCegarLoop]: Abstraction has 391 states and 578 transitions.
[2025-03-08 08:30:54,278 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:30:54,279 INFO  L276                IsEmpty]: Start isEmpty. Operand 391 states and 578 transitions.
[2025-03-08 08:30:54,280 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2025-03-08 08:30:54,280 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:30:54,280 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:30:54,280 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 08:30:54,280 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:30:54,280 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:30:54,280 INFO  L85        PathProgramCache]: Analyzing trace with hash -1218222754, now seen corresponding path program 1 times
[2025-03-08 08:30:54,280 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:30:54,281 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644228016]
[2025-03-08 08:30:54,281 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:30:54,281 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:30:54,308 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes.
[2025-03-08 08:30:54,348 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements.
[2025-03-08 08:30:54,349 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:30:54,349 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:30:54,568 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-08 08:30:54,569 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:30:54,569 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644228016]
[2025-03-08 08:30:54,569 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644228016] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:30:54,569 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:30:54,569 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 08:30:54,569 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79959053]
[2025-03-08 08:30:54,569 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:30:54,569 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 08:30:54,570 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:30:54,570 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 08:30:54,570 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 08:30:54,570 INFO  L87              Difference]: Start difference. First operand 391 states and 578 transitions. Second operand  has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:30:54,736 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:30:54,736 INFO  L93              Difference]: Finished difference Result 714 states and 1055 transitions.
[2025-03-08 08:30:54,737 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 08:30:54,737 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 119
[2025-03-08 08:30:54,737 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:30:54,739 INFO  L225             Difference]: With dead ends: 714
[2025-03-08 08:30:54,739 INFO  L226             Difference]: Without dead ends: 393
[2025-03-08 08:30:54,739 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-03-08 08:30:54,740 INFO  L435           NwaCegarLoop]: 481 mSDtfsCounter, 0 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 08:30:54,740 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1435 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 08:30:54,741 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 393 states.
[2025-03-08 08:30:54,746 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393.
[2025-03-08 08:30:54,747 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 393 states, 388 states have (on average 1.4793814432989691) internal successors, (574), 388 states have internal predecessors, (574), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-08 08:30:54,749 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 580 transitions.
[2025-03-08 08:30:54,749 INFO  L78                 Accepts]: Start accepts. Automaton has 393 states and 580 transitions. Word has length 119
[2025-03-08 08:30:54,749 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:30:54,749 INFO  L471      AbstractCegarLoop]: Abstraction has 393 states and 580 transitions.
[2025-03-08 08:30:54,749 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:30:54,749 INFO  L276                IsEmpty]: Start isEmpty. Operand 393 states and 580 transitions.
[2025-03-08 08:30:54,750 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2025-03-08 08:30:54,751 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:30:54,751 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:30:54,751 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 08:30:54,751 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:30:54,751 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:30:54,751 INFO  L85        PathProgramCache]: Analyzing trace with hash -1473657464, now seen corresponding path program 1 times
[2025-03-08 08:30:54,752 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:30:54,752 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302975780]
[2025-03-08 08:30:54,752 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:30:54,752 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:30:54,781 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes.
[2025-03-08 08:30:54,813 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements.
[2025-03-08 08:30:54,813 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:30:54,813 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:30:55,089 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-08 08:30:55,090 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:30:55,090 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302975780]
[2025-03-08 08:30:55,090 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302975780] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:30:55,090 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:30:55,090 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 08:30:55,090 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739100120]
[2025-03-08 08:30:55,090 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:30:55,091 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 08:30:55,091 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:30:55,091 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 08:30:55,091 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 08:30:55,092 INFO  L87              Difference]: Start difference. First operand 393 states and 580 transitions. Second operand  has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:30:55,291 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:30:55,292 INFO  L93              Difference]: Finished difference Result 716 states and 1056 transitions.
[2025-03-08 08:30:55,292 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 08:30:55,293 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 120
[2025-03-08 08:30:55,293 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:30:55,294 INFO  L225             Difference]: With dead ends: 716
[2025-03-08 08:30:55,294 INFO  L226             Difference]: Without dead ends: 393
[2025-03-08 08:30:55,295 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:30:55,296 INFO  L435           NwaCegarLoop]: 449 mSDtfsCounter, 478 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 08:30:55,296 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 900 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 08:30:55,297 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 393 states.
[2025-03-08 08:30:55,302 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393.
[2025-03-08 08:30:55,302 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 393 states, 388 states have (on average 1.4768041237113403) internal successors, (573), 388 states have internal predecessors, (573), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-08 08:30:55,304 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 579 transitions.
[2025-03-08 08:30:55,304 INFO  L78                 Accepts]: Start accepts. Automaton has 393 states and 579 transitions. Word has length 120
[2025-03-08 08:30:55,304 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:30:55,304 INFO  L471      AbstractCegarLoop]: Abstraction has 393 states and 579 transitions.
[2025-03-08 08:30:55,304 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:30:55,305 INFO  L276                IsEmpty]: Start isEmpty. Operand 393 states and 579 transitions.
[2025-03-08 08:30:55,305 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 122
[2025-03-08 08:30:55,305 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:30:55,305 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:30:55,306 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 08:30:55,306 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:30:55,306 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:30:55,306 INFO  L85        PathProgramCache]: Analyzing trace with hash -1845444275, now seen corresponding path program 1 times
[2025-03-08 08:30:55,306 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:30:55,306 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597596662]
[2025-03-08 08:30:55,306 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:30:55,307 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:30:55,332 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes.
[2025-03-08 08:30:55,356 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements.
[2025-03-08 08:30:55,357 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:30:55,357 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:30:55,553 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-08 08:30:55,553 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:30:55,553 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597596662]
[2025-03-08 08:30:55,553 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597596662] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:30:55,553 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:30:55,554 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 08:30:55,554 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081716594]
[2025-03-08 08:30:55,554 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:30:55,554 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 08:30:55,554 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:30:55,555 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 08:30:55,555 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:30:55,555 INFO  L87              Difference]: Start difference. First operand 393 states and 579 transitions. Second operand  has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:30:55,769 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:30:55,770 INFO  L93              Difference]: Finished difference Result 722 states and 1062 transitions.
[2025-03-08 08:30:55,770 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 08:30:55,770 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 121
[2025-03-08 08:30:55,770 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:30:55,772 INFO  L225             Difference]: With dead ends: 722
[2025-03-08 08:30:55,772 INFO  L226             Difference]: Without dead ends: 393
[2025-03-08 08:30:55,772 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-08 08:30:55,773 INFO  L435           NwaCegarLoop]: 474 mSDtfsCounter, 489 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 08:30:55,773 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 1401 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 08:30:55,774 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 393 states.
[2025-03-08 08:30:55,784 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393.
[2025-03-08 08:30:55,784 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 393 states, 388 states have (on average 1.4742268041237114) internal successors, (572), 388 states have internal predecessors, (572), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-08 08:30:55,788 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 578 transitions.
[2025-03-08 08:30:55,788 INFO  L78                 Accepts]: Start accepts. Automaton has 393 states and 578 transitions. Word has length 121
[2025-03-08 08:30:55,788 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:30:55,788 INFO  L471      AbstractCegarLoop]: Abstraction has 393 states and 578 transitions.
[2025-03-08 08:30:55,789 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:30:55,789 INFO  L276                IsEmpty]: Start isEmpty. Operand 393 states and 578 transitions.
[2025-03-08 08:30:55,789 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2025-03-08 08:30:55,789 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:30:55,790 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:30:55,790 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 08:30:55,790 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:30:55,790 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:30:55,790 INFO  L85        PathProgramCache]: Analyzing trace with hash 1276695705, now seen corresponding path program 1 times
[2025-03-08 08:30:55,790 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:30:55,790 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936586824]
[2025-03-08 08:30:55,790 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:30:55,791 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:30:55,815 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-03-08 08:30:55,846 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-03-08 08:30:55,846 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:30:55,846 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:30:56,067 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-08 08:30:56,067 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:30:56,067 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936586824]
[2025-03-08 08:30:56,067 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936586824] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:30:56,067 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:30:56,067 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 08:30:56,067 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113403585]
[2025-03-08 08:30:56,068 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:30:56,068 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 08:30:56,068 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:30:56,068 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 08:30:56,068 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:30:56,069 INFO  L87              Difference]: Start difference. First operand 393 states and 578 transitions. Second operand  has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:30:56,267 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:30:56,267 INFO  L93              Difference]: Finished difference Result 716 states and 1052 transitions.
[2025-03-08 08:30:56,267 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 08:30:56,268 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 122
[2025-03-08 08:30:56,268 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:30:56,269 INFO  L225             Difference]: With dead ends: 716
[2025-03-08 08:30:56,269 INFO  L226             Difference]: Without dead ends: 393
[2025-03-08 08:30:56,270 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-08 08:30:56,272 INFO  L435           NwaCegarLoop]: 449 mSDtfsCounter, 1039 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 08:30:56,272 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 900 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 08:30:56,273 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 393 states.
[2025-03-08 08:30:56,281 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393.
[2025-03-08 08:30:56,284 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 393 states, 388 states have (on average 1.4716494845360826) internal successors, (571), 388 states have internal predecessors, (571), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-08 08:30:56,285 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 577 transitions.
[2025-03-08 08:30:56,286 INFO  L78                 Accepts]: Start accepts. Automaton has 393 states and 577 transitions. Word has length 122
[2025-03-08 08:30:56,286 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:30:56,286 INFO  L471      AbstractCegarLoop]: Abstraction has 393 states and 577 transitions.
[2025-03-08 08:30:56,286 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:30:56,286 INFO  L276                IsEmpty]: Start isEmpty. Operand 393 states and 577 transitions.
[2025-03-08 08:30:56,287 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 124
[2025-03-08 08:30:56,287 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:30:56,287 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:30:56,287 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 08:30:56,287 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:30:56,288 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:30:56,288 INFO  L85        PathProgramCache]: Analyzing trace with hash 20784658, now seen corresponding path program 1 times
[2025-03-08 08:30:56,288 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:30:56,288 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662691557]
[2025-03-08 08:30:56,288 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:30:56,288 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:30:56,313 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes.
[2025-03-08 08:30:56,338 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements.
[2025-03-08 08:30:56,339 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:30:56,339 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:30:56,534 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-08 08:30:56,534 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:30:56,534 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662691557]
[2025-03-08 08:30:56,534 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662691557] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:30:56,534 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:30:56,534 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 08:30:56,535 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756421181]
[2025-03-08 08:30:56,535 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:30:56,535 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 08:30:56,535 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:30:56,536 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 08:30:56,536 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:30:56,536 INFO  L87              Difference]: Start difference. First operand 393 states and 577 transitions. Second operand  has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:30:56,739 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:30:56,739 INFO  L93              Difference]: Finished difference Result 716 states and 1050 transitions.
[2025-03-08 08:30:56,740 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 08:30:56,740 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 123
[2025-03-08 08:30:56,740 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:30:56,741 INFO  L225             Difference]: With dead ends: 716
[2025-03-08 08:30:56,741 INFO  L226             Difference]: Without dead ends: 393
[2025-03-08 08:30:56,742 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-08 08:30:56,742 INFO  L435           NwaCegarLoop]: 449 mSDtfsCounter, 1031 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1034 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 08:30:56,743 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1034 Valid, 900 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 08:30:56,743 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 393 states.
[2025-03-08 08:30:56,751 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393.
[2025-03-08 08:30:56,752 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 393 states, 388 states have (on average 1.4690721649484537) internal successors, (570), 388 states have internal predecessors, (570), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-08 08:30:56,753 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 576 transitions.
[2025-03-08 08:30:56,755 INFO  L78                 Accepts]: Start accepts. Automaton has 393 states and 576 transitions. Word has length 123
[2025-03-08 08:30:56,756 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:30:56,756 INFO  L471      AbstractCegarLoop]: Abstraction has 393 states and 576 transitions.
[2025-03-08 08:30:56,756 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:30:56,757 INFO  L276                IsEmpty]: Start isEmpty. Operand 393 states and 576 transitions.
[2025-03-08 08:30:56,757 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 125
[2025-03-08 08:30:56,757 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:30:56,757 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:30:56,758 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 08:30:56,758 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:30:56,758 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:30:56,758 INFO  L85        PathProgramCache]: Analyzing trace with hash 1530727486, now seen corresponding path program 1 times
[2025-03-08 08:30:56,758 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:30:56,758 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466754992]
[2025-03-08 08:30:56,758 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:30:56,758 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:30:56,793 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes.
[2025-03-08 08:30:56,829 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements.
[2025-03-08 08:30:56,829 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:30:56,829 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:30:57,074 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-08 08:30:57,075 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:30:57,075 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466754992]
[2025-03-08 08:30:57,075 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466754992] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:30:57,075 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:30:57,075 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 08:30:57,075 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799713210]
[2025-03-08 08:30:57,075 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:30:57,076 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 08:30:57,076 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:30:57,076 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 08:30:57,076 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 08:30:57,076 INFO  L87              Difference]: Start difference. First operand 393 states and 576 transitions. Second operand  has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:30:57,234 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:30:57,235 INFO  L93              Difference]: Finished difference Result 716 states and 1048 transitions.
[2025-03-08 08:30:57,235 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 08:30:57,235 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 124
[2025-03-08 08:30:57,235 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:30:57,237 INFO  L225             Difference]: With dead ends: 716
[2025-03-08 08:30:57,237 INFO  L226             Difference]: Without dead ends: 393
[2025-03-08 08:30:57,237 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:30:57,237 INFO  L435           NwaCegarLoop]: 461 mSDtfsCounter, 483 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 08:30:57,238 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 924 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 08:30:57,238 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 393 states.
[2025-03-08 08:30:57,243 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393.
[2025-03-08 08:30:57,244 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 393 states, 388 states have (on average 1.4639175257731958) internal successors, (568), 388 states have internal predecessors, (568), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-08 08:30:57,245 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 574 transitions.
[2025-03-08 08:30:57,246 INFO  L78                 Accepts]: Start accepts. Automaton has 393 states and 574 transitions. Word has length 124
[2025-03-08 08:30:57,246 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:30:57,246 INFO  L471      AbstractCegarLoop]: Abstraction has 393 states and 574 transitions.
[2025-03-08 08:30:57,246 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:30:57,246 INFO  L276                IsEmpty]: Start isEmpty. Operand 393 states and 574 transitions.
[2025-03-08 08:30:57,247 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 127
[2025-03-08 08:30:57,247 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:30:57,247 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:30:57,247 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-08 08:30:57,247 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:30:57,247 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:30:57,247 INFO  L85        PathProgramCache]: Analyzing trace with hash -2074811328, now seen corresponding path program 1 times
[2025-03-08 08:30:57,247 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:30:57,247 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13249866]
[2025-03-08 08:30:57,247 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:30:57,248 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:30:57,273 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes.
[2025-03-08 08:30:57,301 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements.
[2025-03-08 08:30:57,301 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:30:57,301 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:30:57,505 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-08 08:30:57,505 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:30:57,505 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13249866]
[2025-03-08 08:30:57,505 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13249866] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:30:57,505 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:30:57,505 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 08:30:57,505 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608305522]
[2025-03-08 08:30:57,505 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:30:57,506 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 08:30:57,506 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:30:57,506 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 08:30:57,506 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:30:57,506 INFO  L87              Difference]: Start difference. First operand 393 states and 574 transitions. Second operand  has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:30:57,669 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:30:57,671 INFO  L93              Difference]: Finished difference Result 716 states and 1044 transitions.
[2025-03-08 08:30:57,671 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 08:30:57,671 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 126
[2025-03-08 08:30:57,671 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:30:57,673 INFO  L225             Difference]: With dead ends: 716
[2025-03-08 08:30:57,673 INFO  L226             Difference]: Without dead ends: 393
[2025-03-08 08:30:57,674 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-08 08:30:57,674 INFO  L435           NwaCegarLoop]: 461 mSDtfsCounter, 1033 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 08:30:57,674 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 924 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 08:30:57,675 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 393 states.
[2025-03-08 08:30:57,682 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393.
[2025-03-08 08:30:57,683 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 393 states, 388 states have (on average 1.461340206185567) internal successors, (567), 388 states have internal predecessors, (567), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-08 08:30:57,684 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 573 transitions.
[2025-03-08 08:30:57,684 INFO  L78                 Accepts]: Start accepts. Automaton has 393 states and 573 transitions. Word has length 126
[2025-03-08 08:30:57,685 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:30:57,685 INFO  L471      AbstractCegarLoop]: Abstraction has 393 states and 573 transitions.
[2025-03-08 08:30:57,685 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:30:57,685 INFO  L276                IsEmpty]: Start isEmpty. Operand 393 states and 573 transitions.
[2025-03-08 08:30:57,686 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 128
[2025-03-08 08:30:57,686 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:30:57,686 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:30:57,686 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-08 08:30:57,686 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:30:57,687 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:30:57,687 INFO  L85        PathProgramCache]: Analyzing trace with hash -146504235, now seen corresponding path program 1 times
[2025-03-08 08:30:57,687 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:30:57,687 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412304490]
[2025-03-08 08:30:57,687 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:30:57,687 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:30:57,716 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes.
[2025-03-08 08:30:57,760 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements.
[2025-03-08 08:30:57,760 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:30:57,760 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:30:58,008 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-08 08:30:58,009 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:30:58,009 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412304490]
[2025-03-08 08:30:58,009 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412304490] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:30:58,009 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:30:58,009 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 08:30:58,009 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021788377]
[2025-03-08 08:30:58,009 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:30:58,010 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 08:30:58,010 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:30:58,010 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 08:30:58,010 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 08:30:58,011 INFO  L87              Difference]: Start difference. First operand 393 states and 573 transitions. Second operand  has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2025-03-08 08:30:58,213 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:30:58,213 INFO  L93              Difference]: Finished difference Result 716 states and 1042 transitions.
[2025-03-08 08:30:58,214 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 08:30:58,214 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 127
[2025-03-08 08:30:58,214 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:30:58,215 INFO  L225             Difference]: With dead ends: 716
[2025-03-08 08:30:58,215 INFO  L226             Difference]: Without dead ends: 393
[2025-03-08 08:30:58,216 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:30:58,216 INFO  L435           NwaCegarLoop]: 463 mSDtfsCounter, 518 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 08:30:58,216 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 928 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 08:30:58,217 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 393 states.
[2025-03-08 08:30:58,224 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393.
[2025-03-08 08:30:58,225 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 393 states, 388 states have (on average 1.458762886597938) internal successors, (566), 388 states have internal predecessors, (566), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-08 08:30:58,226 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 572 transitions.
[2025-03-08 08:30:58,227 INFO  L78                 Accepts]: Start accepts. Automaton has 393 states and 572 transitions. Word has length 127
[2025-03-08 08:30:58,227 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:30:58,227 INFO  L471      AbstractCegarLoop]: Abstraction has 393 states and 572 transitions.
[2025-03-08 08:30:58,227 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2025-03-08 08:30:58,227 INFO  L276                IsEmpty]: Start isEmpty. Operand 393 states and 572 transitions.
[2025-03-08 08:30:58,228 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 129
[2025-03-08 08:30:58,228 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:30:58,228 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:30:58,228 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-08 08:30:58,228 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:30:58,229 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:30:58,229 INFO  L85        PathProgramCache]: Analyzing trace with hash 1012214780, now seen corresponding path program 1 times
[2025-03-08 08:30:58,229 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:30:58,229 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749744973]
[2025-03-08 08:30:58,229 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:30:58,230 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:30:58,257 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes.
[2025-03-08 08:30:58,321 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements.
[2025-03-08 08:30:58,321 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:30:58,321 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:30:58,510 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-08 08:30:58,512 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:30:58,512 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749744973]
[2025-03-08 08:30:58,512 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749744973] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:30:58,512 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:30:58,512 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 08:30:58,512 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208729800]
[2025-03-08 08:30:58,512 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:30:58,512 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 08:30:58,512 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:30:58,513 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 08:30:58,513 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 08:30:58,513 INFO  L87              Difference]: Start difference. First operand 393 states and 572 transitions. Second operand  has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2025-03-08 08:30:58,706 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:30:58,706 INFO  L93              Difference]: Finished difference Result 716 states and 1040 transitions.
[2025-03-08 08:30:58,706 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 08:30:58,707 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 128
[2025-03-08 08:30:58,707 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:30:58,708 INFO  L225             Difference]: With dead ends: 716
[2025-03-08 08:30:58,708 INFO  L226             Difference]: Without dead ends: 393
[2025-03-08 08:30:58,708 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:30:58,709 INFO  L435           NwaCegarLoop]: 463 mSDtfsCounter, 516 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 08:30:58,709 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 928 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 08:30:58,710 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 393 states.
[2025-03-08 08:30:58,716 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393.
[2025-03-08 08:30:58,716 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 393 states, 388 states have (on average 1.4561855670103092) internal successors, (565), 388 states have internal predecessors, (565), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-08 08:30:58,718 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 571 transitions.
[2025-03-08 08:30:58,718 INFO  L78                 Accepts]: Start accepts. Automaton has 393 states and 571 transitions. Word has length 128
[2025-03-08 08:30:58,718 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:30:58,718 INFO  L471      AbstractCegarLoop]: Abstraction has 393 states and 571 transitions.
[2025-03-08 08:30:58,718 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2025-03-08 08:30:58,718 INFO  L276                IsEmpty]: Start isEmpty. Operand 393 states and 571 transitions.
[2025-03-08 08:30:58,720 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2025-03-08 08:30:58,720 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:30:58,720 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:30:58,720 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-08 08:30:58,720 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:30:58,720 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:30:58,721 INFO  L85        PathProgramCache]: Analyzing trace with hash 436345397, now seen corresponding path program 1 times
[2025-03-08 08:30:58,721 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:30:58,721 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556845336]
[2025-03-08 08:30:58,721 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:30:58,721 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:30:58,754 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes.
[2025-03-08 08:30:58,839 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements.
[2025-03-08 08:30:58,839 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:30:58,840 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:30:59,234 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-08 08:30:59,234 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:30:59,235 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556845336]
[2025-03-08 08:30:59,235 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556845336] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:30:59,235 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:30:59,235 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 08:30:59,235 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286476358]
[2025-03-08 08:30:59,235 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:30:59,235 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 08:30:59,235 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:30:59,236 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 08:30:59,236 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:30:59,236 INFO  L87              Difference]: Start difference. First operand 393 states and 571 transitions. Second operand  has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:30:59,539 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:30:59,539 INFO  L93              Difference]: Finished difference Result 722 states and 1046 transitions.
[2025-03-08 08:30:59,539 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 08:30:59,539 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 129
[2025-03-08 08:30:59,540 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:30:59,541 INFO  L225             Difference]: With dead ends: 722
[2025-03-08 08:30:59,542 INFO  L226             Difference]: Without dead ends: 397
[2025-03-08 08:30:59,542 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:30:59,542 INFO  L435           NwaCegarLoop]: 469 mSDtfsCounter, 2 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 08:30:59,543 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1753 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 08:30:59,543 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 397 states.
[2025-03-08 08:30:59,549 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 395.
[2025-03-08 08:30:59,550 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 395 states, 390 states have (on average 1.4538461538461538) internal successors, (567), 390 states have internal predecessors, (567), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-08 08:30:59,551 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 573 transitions.
[2025-03-08 08:30:59,551 INFO  L78                 Accepts]: Start accepts. Automaton has 395 states and 573 transitions. Word has length 129
[2025-03-08 08:30:59,552 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:30:59,552 INFO  L471      AbstractCegarLoop]: Abstraction has 395 states and 573 transitions.
[2025-03-08 08:30:59,552 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:30:59,552 INFO  L276                IsEmpty]: Start isEmpty. Operand 395 states and 573 transitions.
[2025-03-08 08:30:59,553 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 131
[2025-03-08 08:30:59,553 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:30:59,553 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:30:59,553 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-08 08:30:59,553 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:30:59,553 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:30:59,553 INFO  L85        PathProgramCache]: Analyzing trace with hash -623471812, now seen corresponding path program 1 times
[2025-03-08 08:30:59,554 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:30:59,554 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304639463]
[2025-03-08 08:30:59,554 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:30:59,554 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:30:59,579 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes.
[2025-03-08 08:30:59,638 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements.
[2025-03-08 08:30:59,639 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:30:59,639 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:30:59,877 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-08 08:30:59,878 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:30:59,878 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304639463]
[2025-03-08 08:30:59,878 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304639463] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:30:59,878 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:30:59,878 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 08:30:59,878 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357746917]
[2025-03-08 08:30:59,878 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:30:59,879 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 08:30:59,879 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:30:59,879 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 08:30:59,880 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:30:59,880 INFO  L87              Difference]: Start difference. First operand 395 states and 573 transitions. Second operand  has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:31:00,086 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:00,087 INFO  L93              Difference]: Finished difference Result 720 states and 1042 transitions.
[2025-03-08 08:31:00,087 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 08:31:00,088 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 130
[2025-03-08 08:31:00,088 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:00,090 INFO  L225             Difference]: With dead ends: 720
[2025-03-08 08:31:00,090 INFO  L226             Difference]: Without dead ends: 395
[2025-03-08 08:31:00,091 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-08 08:31:00,091 INFO  L435           NwaCegarLoop]: 444 mSDtfsCounter, 470 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:00,092 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 890 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 08:31:00,092 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 395 states.
[2025-03-08 08:31:00,099 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395.
[2025-03-08 08:31:00,100 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 395 states, 390 states have (on average 1.4512820512820512) internal successors, (566), 390 states have internal predecessors, (566), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-08 08:31:00,101 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 572 transitions.
[2025-03-08 08:31:00,102 INFO  L78                 Accepts]: Start accepts. Automaton has 395 states and 572 transitions. Word has length 130
[2025-03-08 08:31:00,102 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:00,103 INFO  L471      AbstractCegarLoop]: Abstraction has 395 states and 572 transitions.
[2025-03-08 08:31:00,103 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:31:00,103 INFO  L276                IsEmpty]: Start isEmpty. Operand 395 states and 572 transitions.
[2025-03-08 08:31:00,104 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 132
[2025-03-08 08:31:00,104 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:00,104 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:00,104 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-08 08:31:00,104 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:00,105 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:00,105 INFO  L85        PathProgramCache]: Analyzing trace with hash 47394721, now seen corresponding path program 1 times
[2025-03-08 08:31:00,105 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:00,105 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683346014]
[2025-03-08 08:31:00,105 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:00,105 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:00,132 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes.
[2025-03-08 08:31:00,200 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements.
[2025-03-08 08:31:00,200 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:00,200 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:00,423 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-08 08:31:00,423 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:00,423 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683346014]
[2025-03-08 08:31:00,424 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683346014] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:00,424 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:00,424 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 08:31:00,425 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780461842]
[2025-03-08 08:31:00,425 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:00,426 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 08:31:00,426 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:00,426 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 08:31:00,426 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:31:00,426 INFO  L87              Difference]: Start difference. First operand 395 states and 572 transitions. Second operand  has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:31:00,646 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:00,647 INFO  L93              Difference]: Finished difference Result 720 states and 1040 transitions.
[2025-03-08 08:31:00,647 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 08:31:00,647 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 131
[2025-03-08 08:31:00,647 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:00,649 INFO  L225             Difference]: With dead ends: 720
[2025-03-08 08:31:00,649 INFO  L226             Difference]: Without dead ends: 395
[2025-03-08 08:31:00,650 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-08 08:31:00,651 INFO  L435           NwaCegarLoop]: 444 mSDtfsCounter, 466 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:00,651 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 897 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 08:31:00,651 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 395 states.
[2025-03-08 08:31:00,657 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395.
[2025-03-08 08:31:00,657 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 395 states, 390 states have (on average 1.4487179487179487) internal successors, (565), 390 states have internal predecessors, (565), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-08 08:31:00,659 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 571 transitions.
[2025-03-08 08:31:00,659 INFO  L78                 Accepts]: Start accepts. Automaton has 395 states and 571 transitions. Word has length 131
[2025-03-08 08:31:00,660 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:00,660 INFO  L471      AbstractCegarLoop]: Abstraction has 395 states and 571 transitions.
[2025-03-08 08:31:00,660 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:31:00,660 INFO  L276                IsEmpty]: Start isEmpty. Operand 395 states and 571 transitions.
[2025-03-08 08:31:00,661 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 133
[2025-03-08 08:31:00,661 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:00,661 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:00,662 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-08 08:31:00,662 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:00,662 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:00,662 INFO  L85        PathProgramCache]: Analyzing trace with hash 772612916, now seen corresponding path program 1 times
[2025-03-08 08:31:00,662 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:00,662 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538728712]
[2025-03-08 08:31:00,662 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:00,662 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:00,702 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes.
[2025-03-08 08:31:00,764 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements.
[2025-03-08 08:31:00,764 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:00,764 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:00,896 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-08 08:31:00,897 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:00,897 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538728712]
[2025-03-08 08:31:00,898 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538728712] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:00,898 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:00,898 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 08:31:00,898 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753498457]
[2025-03-08 08:31:00,898 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:00,898 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 08:31:00,898 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:00,899 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 08:31:00,899 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 08:31:00,899 INFO  L87              Difference]: Start difference. First operand 395 states and 571 transitions. Second operand  has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:31:01,088 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:01,089 INFO  L93              Difference]: Finished difference Result 720 states and 1038 transitions.
[2025-03-08 08:31:01,090 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 08:31:01,090 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 132
[2025-03-08 08:31:01,091 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:01,092 INFO  L225             Difference]: With dead ends: 720
[2025-03-08 08:31:01,092 INFO  L226             Difference]: Without dead ends: 395
[2025-03-08 08:31:01,093 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:31:01,093 INFO  L435           NwaCegarLoop]: 444 mSDtfsCounter, 458 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:01,093 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 890 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 08:31:01,095 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 395 states.
[2025-03-08 08:31:01,100 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395.
[2025-03-08 08:31:01,101 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 395 states, 390 states have (on average 1.4461538461538461) internal successors, (564), 390 states have internal predecessors, (564), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-08 08:31:01,102 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 570 transitions.
[2025-03-08 08:31:01,103 INFO  L78                 Accepts]: Start accepts. Automaton has 395 states and 570 transitions. Word has length 132
[2025-03-08 08:31:01,103 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:01,103 INFO  L471      AbstractCegarLoop]: Abstraction has 395 states and 570 transitions.
[2025-03-08 08:31:01,103 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:31:01,103 INFO  L276                IsEmpty]: Start isEmpty. Operand 395 states and 570 transitions.
[2025-03-08 08:31:01,104 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2025-03-08 08:31:01,104 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:01,105 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:01,105 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-08 08:31:01,105 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:01,105 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:01,105 INFO  L85        PathProgramCache]: Analyzing trace with hash -554082729, now seen corresponding path program 1 times
[2025-03-08 08:31:01,106 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:01,106 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136506752]
[2025-03-08 08:31:01,106 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:01,106 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:01,132 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes.
[2025-03-08 08:31:01,190 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements.
[2025-03-08 08:31:01,191 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:01,191 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:01,535 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-08 08:31:01,535 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:01,535 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136506752]
[2025-03-08 08:31:01,535 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136506752] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:01,535 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:01,535 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 08:31:01,536 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891206252]
[2025-03-08 08:31:01,536 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:01,536 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 08:31:01,536 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:01,536 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 08:31:01,536 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-08 08:31:01,537 INFO  L87              Difference]: Start difference. First operand 395 states and 570 transitions. Second operand  has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:31:01,954 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:01,954 INFO  L93              Difference]: Finished difference Result 757 states and 1078 transitions.
[2025-03-08 08:31:01,955 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 08:31:01,955 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 133
[2025-03-08 08:31:01,955 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:01,956 INFO  L225             Difference]: With dead ends: 757
[2025-03-08 08:31:01,957 INFO  L226             Difference]: Without dead ends: 428
[2025-03-08 08:31:01,957 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-03-08 08:31:01,957 INFO  L435           NwaCegarLoop]: 482 mSDtfsCounter, 40 mSDsluCounter, 1773 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 2255 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:01,958 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 2255 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 08:31:01,958 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 428 states.
[2025-03-08 08:31:01,966 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 393.
[2025-03-08 08:31:01,967 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 393 states, 388 states have (on average 1.4458762886597938) internal successors, (561), 388 states have internal predecessors, (561), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-08 08:31:01,969 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 567 transitions.
[2025-03-08 08:31:01,969 INFO  L78                 Accepts]: Start accepts. Automaton has 393 states and 567 transitions. Word has length 133
[2025-03-08 08:31:01,969 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:01,969 INFO  L471      AbstractCegarLoop]: Abstraction has 393 states and 567 transitions.
[2025-03-08 08:31:01,970 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:31:01,970 INFO  L276                IsEmpty]: Start isEmpty. Operand 393 states and 567 transitions.
[2025-03-08 08:31:01,971 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2025-03-08 08:31:01,971 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:01,971 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:01,971 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-08 08:31:01,971 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:01,971 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:01,971 INFO  L85        PathProgramCache]: Analyzing trace with hash 312608028, now seen corresponding path program 1 times
[2025-03-08 08:31:01,971 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:01,972 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441177456]
[2025-03-08 08:31:01,972 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:01,972 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:01,998 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes.
[2025-03-08 08:31:02,049 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements.
[2025-03-08 08:31:02,049 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:02,049 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:02,272 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-08 08:31:02,274 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:02,274 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441177456]
[2025-03-08 08:31:02,274 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441177456] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:02,274 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:02,274 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 08:31:02,274 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328450368]
[2025-03-08 08:31:02,274 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:02,274 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 08:31:02,274 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:02,275 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 08:31:02,275 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-03-08 08:31:02,275 INFO  L87              Difference]: Start difference. First operand 393 states and 567 transitions. Second operand  has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:31:02,696 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:02,696 INFO  L93              Difference]: Finished difference Result 780 states and 1123 transitions.
[2025-03-08 08:31:02,697 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 08:31:02,697 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 133
[2025-03-08 08:31:02,697 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:02,698 INFO  L225             Difference]: With dead ends: 780
[2025-03-08 08:31:02,698 INFO  L226             Difference]: Without dead ends: 397
[2025-03-08 08:31:02,699 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2025-03-08 08:31:02,699 INFO  L435           NwaCegarLoop]: 498 mSDtfsCounter, 585 mSDsluCounter, 1836 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 2334 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:02,700 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 2334 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 08:31:02,700 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 397 states.
[2025-03-08 08:31:02,706 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 395.
[2025-03-08 08:31:02,706 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 395 states, 390 states have (on average 1.441025641025641) internal successors, (562), 390 states have internal predecessors, (562), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-08 08:31:02,708 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 568 transitions.
[2025-03-08 08:31:02,708 INFO  L78                 Accepts]: Start accepts. Automaton has 395 states and 568 transitions. Word has length 133
[2025-03-08 08:31:02,708 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:02,708 INFO  L471      AbstractCegarLoop]: Abstraction has 395 states and 568 transitions.
[2025-03-08 08:31:02,708 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:31:02,708 INFO  L276                IsEmpty]: Start isEmpty. Operand 395 states and 568 transitions.
[2025-03-08 08:31:02,709 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2025-03-08 08:31:02,709 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:02,709 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:02,709 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-08 08:31:02,709 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:02,710 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:02,710 INFO  L85        PathProgramCache]: Analyzing trace with hash -336419700, now seen corresponding path program 1 times
[2025-03-08 08:31:02,710 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:02,710 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642351660]
[2025-03-08 08:31:02,710 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:02,710 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:02,740 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-03-08 08:31:02,801 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-03-08 08:31:02,801 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:02,801 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:03,154 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-08 08:31:03,155 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:03,155 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642351660]
[2025-03-08 08:31:03,155 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642351660] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:03,155 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:03,155 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 08:31:03,155 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739168209]
[2025-03-08 08:31:03,155 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:03,156 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 08:31:03,156 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:03,156 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 08:31:03,156 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:31:03,156 INFO  L87              Difference]: Start difference. First operand 395 states and 568 transitions. Second operand  has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:31:03,375 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:03,375 INFO  L93              Difference]: Finished difference Result 764 states and 1086 transitions.
[2025-03-08 08:31:03,375 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 08:31:03,376 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 134
[2025-03-08 08:31:03,376 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:03,377 INFO  L225             Difference]: With dead ends: 764
[2025-03-08 08:31:03,377 INFO  L226             Difference]: Without dead ends: 439
[2025-03-08 08:31:03,378 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:31:03,378 INFO  L435           NwaCegarLoop]: 464 mSDtfsCounter, 18 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:03,378 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1848 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 08:31:03,379 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 439 states.
[2025-03-08 08:31:03,385 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 437.
[2025-03-08 08:31:03,386 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 437 states, 432 states have (on average 1.4166666666666667) internal successors, (612), 432 states have internal predecessors, (612), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-03-08 08:31:03,388 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 618 transitions.
[2025-03-08 08:31:03,388 INFO  L78                 Accepts]: Start accepts. Automaton has 437 states and 618 transitions. Word has length 134
[2025-03-08 08:31:03,388 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:03,388 INFO  L471      AbstractCegarLoop]: Abstraction has 437 states and 618 transitions.
[2025-03-08 08:31:03,388 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:31:03,388 INFO  L276                IsEmpty]: Start isEmpty. Operand 437 states and 618 transitions.
[2025-03-08 08:31:03,389 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 136
[2025-03-08 08:31:03,389 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:03,389 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:03,389 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-03-08 08:31:03,389 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:03,390 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:03,390 INFO  L85        PathProgramCache]: Analyzing trace with hash 49286719, now seen corresponding path program 1 times
[2025-03-08 08:31:03,390 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:03,390 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073789811]
[2025-03-08 08:31:03,390 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:03,390 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:03,418 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes.
[2025-03-08 08:31:03,470 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements.
[2025-03-08 08:31:03,470 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:03,470 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:03,821 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-08 08:31:03,821 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:03,821 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073789811]
[2025-03-08 08:31:03,821 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073789811] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:03,821 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:03,821 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 08:31:03,822 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087329267]
[2025-03-08 08:31:03,822 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:03,822 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 08:31:03,822 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:03,822 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 08:31:03,823 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-08 08:31:03,823 INFO  L87              Difference]: Start difference. First operand 437 states and 618 transitions. Second operand  has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:31:04,101 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:04,102 INFO  L93              Difference]: Finished difference Result 968 states and 1349 transitions.
[2025-03-08 08:31:04,102 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 08:31:04,102 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 135
[2025-03-08 08:31:04,102 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:04,104 INFO  L225             Difference]: With dead ends: 968
[2025-03-08 08:31:04,104 INFO  L226             Difference]: Without dead ends: 601
[2025-03-08 08:31:04,105 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2025-03-08 08:31:04,105 INFO  L435           NwaCegarLoop]: 457 mSDtfsCounter, 853 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:04,106 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 1823 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 08:31:04,106 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 601 states.
[2025-03-08 08:31:04,120 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601.
[2025-03-08 08:31:04,121 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 601 states, 593 states have (on average 1.3861720067453627) internal successors, (822), 593 states have internal predecessors, (822), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-03-08 08:31:04,123 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 834 transitions.
[2025-03-08 08:31:04,123 INFO  L78                 Accepts]: Start accepts. Automaton has 601 states and 834 transitions. Word has length 135
[2025-03-08 08:31:04,124 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:04,124 INFO  L471      AbstractCegarLoop]: Abstraction has 601 states and 834 transitions.
[2025-03-08 08:31:04,124 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:31:04,124 INFO  L276                IsEmpty]: Start isEmpty. Operand 601 states and 834 transitions.
[2025-03-08 08:31:04,126 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 325
[2025-03-08 08:31:04,126 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:04,127 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:04,127 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-03-08 08:31:04,127 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:04,127 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:04,127 INFO  L85        PathProgramCache]: Analyzing trace with hash -173946213, now seen corresponding path program 1 times
[2025-03-08 08:31:04,127 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:04,128 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437265751]
[2025-03-08 08:31:04,128 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:04,128 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:04,194 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes.
[2025-03-08 08:31:04,287 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements.
[2025-03-08 08:31:04,288 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:04,288 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:04,615 INFO  L134       CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-03-08 08:31:04,615 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:04,616 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437265751]
[2025-03-08 08:31:04,616 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437265751] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:04,616 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:04,616 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 08:31:04,616 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791421186]
[2025-03-08 08:31:04,616 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:04,616 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 08:31:04,616 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:04,617 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 08:31:04,617 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:31:04,617 INFO  L87              Difference]: Start difference. First operand 601 states and 834 transitions. Second operand  has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:04,802 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:04,802 INFO  L93              Difference]: Finished difference Result 968 states and 1348 transitions.
[2025-03-08 08:31:04,802 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 08:31:04,803 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 324
[2025-03-08 08:31:04,803 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:04,805 INFO  L225             Difference]: With dead ends: 968
[2025-03-08 08:31:04,805 INFO  L226             Difference]: Without dead ends: 601
[2025-03-08 08:31:04,806 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-08 08:31:04,806 INFO  L435           NwaCegarLoop]: 442 mSDtfsCounter, 934 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:04,806 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 886 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 08:31:04,807 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 601 states.
[2025-03-08 08:31:04,817 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601.
[2025-03-08 08:31:04,817 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 601 states, 593 states have (on average 1.384485666104553) internal successors, (821), 593 states have internal predecessors, (821), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-03-08 08:31:04,819 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 833 transitions.
[2025-03-08 08:31:04,819 INFO  L78                 Accepts]: Start accepts. Automaton has 601 states and 833 transitions. Word has length 324
[2025-03-08 08:31:04,820 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:04,820 INFO  L471      AbstractCegarLoop]: Abstraction has 601 states and 833 transitions.
[2025-03-08 08:31:04,820 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:04,820 INFO  L276                IsEmpty]: Start isEmpty. Operand 601 states and 833 transitions.
[2025-03-08 08:31:04,822 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 326
[2025-03-08 08:31:04,822 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:04,823 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:04,823 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-03-08 08:31:04,823 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:04,823 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:04,823 INFO  L85        PathProgramCache]: Analyzing trace with hash -1352169827, now seen corresponding path program 1 times
[2025-03-08 08:31:04,823 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:04,824 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086751999]
[2025-03-08 08:31:04,824 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:04,824 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:04,885 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes.
[2025-03-08 08:31:04,993 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements.
[2025-03-08 08:31:04,994 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:04,994 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:05,258 INFO  L134       CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-03-08 08:31:05,259 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:05,259 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086751999]
[2025-03-08 08:31:05,259 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086751999] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:05,259 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:05,259 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 08:31:05,259 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081923485]
[2025-03-08 08:31:05,259 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:05,260 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 08:31:05,260 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:05,260 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 08:31:05,260 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:31:05,260 INFO  L87              Difference]: Start difference. First operand 601 states and 833 transitions. Second operand  has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:05,442 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:05,443 INFO  L93              Difference]: Finished difference Result 968 states and 1346 transitions.
[2025-03-08 08:31:05,443 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 08:31:05,443 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 325
[2025-03-08 08:31:05,444 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:05,445 INFO  L225             Difference]: With dead ends: 968
[2025-03-08 08:31:05,445 INFO  L226             Difference]: Without dead ends: 601
[2025-03-08 08:31:05,446 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-08 08:31:05,447 INFO  L435           NwaCegarLoop]: 442 mSDtfsCounter, 918 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:05,447 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 886 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 08:31:05,448 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 601 states.
[2025-03-08 08:31:05,457 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601.
[2025-03-08 08:31:05,458 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 601 states, 593 states have (on average 1.3827993254637436) internal successors, (820), 593 states have internal predecessors, (820), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-03-08 08:31:05,459 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 832 transitions.
[2025-03-08 08:31:05,459 INFO  L78                 Accepts]: Start accepts. Automaton has 601 states and 832 transitions. Word has length 325
[2025-03-08 08:31:05,460 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:05,460 INFO  L471      AbstractCegarLoop]: Abstraction has 601 states and 832 transitions.
[2025-03-08 08:31:05,460 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:05,460 INFO  L276                IsEmpty]: Start isEmpty. Operand 601 states and 832 transitions.
[2025-03-08 08:31:05,463 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 327
[2025-03-08 08:31:05,463 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:05,463 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:05,463 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-03-08 08:31:05,463 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:05,463 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:05,464 INFO  L85        PathProgramCache]: Analyzing trace with hash -939333654, now seen corresponding path program 1 times
[2025-03-08 08:31:05,464 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:05,464 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047148052]
[2025-03-08 08:31:05,464 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:05,464 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:05,527 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes.
[2025-03-08 08:31:05,599 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements.
[2025-03-08 08:31:05,599 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:05,599 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:05,915 INFO  L134       CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-03-08 08:31:05,916 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:05,916 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047148052]
[2025-03-08 08:31:05,916 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047148052] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:05,916 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:05,916 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 08:31:05,916 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511368521]
[2025-03-08 08:31:05,916 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:05,917 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 08:31:05,917 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:05,917 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 08:31:05,918 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:31:05,918 INFO  L87              Difference]: Start difference. First operand 601 states and 832 transitions. Second operand  has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:06,097 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:06,097 INFO  L93              Difference]: Finished difference Result 968 states and 1344 transitions.
[2025-03-08 08:31:06,098 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 08:31:06,098 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 326
[2025-03-08 08:31:06,098 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:06,100 INFO  L225             Difference]: With dead ends: 968
[2025-03-08 08:31:06,101 INFO  L226             Difference]: Without dead ends: 601
[2025-03-08 08:31:06,101 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-08 08:31:06,102 INFO  L435           NwaCegarLoop]: 442 mSDtfsCounter, 902 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:06,102 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 886 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 08:31:06,103 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 601 states.
[2025-03-08 08:31:06,113 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601.
[2025-03-08 08:31:06,114 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 601 states, 593 states have (on average 1.3811129848229342) internal successors, (819), 593 states have internal predecessors, (819), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-03-08 08:31:06,116 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 831 transitions.
[2025-03-08 08:31:06,117 INFO  L78                 Accepts]: Start accepts. Automaton has 601 states and 831 transitions. Word has length 326
[2025-03-08 08:31:06,117 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:06,117 INFO  L471      AbstractCegarLoop]: Abstraction has 601 states and 831 transitions.
[2025-03-08 08:31:06,117 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:06,117 INFO  L276                IsEmpty]: Start isEmpty. Operand 601 states and 831 transitions.
[2025-03-08 08:31:06,120 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 328
[2025-03-08 08:31:06,120 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:06,120 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:06,120 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-03-08 08:31:06,121 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:06,121 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:06,121 INFO  L85        PathProgramCache]: Analyzing trace with hash 1325401228, now seen corresponding path program 1 times
[2025-03-08 08:31:06,121 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:06,121 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483499552]
[2025-03-08 08:31:06,121 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:06,122 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:06,184 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes.
[2025-03-08 08:31:06,255 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements.
[2025-03-08 08:31:06,256 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:06,256 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:06,527 INFO  L134       CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-03-08 08:31:06,527 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:06,527 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483499552]
[2025-03-08 08:31:06,527 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483499552] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:06,527 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:06,527 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 08:31:06,527 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483971377]
[2025-03-08 08:31:06,528 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:06,528 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 08:31:06,528 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:06,528 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 08:31:06,528 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:31:06,529 INFO  L87              Difference]: Start difference. First operand 601 states and 831 transitions. Second operand  has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:06,702 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:06,702 INFO  L93              Difference]: Finished difference Result 968 states and 1342 transitions.
[2025-03-08 08:31:06,702 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 08:31:06,703 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 327
[2025-03-08 08:31:06,703 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:06,705 INFO  L225             Difference]: With dead ends: 968
[2025-03-08 08:31:06,705 INFO  L226             Difference]: Without dead ends: 601
[2025-03-08 08:31:06,705 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-08 08:31:06,705 INFO  L435           NwaCegarLoop]: 442 mSDtfsCounter, 489 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:06,706 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 893 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 08:31:06,706 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 601 states.
[2025-03-08 08:31:06,714 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601.
[2025-03-08 08:31:06,715 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 601 states, 593 states have (on average 1.3794266441821248) internal successors, (818), 593 states have internal predecessors, (818), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-03-08 08:31:06,717 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 830 transitions.
[2025-03-08 08:31:06,717 INFO  L78                 Accepts]: Start accepts. Automaton has 601 states and 830 transitions. Word has length 327
[2025-03-08 08:31:06,717 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:06,717 INFO  L471      AbstractCegarLoop]: Abstraction has 601 states and 830 transitions.
[2025-03-08 08:31:06,718 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:06,718 INFO  L276                IsEmpty]: Start isEmpty. Operand 601 states and 830 transitions.
[2025-03-08 08:31:06,720 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 329
[2025-03-08 08:31:06,720 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:06,720 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:06,720 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-03-08 08:31:06,720 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:06,721 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:06,721 INFO  L85        PathProgramCache]: Analyzing trace with hash 260044729, now seen corresponding path program 1 times
[2025-03-08 08:31:06,721 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:06,721 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547280308]
[2025-03-08 08:31:06,721 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:06,721 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:06,777 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes.
[2025-03-08 08:31:06,849 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements.
[2025-03-08 08:31:06,849 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:06,849 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:07,285 INFO  L134       CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-03-08 08:31:07,285 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:07,286 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547280308]
[2025-03-08 08:31:07,286 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547280308] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:07,286 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:07,286 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 08:31:07,286 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088729708]
[2025-03-08 08:31:07,286 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:07,287 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 08:31:07,287 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:07,287 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 08:31:07,287 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:31:07,288 INFO  L87              Difference]: Start difference. First operand 601 states and 830 transitions. Second operand  has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:07,460 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:07,461 INFO  L93              Difference]: Finished difference Result 968 states and 1340 transitions.
[2025-03-08 08:31:07,461 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 08:31:07,461 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 328
[2025-03-08 08:31:07,462 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:07,464 INFO  L225             Difference]: With dead ends: 968
[2025-03-08 08:31:07,464 INFO  L226             Difference]: Without dead ends: 601
[2025-03-08 08:31:07,464 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-08 08:31:07,465 INFO  L435           NwaCegarLoop]: 450 mSDtfsCounter, 474 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:07,466 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 909 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 08:31:07,467 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 601 states.
[2025-03-08 08:31:07,479 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601.
[2025-03-08 08:31:07,482 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 601 states, 593 states have (on average 1.3777403035413154) internal successors, (817), 593 states have internal predecessors, (817), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-03-08 08:31:07,484 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 829 transitions.
[2025-03-08 08:31:07,484 INFO  L78                 Accepts]: Start accepts. Automaton has 601 states and 829 transitions. Word has length 328
[2025-03-08 08:31:07,484 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:07,484 INFO  L471      AbstractCegarLoop]: Abstraction has 601 states and 829 transitions.
[2025-03-08 08:31:07,485 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:07,485 INFO  L276                IsEmpty]: Start isEmpty. Operand 601 states and 829 transitions.
[2025-03-08 08:31:07,490 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 330
[2025-03-08 08:31:07,491 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:07,491 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:07,491 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2025-03-08 08:31:07,491 INFO  L396      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:07,492 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:07,492 INFO  L85        PathProgramCache]: Analyzing trace with hash -1740407557, now seen corresponding path program 1 times
[2025-03-08 08:31:07,492 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:07,492 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65580943]
[2025-03-08 08:31:07,492 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:07,492 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:07,569 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes.
[2025-03-08 08:31:07,641 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements.
[2025-03-08 08:31:07,642 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:07,642 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:07,963 INFO  L134       CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-03-08 08:31:07,963 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:07,963 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65580943]
[2025-03-08 08:31:07,963 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65580943] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:07,963 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:07,964 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 08:31:07,964 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808495230]
[2025-03-08 08:31:07,964 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:07,964 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 08:31:07,964 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:07,965 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 08:31:07,965 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:31:07,965 INFO  L87              Difference]: Start difference. First operand 601 states and 829 transitions. Second operand  has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:08,120 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:08,120 INFO  L93              Difference]: Finished difference Result 968 states and 1338 transitions.
[2025-03-08 08:31:08,120 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 08:31:08,120 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 329
[2025-03-08 08:31:08,121 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:08,122 INFO  L225             Difference]: With dead ends: 968
[2025-03-08 08:31:08,123 INFO  L226             Difference]: Without dead ends: 601
[2025-03-08 08:31:08,123 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-08 08:31:08,123 INFO  L435           NwaCegarLoop]: 450 mSDtfsCounter, 847 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:08,124 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 902 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 08:31:08,124 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 601 states.
[2025-03-08 08:31:08,133 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601.
[2025-03-08 08:31:08,133 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 601 states, 593 states have (on average 1.376053962900506) internal successors, (816), 593 states have internal predecessors, (816), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-03-08 08:31:08,136 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 828 transitions.
[2025-03-08 08:31:08,136 INFO  L78                 Accepts]: Start accepts. Automaton has 601 states and 828 transitions. Word has length 329
[2025-03-08 08:31:08,137 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:08,137 INFO  L471      AbstractCegarLoop]: Abstraction has 601 states and 828 transitions.
[2025-03-08 08:31:08,137 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:08,137 INFO  L276                IsEmpty]: Start isEmpty. Operand 601 states and 828 transitions.
[2025-03-08 08:31:08,139 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 331
[2025-03-08 08:31:08,139 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:08,139 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:08,140 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2025-03-08 08:31:08,140 INFO  L396      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:08,140 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:08,140 INFO  L85        PathProgramCache]: Analyzing trace with hash 871610888, now seen corresponding path program 1 times
[2025-03-08 08:31:08,140 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:08,140 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802802488]
[2025-03-08 08:31:08,140 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:08,140 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:08,198 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes.
[2025-03-08 08:31:08,266 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements.
[2025-03-08 08:31:08,266 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:08,266 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:08,566 INFO  L134       CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-03-08 08:31:08,567 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:08,567 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802802488]
[2025-03-08 08:31:08,567 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802802488] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:08,568 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:08,568 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 08:31:08,568 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583426514]
[2025-03-08 08:31:08,568 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:08,569 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 08:31:08,569 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:08,569 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 08:31:08,569 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:31:08,569 INFO  L87              Difference]: Start difference. First operand 601 states and 828 transitions. Second operand  has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:08,847 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:08,847 INFO  L93              Difference]: Finished difference Result 968 states and 1336 transitions.
[2025-03-08 08:31:08,847 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 08:31:08,848 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 330
[2025-03-08 08:31:08,848 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:08,850 INFO  L225             Difference]: With dead ends: 968
[2025-03-08 08:31:08,850 INFO  L226             Difference]: Without dead ends: 601
[2025-03-08 08:31:08,851 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-08 08:31:08,851 INFO  L435           NwaCegarLoop]: 337 mSDtfsCounter, 787 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:08,852 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 676 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 08:31:08,853 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 601 states.
[2025-03-08 08:31:08,861 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601.
[2025-03-08 08:31:08,862 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 601 states, 593 states have (on average 1.3743676222596966) internal successors, (815), 593 states have internal predecessors, (815), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-03-08 08:31:08,863 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 827 transitions.
[2025-03-08 08:31:08,863 INFO  L78                 Accepts]: Start accepts. Automaton has 601 states and 827 transitions. Word has length 330
[2025-03-08 08:31:08,863 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:08,863 INFO  L471      AbstractCegarLoop]: Abstraction has 601 states and 827 transitions.
[2025-03-08 08:31:08,864 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:08,864 INFO  L276                IsEmpty]: Start isEmpty. Operand 601 states and 827 transitions.
[2025-03-08 08:31:08,865 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 332
[2025-03-08 08:31:08,865 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:08,866 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:08,866 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2025-03-08 08:31:08,866 INFO  L396      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:08,866 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:08,866 INFO  L85        PathProgramCache]: Analyzing trace with hash 955428842, now seen corresponding path program 1 times
[2025-03-08 08:31:08,866 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:08,866 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025070781]
[2025-03-08 08:31:08,867 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:08,867 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:08,923 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes.
[2025-03-08 08:31:09,138 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements.
[2025-03-08 08:31:09,139 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:09,139 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:09,549 INFO  L134       CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-03-08 08:31:09,550 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:09,550 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025070781]
[2025-03-08 08:31:09,550 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025070781] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:09,550 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:09,550 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 08:31:09,550 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257994975]
[2025-03-08 08:31:09,550 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:09,551 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 08:31:09,551 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:09,551 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 08:31:09,551 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 08:31:09,551 INFO  L87              Difference]: Start difference. First operand 601 states and 827 transitions. Second operand  has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:09,694 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:09,694 INFO  L93              Difference]: Finished difference Result 968 states and 1334 transitions.
[2025-03-08 08:31:09,694 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 08:31:09,695 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 331
[2025-03-08 08:31:09,695 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:09,697 INFO  L225             Difference]: With dead ends: 968
[2025-03-08 08:31:09,697 INFO  L226             Difference]: Without dead ends: 601
[2025-03-08 08:31:09,697 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:31:09,698 INFO  L435           NwaCegarLoop]: 449 mSDtfsCounter, 380 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:09,698 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 900 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 08:31:09,700 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 601 states.
[2025-03-08 08:31:09,707 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601.
[2025-03-08 08:31:09,708 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 601 states, 593 states have (on average 1.372681281618887) internal successors, (814), 593 states have internal predecessors, (814), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-03-08 08:31:09,709 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 826 transitions.
[2025-03-08 08:31:09,709 INFO  L78                 Accepts]: Start accepts. Automaton has 601 states and 826 transitions. Word has length 331
[2025-03-08 08:31:09,709 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:09,709 INFO  L471      AbstractCegarLoop]: Abstraction has 601 states and 826 transitions.
[2025-03-08 08:31:09,710 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:09,710 INFO  L276                IsEmpty]: Start isEmpty. Operand 601 states and 826 transitions.
[2025-03-08 08:31:09,711 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 333
[2025-03-08 08:31:09,711 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:09,711 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:09,712 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2025-03-08 08:31:09,712 INFO  L396      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:09,712 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:09,712 INFO  L85        PathProgramCache]: Analyzing trace with hash -806249323, now seen corresponding path program 1 times
[2025-03-08 08:31:09,712 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:09,712 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150332651]
[2025-03-08 08:31:09,712 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:09,712 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:09,768 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes.
[2025-03-08 08:31:09,990 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements.
[2025-03-08 08:31:09,991 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:09,991 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:10,485 INFO  L134       CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-03-08 08:31:10,486 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:10,486 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150332651]
[2025-03-08 08:31:10,486 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150332651] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:10,486 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:10,486 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 08:31:10,486 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672249477]
[2025-03-08 08:31:10,486 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:10,487 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 08:31:10,487 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:10,487 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 08:31:10,488 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:31:10,488 INFO  L87              Difference]: Start difference. First operand 601 states and 826 transitions. Second operand  has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:10,680 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:10,680 INFO  L93              Difference]: Finished difference Result 968 states and 1332 transitions.
[2025-03-08 08:31:10,681 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 08:31:10,681 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 332
[2025-03-08 08:31:10,681 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:10,683 INFO  L225             Difference]: With dead ends: 968
[2025-03-08 08:31:10,683 INFO  L226             Difference]: Without dead ends: 601
[2025-03-08 08:31:10,683 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-08 08:31:10,684 INFO  L435           NwaCegarLoop]: 438 mSDtfsCounter, 453 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:10,684 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 885 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 08:31:10,685 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 601 states.
[2025-03-08 08:31:10,692 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601.
[2025-03-08 08:31:10,693 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 601 states, 593 states have (on average 1.3709949409780775) internal successors, (813), 593 states have internal predecessors, (813), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-03-08 08:31:10,694 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 825 transitions.
[2025-03-08 08:31:10,694 INFO  L78                 Accepts]: Start accepts. Automaton has 601 states and 825 transitions. Word has length 332
[2025-03-08 08:31:10,694 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:10,694 INFO  L471      AbstractCegarLoop]: Abstraction has 601 states and 825 transitions.
[2025-03-08 08:31:10,694 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:10,695 INFO  L276                IsEmpty]: Start isEmpty. Operand 601 states and 825 transitions.
[2025-03-08 08:31:10,696 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 334
[2025-03-08 08:31:10,696 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:10,696 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:10,696 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2025-03-08 08:31:10,696 INFO  L396      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:10,696 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:10,697 INFO  L85        PathProgramCache]: Analyzing trace with hash -2020608399, now seen corresponding path program 1 times
[2025-03-08 08:31:10,697 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:10,697 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412440772]
[2025-03-08 08:31:10,697 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:10,697 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:10,751 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes.
[2025-03-08 08:31:10,963 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements.
[2025-03-08 08:31:10,964 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:10,964 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:11,314 INFO  L134       CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-03-08 08:31:11,315 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:11,315 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412440772]
[2025-03-08 08:31:11,317 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412440772] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:11,317 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:11,317 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 08:31:11,317 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806494327]
[2025-03-08 08:31:11,317 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:11,317 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 08:31:11,317 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:11,318 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 08:31:11,318 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:31:11,318 INFO  L87              Difference]: Start difference. First operand 601 states and 825 transitions. Second operand  has 5 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:11,519 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:11,519 INFO  L93              Difference]: Finished difference Result 968 states and 1330 transitions.
[2025-03-08 08:31:11,519 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 08:31:11,519 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 333
[2025-03-08 08:31:11,519 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:11,521 INFO  L225             Difference]: With dead ends: 968
[2025-03-08 08:31:11,521 INFO  L226             Difference]: Without dead ends: 601
[2025-03-08 08:31:11,522 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-08 08:31:11,522 INFO  L435           NwaCegarLoop]: 438 mSDtfsCounter, 452 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:11,524 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 885 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 08:31:11,525 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 601 states.
[2025-03-08 08:31:11,534 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601.
[2025-03-08 08:31:11,534 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 601 states, 593 states have (on average 1.369308600337268) internal successors, (812), 593 states have internal predecessors, (812), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-03-08 08:31:11,535 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 824 transitions.
[2025-03-08 08:31:11,535 INFO  L78                 Accepts]: Start accepts. Automaton has 601 states and 824 transitions. Word has length 333
[2025-03-08 08:31:11,536 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:11,536 INFO  L471      AbstractCegarLoop]: Abstraction has 601 states and 824 transitions.
[2025-03-08 08:31:11,536 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:11,536 INFO  L276                IsEmpty]: Start isEmpty. Operand 601 states and 824 transitions.
[2025-03-08 08:31:11,537 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 335
[2025-03-08 08:31:11,537 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:11,537 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:11,538 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2025-03-08 08:31:11,538 INFO  L396      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:11,538 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:11,538 INFO  L85        PathProgramCache]: Analyzing trace with hash -1741685985, now seen corresponding path program 1 times
[2025-03-08 08:31:11,538 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:11,538 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002665141]
[2025-03-08 08:31:11,538 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:11,538 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:11,592 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes.
[2025-03-08 08:31:11,817 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements.
[2025-03-08 08:31:11,817 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:11,817 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:12,166 INFO  L134       CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-03-08 08:31:12,166 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:12,166 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002665141]
[2025-03-08 08:31:12,166 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002665141] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:12,166 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:12,166 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 08:31:12,166 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569305044]
[2025-03-08 08:31:12,166 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:12,167 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 08:31:12,167 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:12,168 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 08:31:12,168 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 08:31:12,168 INFO  L87              Difference]: Start difference. First operand 601 states and 824 transitions. Second operand  has 4 states, 4 states have (on average 76.75) internal successors, (307), 4 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:12,357 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:12,357 INFO  L93              Difference]: Finished difference Result 968 states and 1328 transitions.
[2025-03-08 08:31:12,357 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 08:31:12,357 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 76.75) internal successors, (307), 4 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 334
[2025-03-08 08:31:12,358 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:12,359 INFO  L225             Difference]: With dead ends: 968
[2025-03-08 08:31:12,359 INFO  L226             Difference]: Without dead ends: 601
[2025-03-08 08:31:12,360 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:31:12,360 INFO  L435           NwaCegarLoop]: 438 mSDtfsCounter, 389 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:12,360 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 878 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 08:31:12,361 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 601 states.
[2025-03-08 08:31:12,370 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601.
[2025-03-08 08:31:12,371 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 601 states, 593 states have (on average 1.3676222596964587) internal successors, (811), 593 states have internal predecessors, (811), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-03-08 08:31:12,372 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 823 transitions.
[2025-03-08 08:31:12,372 INFO  L78                 Accepts]: Start accepts. Automaton has 601 states and 823 transitions. Word has length 334
[2025-03-08 08:31:12,372 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:12,372 INFO  L471      AbstractCegarLoop]: Abstraction has 601 states and 823 transitions.
[2025-03-08 08:31:12,372 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 76.75) internal successors, (307), 4 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:12,372 INFO  L276                IsEmpty]: Start isEmpty. Operand 601 states and 823 transitions.
[2025-03-08 08:31:12,374 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 336
[2025-03-08 08:31:12,374 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:12,374 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:12,375 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2025-03-08 08:31:12,375 INFO  L396      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:12,375 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:12,375 INFO  L85        PathProgramCache]: Analyzing trace with hash 1985709928, now seen corresponding path program 1 times
[2025-03-08 08:31:12,375 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:12,375 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719313275]
[2025-03-08 08:31:12,375 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:12,375 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:12,429 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes.
[2025-03-08 08:31:12,761 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements.
[2025-03-08 08:31:12,761 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:12,762 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:13,132 INFO  L134       CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-03-08 08:31:13,132 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:13,132 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719313275]
[2025-03-08 08:31:13,132 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719313275] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:13,133 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:13,133 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 08:31:13,133 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977781375]
[2025-03-08 08:31:13,133 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:13,133 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 08:31:13,133 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:13,135 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 08:31:13,135 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 08:31:13,135 INFO  L87              Difference]: Start difference. First operand 601 states and 823 transitions. Second operand  has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:13,624 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:13,624 INFO  L93              Difference]: Finished difference Result 1405 states and 1931 transitions.
[2025-03-08 08:31:13,624 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 08:31:13,624 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 335
[2025-03-08 08:31:13,625 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:13,627 INFO  L225             Difference]: With dead ends: 1405
[2025-03-08 08:31:13,628 INFO  L226             Difference]: Without dead ends: 1038
[2025-03-08 08:31:13,630 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-08 08:31:13,630 INFO  L435           NwaCegarLoop]: 385 mSDtfsCounter, 586 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:13,631 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 1648 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 08:31:13,634 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1038 states.
[2025-03-08 08:31:13,648 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 924.
[2025-03-08 08:31:13,650 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 924 states, 913 states have (on average 1.3636363636363635) internal successors, (1245), 913 states have internal predecessors, (1245), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2025-03-08 08:31:13,651 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1263 transitions.
[2025-03-08 08:31:13,651 INFO  L78                 Accepts]: Start accepts. Automaton has 924 states and 1263 transitions. Word has length 335
[2025-03-08 08:31:13,652 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:13,652 INFO  L471      AbstractCegarLoop]: Abstraction has 924 states and 1263 transitions.
[2025-03-08 08:31:13,652 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:13,652 INFO  L276                IsEmpty]: Start isEmpty. Operand 924 states and 1263 transitions.
[2025-03-08 08:31:13,654 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 337
[2025-03-08 08:31:13,654 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:13,654 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:13,655 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2025-03-08 08:31:13,655 INFO  L396      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:13,655 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:13,655 INFO  L85        PathProgramCache]: Analyzing trace with hash -1805089870, now seen corresponding path program 1 times
[2025-03-08 08:31:13,655 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:13,655 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833133658]
[2025-03-08 08:31:13,655 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:13,656 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:13,707 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes.
[2025-03-08 08:31:14,050 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements.
[2025-03-08 08:31:14,050 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:14,050 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:14,766 INFO  L134       CoverageAnalysis]: Checked inductivity of 144 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked.
[2025-03-08 08:31:14,766 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:14,766 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833133658]
[2025-03-08 08:31:14,766 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833133658] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:14,767 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:14,767 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 08:31:14,767 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159037510]
[2025-03-08 08:31:14,767 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:14,768 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 08:31:14,768 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:14,768 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 08:31:14,768 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:31:14,768 INFO  L87              Difference]: Start difference. First operand 924 states and 1263 transitions. Second operand  has 5 states, 5 states have (on average 55.2) internal successors, (276), 5 states have internal predecessors, (276), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:15,091 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:15,091 INFO  L93              Difference]: Finished difference Result 1597 states and 2157 transitions.
[2025-03-08 08:31:15,091 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 08:31:15,091 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 55.2) internal successors, (276), 5 states have internal predecessors, (276), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 336
[2025-03-08 08:31:15,091 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:15,094 INFO  L225             Difference]: With dead ends: 1597
[2025-03-08 08:31:15,094 INFO  L226             Difference]: Without dead ends: 948
[2025-03-08 08:31:15,095 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:31:15,095 INFO  L435           NwaCegarLoop]: 340 mSDtfsCounter, 467 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:15,095 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1000 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 08:31:15,097 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 948 states.
[2025-03-08 08:31:15,108 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 942.
[2025-03-08 08:31:15,109 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 942 states, 931 states have (on average 1.3566058002148227) internal successors, (1263), 931 states have internal predecessors, (1263), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2025-03-08 08:31:15,109 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1281 transitions.
[2025-03-08 08:31:15,110 INFO  L78                 Accepts]: Start accepts. Automaton has 942 states and 1281 transitions. Word has length 336
[2025-03-08 08:31:15,110 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:15,110 INFO  L471      AbstractCegarLoop]: Abstraction has 942 states and 1281 transitions.
[2025-03-08 08:31:15,110 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 55.2) internal successors, (276), 5 states have internal predecessors, (276), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:15,110 INFO  L276                IsEmpty]: Start isEmpty. Operand 942 states and 1281 transitions.
[2025-03-08 08:31:15,112 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 339
[2025-03-08 08:31:15,112 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:15,112 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:15,113 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2025-03-08 08:31:15,113 INFO  L396      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:15,113 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:15,113 INFO  L85        PathProgramCache]: Analyzing trace with hash 252955742, now seen corresponding path program 1 times
[2025-03-08 08:31:15,113 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:15,113 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143306182]
[2025-03-08 08:31:15,113 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:15,113 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:15,167 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes.
[2025-03-08 08:31:15,463 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements.
[2025-03-08 08:31:15,464 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:15,464 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:16,064 INFO  L134       CoverageAnalysis]: Checked inductivity of 145 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked.
[2025-03-08 08:31:16,064 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:16,064 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143306182]
[2025-03-08 08:31:16,064 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143306182] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:16,064 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:16,065 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 08:31:16,065 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26018586]
[2025-03-08 08:31:16,065 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:16,065 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 08:31:16,066 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:16,066 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 08:31:16,066 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 08:31:16,066 INFO  L87              Difference]: Start difference. First operand 942 states and 1281 transitions. Second operand  has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:31:16,277 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:16,278 INFO  L93              Difference]: Finished difference Result 1597 states and 2151 transitions.
[2025-03-08 08:31:16,278 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 08:31:16,278 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 338
[2025-03-08 08:31:16,278 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:16,280 INFO  L225             Difference]: With dead ends: 1597
[2025-03-08 08:31:16,280 INFO  L226             Difference]: Without dead ends: 942
[2025-03-08 08:31:16,281 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-03-08 08:31:16,281 INFO  L435           NwaCegarLoop]: 341 mSDtfsCounter, 320 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:16,282 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 674 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 08:31:16,282 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 942 states.
[2025-03-08 08:31:16,292 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 924.
[2025-03-08 08:31:16,293 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 924 states, 913 states have (on average 1.357064622124863) internal successors, (1239), 913 states have internal predecessors, (1239), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2025-03-08 08:31:16,294 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1257 transitions.
[2025-03-08 08:31:16,294 INFO  L78                 Accepts]: Start accepts. Automaton has 924 states and 1257 transitions. Word has length 338
[2025-03-08 08:31:16,294 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:16,294 INFO  L471      AbstractCegarLoop]: Abstraction has 924 states and 1257 transitions.
[2025-03-08 08:31:16,294 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:31:16,294 INFO  L276                IsEmpty]: Start isEmpty. Operand 924 states and 1257 transitions.
[2025-03-08 08:31:16,296 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 339
[2025-03-08 08:31:16,296 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:16,296 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:16,297 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2025-03-08 08:31:16,297 INFO  L396      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:16,297 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:16,297 INFO  L85        PathProgramCache]: Analyzing trace with hash 1316003454, now seen corresponding path program 1 times
[2025-03-08 08:31:16,297 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:16,297 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451217824]
[2025-03-08 08:31:16,297 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:16,297 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:16,352 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes.
[2025-03-08 08:31:16,664 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements.
[2025-03-08 08:31:16,665 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:16,665 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:17,208 INFO  L134       CoverageAnalysis]: Checked inductivity of 145 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-03-08 08:31:17,208 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:17,208 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451217824]
[2025-03-08 08:31:17,208 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451217824] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:17,208 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:17,208 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 08:31:17,208 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55659474]
[2025-03-08 08:31:17,208 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:17,209 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 08:31:17,209 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:17,209 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 08:31:17,209 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-08 08:31:17,210 INFO  L87              Difference]: Start difference. First operand 924 states and 1257 transitions. Second operand  has 6 states, 6 states have (on average 51.833333333333336) internal successors, (311), 6 states have internal predecessors, (311), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:17,636 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:17,636 INFO  L93              Difference]: Finished difference Result 1314 states and 1792 transitions.
[2025-03-08 08:31:17,636 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 08:31:17,636 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 51.833333333333336) internal successors, (311), 6 states have internal predecessors, (311), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 338
[2025-03-08 08:31:17,637 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:17,639 INFO  L225             Difference]: With dead ends: 1314
[2025-03-08 08:31:17,639 INFO  L226             Difference]: Without dead ends: 947
[2025-03-08 08:31:17,639 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-08 08:31:17,640 INFO  L435           NwaCegarLoop]: 334 mSDtfsCounter, 1002 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:17,640 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 1306 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 08:31:17,641 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 947 states.
[2025-03-08 08:31:17,651 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 925.
[2025-03-08 08:31:17,652 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 925 states, 914 states have (on average 1.3566739606126914) internal successors, (1240), 914 states have internal predecessors, (1240), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2025-03-08 08:31:17,652 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1258 transitions.
[2025-03-08 08:31:17,653 INFO  L78                 Accepts]: Start accepts. Automaton has 925 states and 1258 transitions. Word has length 338
[2025-03-08 08:31:17,653 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:17,653 INFO  L471      AbstractCegarLoop]: Abstraction has 925 states and 1258 transitions.
[2025-03-08 08:31:17,653 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 51.833333333333336) internal successors, (311), 6 states have internal predecessors, (311), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:17,653 INFO  L276                IsEmpty]: Start isEmpty. Operand 925 states and 1258 transitions.
[2025-03-08 08:31:17,655 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 339
[2025-03-08 08:31:17,655 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:17,655 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:17,655 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2025-03-08 08:31:17,656 INFO  L396      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:17,656 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:17,656 INFO  L85        PathProgramCache]: Analyzing trace with hash 1896053525, now seen corresponding path program 1 times
[2025-03-08 08:31:17,656 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:17,656 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900190230]
[2025-03-08 08:31:17,656 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:17,656 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:17,736 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes.
[2025-03-08 08:31:18,041 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements.
[2025-03-08 08:31:18,042 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:18,042 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:18,626 INFO  L134       CoverageAnalysis]: Checked inductivity of 145 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked.
[2025-03-08 08:31:18,626 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:18,626 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900190230]
[2025-03-08 08:31:18,626 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900190230] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:18,626 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:18,626 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-08 08:31:18,627 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471999122]
[2025-03-08 08:31:18,627 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:18,627 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 08:31:18,627 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:18,628 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 08:31:18,628 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-03-08 08:31:18,628 INFO  L87              Difference]: Start difference. First operand 925 states and 1258 transitions. Second operand  has 8 states, 8 states have (on average 32.5) internal successors, (260), 8 states have internal predecessors, (260), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:19,133 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:19,133 INFO  L93              Difference]: Finished difference Result 2084 states and 2827 transitions.
[2025-03-08 08:31:19,133 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 08:31:19,134 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 32.5) internal successors, (260), 8 states have internal predecessors, (260), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 338
[2025-03-08 08:31:19,134 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:19,137 INFO  L225             Difference]: With dead ends: 2084
[2025-03-08 08:31:19,137 INFO  L226             Difference]: Without dead ends: 1605
[2025-03-08 08:31:19,138 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2025-03-08 08:31:19,139 INFO  L435           NwaCegarLoop]: 1085 mSDtfsCounter, 803 mSDsluCounter, 4639 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 5724 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:19,139 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 5724 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 08:31:19,140 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1605 states.
[2025-03-08 08:31:19,154 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 994.
[2025-03-08 08:31:19,155 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 994 states, 980 states have (on average 1.3591836734693878) internal successors, (1332), 980 states have internal predecessors, (1332), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2025-03-08 08:31:19,155 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1356 transitions.
[2025-03-08 08:31:19,156 INFO  L78                 Accepts]: Start accepts. Automaton has 994 states and 1356 transitions. Word has length 338
[2025-03-08 08:31:19,156 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:19,156 INFO  L471      AbstractCegarLoop]: Abstraction has 994 states and 1356 transitions.
[2025-03-08 08:31:19,156 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 32.5) internal successors, (260), 8 states have internal predecessors, (260), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:19,156 INFO  L276                IsEmpty]: Start isEmpty. Operand 994 states and 1356 transitions.
[2025-03-08 08:31:19,158 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 340
[2025-03-08 08:31:19,158 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:19,158 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:19,159 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2025-03-08 08:31:19,159 INFO  L396      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:19,160 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:19,160 INFO  L85        PathProgramCache]: Analyzing trace with hash 1890778514, now seen corresponding path program 1 times
[2025-03-08 08:31:19,160 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:19,160 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230276760]
[2025-03-08 08:31:19,160 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:19,160 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:19,233 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes.
[2025-03-08 08:31:19,577 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements.
[2025-03-08 08:31:19,577 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:19,577 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:20,169 INFO  L134       CoverageAnalysis]: Checked inductivity of 145 backedges. 81 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-03-08 08:31:20,169 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:20,169 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230276760]
[2025-03-08 08:31:20,169 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230276760] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 08:31:20,169 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234192954]
[2025-03-08 08:31:20,169 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:20,169 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 08:31:20,169 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 08:31:20,172 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 08:31:20,173 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-08 08:31:20,746 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes.
[2025-03-08 08:31:21,002 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements.
[2025-03-08 08:31:21,002 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:21,002 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:21,010 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2045 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-03-08 08:31:21,017 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 08:31:21,076 INFO  L134       CoverageAnalysis]: Checked inductivity of 145 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked.
[2025-03-08 08:31:21,076 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 08:31:21,076 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234192954] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:21,076 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 08:31:21,076 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12
[2025-03-08 08:31:21,076 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586594905]
[2025-03-08 08:31:21,076 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:21,076 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 08:31:21,076 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:21,077 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 08:31:21,077 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132
[2025-03-08 08:31:21,077 INFO  L87              Difference]: Start difference. First operand 994 states and 1356 transitions. Second operand  has 6 states, 5 states have (on average 58.2) internal successors, (291), 6 states have internal predecessors, (291), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-03-08 08:31:21,289 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:21,289 INFO  L93              Difference]: Finished difference Result 1742 states and 2357 transitions.
[2025-03-08 08:31:21,290 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 08:31:21,290 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 58.2) internal successors, (291), 6 states have internal predecessors, (291), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 339
[2025-03-08 08:31:21,290 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:21,292 INFO  L225             Difference]: With dead ends: 1742
[2025-03-08 08:31:21,292 INFO  L226             Difference]: Without dead ends: 994
[2025-03-08 08:31:21,293 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132
[2025-03-08 08:31:21,293 INFO  L435           NwaCegarLoop]: 452 mSDtfsCounter, 0 mSDsluCounter, 1794 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:21,294 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2246 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 08:31:21,294 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 994 states.
[2025-03-08 08:31:21,327 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 994.
[2025-03-08 08:31:21,328 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 994 states, 980 states have (on average 1.3551020408163266) internal successors, (1328), 980 states have internal predecessors, (1328), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2025-03-08 08:31:21,329 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1352 transitions.
[2025-03-08 08:31:21,330 INFO  L78                 Accepts]: Start accepts. Automaton has 994 states and 1352 transitions. Word has length 339
[2025-03-08 08:31:21,330 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:21,330 INFO  L471      AbstractCegarLoop]: Abstraction has 994 states and 1352 transitions.
[2025-03-08 08:31:21,330 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 58.2) internal successors, (291), 6 states have internal predecessors, (291), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-03-08 08:31:21,330 INFO  L276                IsEmpty]: Start isEmpty. Operand 994 states and 1352 transitions.
[2025-03-08 08:31:21,332 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 342
[2025-03-08 08:31:21,332 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:21,333 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:21,350 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-03-08 08:31:21,533 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36
[2025-03-08 08:31:21,534 INFO  L396      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:21,535 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:21,535 INFO  L85        PathProgramCache]: Analyzing trace with hash 545778736, now seen corresponding path program 1 times
[2025-03-08 08:31:21,535 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:21,535 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661937745]
[2025-03-08 08:31:21,535 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:21,535 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:21,590 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes.
[2025-03-08 08:31:21,961 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements.
[2025-03-08 08:31:21,961 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:21,961 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:22,424 INFO  L134       CoverageAnalysis]: Checked inductivity of 146 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked.
[2025-03-08 08:31:22,425 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:22,425 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661937745]
[2025-03-08 08:31:22,425 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661937745] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:22,425 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:22,425 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 08:31:22,425 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092032527]
[2025-03-08 08:31:22,425 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:22,426 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 08:31:22,426 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:22,430 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 08:31:22,430 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-03-08 08:31:22,431 INFO  L87              Difference]: Start difference. First operand 994 states and 1352 transitions. Second operand  has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-03-08 08:31:22,861 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:22,861 INFO  L93              Difference]: Finished difference Result 1810 states and 2451 transitions.
[2025-03-08 08:31:22,861 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 08:31:22,861 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 341
[2025-03-08 08:31:22,861 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:22,864 INFO  L225             Difference]: With dead ends: 1810
[2025-03-08 08:31:22,864 INFO  L226             Difference]: Without dead ends: 1010
[2025-03-08 08:31:22,864 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2025-03-08 08:31:22,865 INFO  L435           NwaCegarLoop]: 328 mSDtfsCounter, 1031 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:22,865 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 1305 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 08:31:22,866 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1010 states.
[2025-03-08 08:31:22,876 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1002.
[2025-03-08 08:31:22,876 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1002 states, 988 states have (on average 1.3481781376518218) internal successors, (1332), 988 states have internal predecessors, (1332), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2025-03-08 08:31:22,877 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1356 transitions.
[2025-03-08 08:31:22,878 INFO  L78                 Accepts]: Start accepts. Automaton has 1002 states and 1356 transitions. Word has length 341
[2025-03-08 08:31:22,878 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:22,878 INFO  L471      AbstractCegarLoop]: Abstraction has 1002 states and 1356 transitions.
[2025-03-08 08:31:22,878 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-03-08 08:31:22,878 INFO  L276                IsEmpty]: Start isEmpty. Operand 1002 states and 1356 transitions.
[2025-03-08 08:31:22,880 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 344
[2025-03-08 08:31:22,880 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:22,880 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:22,880 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2025-03-08 08:31:22,880 INFO  L396      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:22,880 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:22,880 INFO  L85        PathProgramCache]: Analyzing trace with hash -2032695118, now seen corresponding path program 1 times
[2025-03-08 08:31:22,881 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:22,881 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583715162]
[2025-03-08 08:31:22,881 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:22,881 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:22,935 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes.
[2025-03-08 08:31:23,308 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements.
[2025-03-08 08:31:23,308 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:23,308 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:23,768 INFO  L134       CoverageAnalysis]: Checked inductivity of 147 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked.
[2025-03-08 08:31:23,768 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:23,768 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583715162]
[2025-03-08 08:31:23,768 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583715162] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:23,768 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:23,768 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 08:31:23,768 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105082607]
[2025-03-08 08:31:23,768 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:23,769 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 08:31:23,769 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:23,769 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 08:31:23,769 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-08 08:31:23,769 INFO  L87              Difference]: Start difference. First operand 1002 states and 1356 transitions. Second operand  has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:31:24,150 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:24,150 INFO  L93              Difference]: Finished difference Result 1860 states and 2504 transitions.
[2025-03-08 08:31:24,150 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 08:31:24,151 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 343
[2025-03-08 08:31:24,151 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:24,153 INFO  L225             Difference]: With dead ends: 1860
[2025-03-08 08:31:24,153 INFO  L226             Difference]: Without dead ends: 1010
[2025-03-08 08:31:24,154 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2025-03-08 08:31:24,154 INFO  L435           NwaCegarLoop]: 328 mSDtfsCounter, 508 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:24,154 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 1305 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 08:31:24,155 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1010 states.
[2025-03-08 08:31:24,166 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1006.
[2025-03-08 08:31:24,167 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1006 states, 992 states have (on average 1.346774193548387) internal successors, (1336), 992 states have internal predecessors, (1336), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2025-03-08 08:31:24,168 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1360 transitions.
[2025-03-08 08:31:24,168 INFO  L78                 Accepts]: Start accepts. Automaton has 1006 states and 1360 transitions. Word has length 343
[2025-03-08 08:31:24,168 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:24,168 INFO  L471      AbstractCegarLoop]: Abstraction has 1006 states and 1360 transitions.
[2025-03-08 08:31:24,168 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2025-03-08 08:31:24,168 INFO  L276                IsEmpty]: Start isEmpty. Operand 1006 states and 1360 transitions.
[2025-03-08 08:31:24,170 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 346
[2025-03-08 08:31:24,170 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:24,170 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:24,170 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2025-03-08 08:31:24,170 INFO  L396      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:24,171 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:24,171 INFO  L85        PathProgramCache]: Analyzing trace with hash 255655688, now seen corresponding path program 1 times
[2025-03-08 08:31:24,171 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:24,171 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639361285]
[2025-03-08 08:31:24,171 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:24,171 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:24,226 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes.
[2025-03-08 08:31:24,574 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements.
[2025-03-08 08:31:24,574 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:24,574 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:25,080 INFO  L134       CoverageAnalysis]: Checked inductivity of 148 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked.
[2025-03-08 08:31:25,081 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:25,081 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639361285]
[2025-03-08 08:31:25,081 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639361285] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:25,081 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:25,081 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 08:31:25,081 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432529754]
[2025-03-08 08:31:25,081 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:25,081 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 08:31:25,081 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:25,082 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 08:31:25,082 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-08 08:31:25,082 INFO  L87              Difference]: Start difference. First operand 1006 states and 1360 transitions. Second operand  has 6 states, 6 states have (on average 42.666666666666664) internal successors, (256), 6 states have internal predecessors, (256), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-03-08 08:31:25,436 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:25,436 INFO  L93              Difference]: Finished difference Result 1805 states and 2431 transitions.
[2025-03-08 08:31:25,436 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 08:31:25,436 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 42.666666666666664) internal successors, (256), 6 states have internal predecessors, (256), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 345
[2025-03-08 08:31:25,436 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:25,439 INFO  L225             Difference]: With dead ends: 1805
[2025-03-08 08:31:25,439 INFO  L226             Difference]: Without dead ends: 1014
[2025-03-08 08:31:25,439 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2025-03-08 08:31:25,440 INFO  L435           NwaCegarLoop]: 328 mSDtfsCounter, 495 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:25,440 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 1305 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 08:31:25,440 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1014 states.
[2025-03-08 08:31:25,453 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 1010.
[2025-03-08 08:31:25,454 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1010 states, 996 states have (on average 1.3453815261044177) internal successors, (1340), 996 states have internal predecessors, (1340), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2025-03-08 08:31:25,456 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1364 transitions.
[2025-03-08 08:31:25,456 INFO  L78                 Accepts]: Start accepts. Automaton has 1010 states and 1364 transitions. Word has length 345
[2025-03-08 08:31:25,456 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:25,456 INFO  L471      AbstractCegarLoop]: Abstraction has 1010 states and 1364 transitions.
[2025-03-08 08:31:25,457 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 42.666666666666664) internal successors, (256), 6 states have internal predecessors, (256), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-03-08 08:31:25,457 INFO  L276                IsEmpty]: Start isEmpty. Operand 1010 states and 1364 transitions.
[2025-03-08 08:31:25,459 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 348
[2025-03-08 08:31:25,459 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:25,459 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:25,459 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2025-03-08 08:31:25,459 INFO  L396      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:25,459 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:25,460 INFO  L85        PathProgramCache]: Analyzing trace with hash -933839470, now seen corresponding path program 1 times
[2025-03-08 08:31:25,460 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:25,461 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977755018]
[2025-03-08 08:31:25,461 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:25,461 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:25,521 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes.
[2025-03-08 08:31:25,911 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements.
[2025-03-08 08:31:25,911 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:25,911 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:26,909 INFO  L134       CoverageAnalysis]: Checked inductivity of 149 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-03-08 08:31:26,909 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:26,909 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977755018]
[2025-03-08 08:31:26,909 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977755018] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 08:31:26,909 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056429353]
[2025-03-08 08:31:26,910 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:26,910 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 08:31:26,910 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 08:31:26,912 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 08:31:26,913 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-08 08:31:27,507 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes.
[2025-03-08 08:31:27,676 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements.
[2025-03-08 08:31:27,676 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:27,676 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:27,685 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2061 conjuncts, 43 conjuncts are in the unsatisfiable core
[2025-03-08 08:31:27,692 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 08:31:27,893 INFO  L134       CoverageAnalysis]: Checked inductivity of 149 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked.
[2025-03-08 08:31:27,893 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 08:31:27,893 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056429353] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:27,893 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 08:31:27,893 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15
[2025-03-08 08:31:27,893 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739193029]
[2025-03-08 08:31:27,893 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:27,893 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 08:31:27,893 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:27,894 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 08:31:27,894 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210
[2025-03-08 08:31:27,894 INFO  L87              Difference]: Start difference. First operand 1010 states and 1364 transitions. Second operand  has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 6 states have internal predecessors, (269), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2025-03-08 08:31:28,239 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:28,239 INFO  L93              Difference]: Finished difference Result 1788 states and 2399 transitions.
[2025-03-08 08:31:28,240 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 08:31:28,240 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 6 states have internal predecessors, (269), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 347
[2025-03-08 08:31:28,240 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:28,242 INFO  L225             Difference]: With dead ends: 1788
[2025-03-08 08:31:28,242 INFO  L226             Difference]: Without dead ends: 1026
[2025-03-08 08:31:28,243 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210
[2025-03-08 08:31:28,243 INFO  L435           NwaCegarLoop]: 327 mSDtfsCounter, 479 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:28,243 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 1287 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 08:31:28,244 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1026 states.
[2025-03-08 08:31:28,254 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1022.
[2025-03-08 08:31:28,255 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1022 states, 1008 states have (on average 1.3373015873015872) internal successors, (1348), 1008 states have internal predecessors, (1348), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2025-03-08 08:31:28,256 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1372 transitions.
[2025-03-08 08:31:28,256 INFO  L78                 Accepts]: Start accepts. Automaton has 1022 states and 1372 transitions. Word has length 347
[2025-03-08 08:31:28,256 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:28,256 INFO  L471      AbstractCegarLoop]: Abstraction has 1022 states and 1372 transitions.
[2025-03-08 08:31:28,256 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 6 states have internal predecessors, (269), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2025-03-08 08:31:28,256 INFO  L276                IsEmpty]: Start isEmpty. Operand 1022 states and 1372 transitions.
[2025-03-08 08:31:28,258 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 350
[2025-03-08 08:31:28,258 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:28,258 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:28,271 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-03-08 08:31:28,460 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 08:31:28,460 INFO  L396      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:28,460 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:28,460 INFO  L85        PathProgramCache]: Analyzing trace with hash 1846269142, now seen corresponding path program 1 times
[2025-03-08 08:31:28,461 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:28,461 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286504803]
[2025-03-08 08:31:28,461 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:28,461 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:28,509 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes.
[2025-03-08 08:31:28,852 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements.
[2025-03-08 08:31:28,852 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:28,852 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:29,773 INFO  L134       CoverageAnalysis]: Checked inductivity of 150 backedges. 4 proven. 86 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-03-08 08:31:29,774 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:29,774 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286504803]
[2025-03-08 08:31:29,774 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286504803] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 08:31:29,774 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894320466]
[2025-03-08 08:31:29,774 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:29,774 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 08:31:29,774 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 08:31:29,777 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 08:31:29,778 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-03-08 08:31:30,419 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes.
[2025-03-08 08:31:30,691 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements.
[2025-03-08 08:31:30,691 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:30,691 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:30,699 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2063 conjuncts, 20 conjuncts are in the unsatisfiable core
[2025-03-08 08:31:30,705 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 08:31:30,869 INFO  L134       CoverageAnalysis]: Checked inductivity of 150 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2025-03-08 08:31:30,870 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 08:31:30,870 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894320466] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:30,870 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 08:31:30,870 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17
[2025-03-08 08:31:30,870 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686478640]
[2025-03-08 08:31:30,870 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:30,870 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 08:31:30,870 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:30,871 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 08:31:30,871 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272
[2025-03-08 08:31:30,871 INFO  L87              Difference]: Start difference. First operand 1022 states and 1372 transitions. Second operand  has 8 states, 8 states have (on average 40.25) internal successors, (322), 8 states have internal predecessors, (322), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:31,309 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:31,310 INFO  L93              Difference]: Finished difference Result 2297 states and 3092 transitions.
[2025-03-08 08:31:31,310 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 08:31:31,310 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 40.25) internal successors, (322), 8 states have internal predecessors, (322), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 349
[2025-03-08 08:31:31,310 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:31,314 INFO  L225             Difference]: With dead ends: 2297
[2025-03-08 08:31:31,314 INFO  L226             Difference]: Without dead ends: 1780
[2025-03-08 08:31:31,315 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342
[2025-03-08 08:31:31,315 INFO  L435           NwaCegarLoop]: 333 mSDtfsCounter, 1693 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1699 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:31,315 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1699 Valid, 1574 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 08:31:31,316 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1780 states.
[2025-03-08 08:31:31,333 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1434.
[2025-03-08 08:31:31,334 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1434 states, 1411 states have (on average 1.3175053153791638) internal successors, (1859), 1411 states have internal predecessors, (1859), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21)
[2025-03-08 08:31:31,335 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1901 transitions.
[2025-03-08 08:31:31,335 INFO  L78                 Accepts]: Start accepts. Automaton has 1434 states and 1901 transitions. Word has length 349
[2025-03-08 08:31:31,336 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:31,336 INFO  L471      AbstractCegarLoop]: Abstraction has 1434 states and 1901 transitions.
[2025-03-08 08:31:31,336 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 40.25) internal successors, (322), 8 states have internal predecessors, (322), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:31,336 INFO  L276                IsEmpty]: Start isEmpty. Operand 1434 states and 1901 transitions.
[2025-03-08 08:31:31,338 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 350
[2025-03-08 08:31:31,338 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:31,338 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:31,351 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2025-03-08 08:31:31,538 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 08:31:31,539 INFO  L396      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:31,539 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:31,539 INFO  L85        PathProgramCache]: Analyzing trace with hash 340757861, now seen corresponding path program 1 times
[2025-03-08 08:31:31,539 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:31,539 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322766167]
[2025-03-08 08:31:31,540 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:31,540 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:31,595 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes.
[2025-03-08 08:31:31,678 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements.
[2025-03-08 08:31:31,679 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:31,679 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:32,078 INFO  L134       CoverageAnalysis]: Checked inductivity of 149 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked.
[2025-03-08 08:31:32,078 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:32,078 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322766167]
[2025-03-08 08:31:32,078 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322766167] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:32,078 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:32,078 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 08:31:32,078 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273012963]
[2025-03-08 08:31:32,078 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:32,079 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 08:31:32,080 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:32,080 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 08:31:32,080 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:31:32,081 INFO  L87              Difference]: Start difference. First operand 1434 states and 1901 transitions. Second operand  has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:32,230 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:32,230 INFO  L93              Difference]: Finished difference Result 2219 states and 2953 transitions.
[2025-03-08 08:31:32,230 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 08:31:32,231 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 349
[2025-03-08 08:31:32,231 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:32,233 INFO  L225             Difference]: With dead ends: 2219
[2025-03-08 08:31:32,234 INFO  L226             Difference]: Without dead ends: 1524
[2025-03-08 08:31:32,234 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 08:31:32,235 INFO  L435           NwaCegarLoop]: 451 mSDtfsCounter, 16 mSDsluCounter, 1343 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:32,235 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1794 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 08:31:32,236 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1524 states.
[2025-03-08 08:31:32,252 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1524.
[2025-03-08 08:31:32,253 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1524 states, 1501 states have (on average 1.3251165889407062) internal successors, (1989), 1501 states have internal predecessors, (1989), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21)
[2025-03-08 08:31:32,254 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 2031 transitions.
[2025-03-08 08:31:32,255 INFO  L78                 Accepts]: Start accepts. Automaton has 1524 states and 2031 transitions. Word has length 349
[2025-03-08 08:31:32,255 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:32,255 INFO  L471      AbstractCegarLoop]: Abstraction has 1524 states and 2031 transitions.
[2025-03-08 08:31:32,255 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:32,255 INFO  L276                IsEmpty]: Start isEmpty. Operand 1524 states and 2031 transitions.
[2025-03-08 08:31:32,257 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 351
[2025-03-08 08:31:32,257 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:32,257 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:32,257 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2025-03-08 08:31:32,258 INFO  L396      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:32,258 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:32,258 INFO  L85        PathProgramCache]: Analyzing trace with hash -388067194, now seen corresponding path program 1 times
[2025-03-08 08:31:32,258 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:32,258 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736538298]
[2025-03-08 08:31:32,258 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:32,259 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:32,310 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes.
[2025-03-08 08:31:32,703 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements.
[2025-03-08 08:31:32,703 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:32,703 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:33,635 INFO  L134       CoverageAnalysis]: Checked inductivity of 150 backedges. 4 proven. 86 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-03-08 08:31:33,635 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:33,635 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736538298]
[2025-03-08 08:31:33,635 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736538298] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 08:31:33,635 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941411262]
[2025-03-08 08:31:33,635 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:33,635 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 08:31:33,636 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 08:31:33,637 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 08:31:33,638 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-03-08 08:31:34,282 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes.
[2025-03-08 08:31:34,715 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements.
[2025-03-08 08:31:34,715 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:34,715 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:34,723 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2064 conjuncts, 24 conjuncts are in the unsatisfiable core
[2025-03-08 08:31:34,728 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 08:31:34,886 INFO  L134       CoverageAnalysis]: Checked inductivity of 150 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-03-08 08:31:34,886 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 08:31:35,114 INFO  L134       CoverageAnalysis]: Checked inductivity of 150 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-03-08 08:31:35,114 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941411262] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-08 08:31:35,114 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-03-08 08:31:35,114 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 8] total 22
[2025-03-08 08:31:35,114 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789771988]
[2025-03-08 08:31:35,114 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:35,115 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 08:31:35,115 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:35,115 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 08:31:35,115 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462
[2025-03-08 08:31:35,115 INFO  L87              Difference]: Start difference. First operand 1524 states and 2031 transitions. Second operand  has 7 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:35,534 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:35,535 INFO  L93              Difference]: Finished difference Result 2306 states and 3092 transitions.
[2025-03-08 08:31:35,535 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 08:31:35,535 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 350
[2025-03-08 08:31:35,535 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:35,538 INFO  L225             Difference]: With dead ends: 2306
[2025-03-08 08:31:35,538 INFO  L226             Difference]: Without dead ends: 1914
[2025-03-08 08:31:35,539 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 689 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552
[2025-03-08 08:31:35,540 INFO  L435           NwaCegarLoop]: 801 mSDtfsCounter, 352 mSDsluCounter, 3633 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 4434 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:35,540 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 4434 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 08:31:35,541 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1914 states.
[2025-03-08 08:31:35,562 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1711.
[2025-03-08 08:31:35,564 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1711 states, 1685 states have (on average 1.3198813056379821) internal successors, (2224), 1685 states have internal predecessors, (2224), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 08:31:35,565 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2272 transitions.
[2025-03-08 08:31:35,566 INFO  L78                 Accepts]: Start accepts. Automaton has 1711 states and 2272 transitions. Word has length 350
[2025-03-08 08:31:35,566 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:35,566 INFO  L471      AbstractCegarLoop]: Abstraction has 1711 states and 2272 transitions.
[2025-03-08 08:31:35,566 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:35,566 INFO  L276                IsEmpty]: Start isEmpty. Operand 1711 states and 2272 transitions.
[2025-03-08 08:31:35,568 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 352
[2025-03-08 08:31:35,568 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:35,569 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:35,583 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2025-03-08 08:31:35,769 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43
[2025-03-08 08:31:35,769 INFO  L396      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:35,769 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:35,770 INFO  L85        PathProgramCache]: Analyzing trace with hash 457040597, now seen corresponding path program 1 times
[2025-03-08 08:31:35,770 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:35,770 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233615375]
[2025-03-08 08:31:35,770 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:35,770 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:35,828 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes.
[2025-03-08 08:31:36,066 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements.
[2025-03-08 08:31:36,066 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:36,067 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:37,085 INFO  L134       CoverageAnalysis]: Checked inductivity of 150 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-03-08 08:31:37,086 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:37,086 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233615375]
[2025-03-08 08:31:37,086 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233615375] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:37,086 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:37,086 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-08 08:31:37,086 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865192554]
[2025-03-08 08:31:37,086 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:37,087 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 08:31:37,087 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:37,087 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 08:31:37,087 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2025-03-08 08:31:37,088 INFO  L87              Difference]: Start difference. First operand 1711 states and 2272 transitions. Second operand  has 8 states, 8 states have (on average 40.5) internal successors, (324), 8 states have internal predecessors, (324), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:37,432 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:37,433 INFO  L93              Difference]: Finished difference Result 2636 states and 3531 transitions.
[2025-03-08 08:31:37,433 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 08:31:37,433 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 40.5) internal successors, (324), 8 states have internal predecessors, (324), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 351
[2025-03-08 08:31:37,434 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:37,437 INFO  L225             Difference]: With dead ends: 2636
[2025-03-08 08:31:37,437 INFO  L226             Difference]: Without dead ends: 2057
[2025-03-08 08:31:37,438 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2025-03-08 08:31:37,439 INFO  L435           NwaCegarLoop]: 443 mSDtfsCounter, 968 mSDsluCounter, 1733 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 2176 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:37,439 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 2176 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 08:31:37,441 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2057 states.
[2025-03-08 08:31:37,465 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 2054.
[2025-03-08 08:31:37,467 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2054 states, 2028 states have (on average 1.334319526627219) internal successors, (2706), 2028 states have internal predecessors, (2706), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 08:31:37,469 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 2754 transitions.
[2025-03-08 08:31:37,470 INFO  L78                 Accepts]: Start accepts. Automaton has 2054 states and 2754 transitions. Word has length 351
[2025-03-08 08:31:37,470 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:37,470 INFO  L471      AbstractCegarLoop]: Abstraction has 2054 states and 2754 transitions.
[2025-03-08 08:31:37,470 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 40.5) internal successors, (324), 8 states have internal predecessors, (324), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:37,470 INFO  L276                IsEmpty]: Start isEmpty. Operand 2054 states and 2754 transitions.
[2025-03-08 08:31:37,474 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 352
[2025-03-08 08:31:37,474 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:37,474 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:37,474 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2025-03-08 08:31:37,475 INFO  L396      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:37,475 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:37,475 INFO  L85        PathProgramCache]: Analyzing trace with hash 549612946, now seen corresponding path program 1 times
[2025-03-08 08:31:37,475 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:37,475 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424771944]
[2025-03-08 08:31:37,475 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:37,475 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:37,538 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes.
[2025-03-08 08:31:37,968 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements.
[2025-03-08 08:31:37,968 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:37,968 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:39,281 INFO  L134       CoverageAnalysis]: Checked inductivity of 151 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked.
[2025-03-08 08:31:39,282 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:39,282 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424771944]
[2025-03-08 08:31:39,282 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424771944] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:39,282 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:39,282 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-08 08:31:39,282 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585387475]
[2025-03-08 08:31:39,282 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:39,282 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 08:31:39,282 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:39,283 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 08:31:39,283 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2025-03-08 08:31:39,283 INFO  L87              Difference]: Start difference. First operand 2054 states and 2754 transitions. Second operand  has 10 states, 10 states have (on average 27.6) internal successors, (276), 10 states have internal predecessors, (276), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-03-08 08:31:39,850 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:39,851 INFO  L93              Difference]: Finished difference Result 3886 states and 5210 transitions.
[2025-03-08 08:31:39,851 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-08 08:31:39,851 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 27.6) internal successors, (276), 10 states have internal predecessors, (276), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 351
[2025-03-08 08:31:39,851 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:39,855 INFO  L225             Difference]: With dead ends: 3886
[2025-03-08 08:31:39,855 INFO  L226             Difference]: Without dead ends: 2747
[2025-03-08 08:31:39,856 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156
[2025-03-08 08:31:39,856 INFO  L435           NwaCegarLoop]: 677 mSDtfsCounter, 1256 mSDsluCounter, 3951 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1261 SdHoareTripleChecker+Valid, 4628 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:39,856 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1261 Valid, 4628 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 08:31:39,858 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2747 states.
[2025-03-08 08:31:39,879 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2747 to 2128.
[2025-03-08 08:31:39,881 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2128 states, 2098 states have (on average 1.3317445185891326) internal successors, (2794), 2098 states have internal predecessors, (2794), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28)
[2025-03-08 08:31:39,882 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 2850 transitions.
[2025-03-08 08:31:39,883 INFO  L78                 Accepts]: Start accepts. Automaton has 2128 states and 2850 transitions. Word has length 351
[2025-03-08 08:31:39,883 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:39,883 INFO  L471      AbstractCegarLoop]: Abstraction has 2128 states and 2850 transitions.
[2025-03-08 08:31:39,883 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 27.6) internal successors, (276), 10 states have internal predecessors, (276), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-03-08 08:31:39,883 INFO  L276                IsEmpty]: Start isEmpty. Operand 2128 states and 2850 transitions.
[2025-03-08 08:31:39,886 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 352
[2025-03-08 08:31:39,886 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:39,886 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:39,886 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2025-03-08 08:31:39,887 INFO  L396      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:39,887 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:39,887 INFO  L85        PathProgramCache]: Analyzing trace with hash -1777145123, now seen corresponding path program 1 times
[2025-03-08 08:31:39,887 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:39,887 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793305416]
[2025-03-08 08:31:39,887 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:39,887 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:39,943 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes.
[2025-03-08 08:31:40,431 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements.
[2025-03-08 08:31:40,431 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:40,431 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:41,636 INFO  L134       CoverageAnalysis]: Checked inductivity of 149 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked.
[2025-03-08 08:31:41,637 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:41,637 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793305416]
[2025-03-08 08:31:41,637 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793305416] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:41,637 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:41,637 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-03-08 08:31:41,637 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938267037]
[2025-03-08 08:31:41,637 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:41,637 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-03-08 08:31:41,637 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:41,638 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-03-08 08:31:41,638 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2025-03-08 08:31:41,638 INFO  L87              Difference]: Start difference. First operand 2128 states and 2850 transitions. Second operand  has 11 states, 11 states have (on average 25.454545454545453) internal successors, (280), 11 states have internal predecessors, (280), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-03-08 08:31:42,779 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:42,779 INFO  L93              Difference]: Finished difference Result 5222 states and 6928 transitions.
[2025-03-08 08:31:42,780 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-03-08 08:31:42,780 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 25.454545454545453) internal successors, (280), 11 states have internal predecessors, (280), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 351
[2025-03-08 08:31:42,780 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:42,786 INFO  L225             Difference]: With dead ends: 5222
[2025-03-08 08:31:42,786 INFO  L226             Difference]: Without dead ends: 3767
[2025-03-08 08:31:42,788 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272
[2025-03-08 08:31:42,788 INFO  L435           NwaCegarLoop]: 506 mSDtfsCounter, 878 mSDsluCounter, 2979 mSDsCounter, 0 mSdLazyCounter, 2571 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 3485 SdHoareTripleChecker+Invalid, 2574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:42,789 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 3485 Invalid, 2574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2571 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-08 08:31:42,790 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3767 states.
[2025-03-08 08:31:42,820 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3767 to 2474.
[2025-03-08 08:31:42,821 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2474 states, 2434 states have (on average 1.3311421528348397) internal successors, (3240), 2434 states have internal predecessors, (3240), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38)
[2025-03-08 08:31:42,823 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 3316 transitions.
[2025-03-08 08:31:42,824 INFO  L78                 Accepts]: Start accepts. Automaton has 2474 states and 3316 transitions. Word has length 351
[2025-03-08 08:31:42,824 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:42,824 INFO  L471      AbstractCegarLoop]: Abstraction has 2474 states and 3316 transitions.
[2025-03-08 08:31:42,824 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 25.454545454545453) internal successors, (280), 11 states have internal predecessors, (280), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-03-08 08:31:42,824 INFO  L276                IsEmpty]: Start isEmpty. Operand 2474 states and 3316 transitions.
[2025-03-08 08:31:42,827 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 354
[2025-03-08 08:31:42,827 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:42,827 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:42,827 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2025-03-08 08:31:42,827 INFO  L396      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:42,829 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:42,829 INFO  L85        PathProgramCache]: Analyzing trace with hash 921672773, now seen corresponding path program 1 times
[2025-03-08 08:31:42,829 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:42,829 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401905950]
[2025-03-08 08:31:42,829 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:42,829 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:42,895 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes.
[2025-03-08 08:31:43,615 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements.
[2025-03-08 08:31:43,615 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:43,615 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:44,500 INFO  L134       CoverageAnalysis]: Checked inductivity of 150 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-03-08 08:31:44,500 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:44,500 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401905950]
[2025-03-08 08:31:44,500 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401905950] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:44,500 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:44,500 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-08 08:31:44,501 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439739769]
[2025-03-08 08:31:44,501 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:44,501 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-08 08:31:44,501 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:44,501 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-08 08:31:44,501 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2025-03-08 08:31:44,502 INFO  L87              Difference]: Start difference. First operand 2474 states and 3316 transitions. Second operand  has 9 states, 9 states have (on average 36.22222222222222) internal successors, (326), 9 states have internal predecessors, (326), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-03-08 08:31:45,415 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:45,415 INFO  L93              Difference]: Finished difference Result 4754 states and 6348 transitions.
[2025-03-08 08:31:45,416 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-08 08:31:45,416 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 36.22222222222222) internal successors, (326), 9 states have internal predecessors, (326), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 353
[2025-03-08 08:31:45,416 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:45,423 INFO  L225             Difference]: With dead ends: 4754
[2025-03-08 08:31:45,423 INFO  L226             Difference]: Without dead ends: 3727
[2025-03-08 08:31:45,425 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156
[2025-03-08 08:31:45,425 INFO  L435           NwaCegarLoop]: 510 mSDtfsCounter, 1286 mSDsluCounter, 2310 mSDsCounter, 0 mSdLazyCounter, 2090 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1287 SdHoareTripleChecker+Valid, 2820 SdHoareTripleChecker+Invalid, 2094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:45,425 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1287 Valid, 2820 Invalid, 2094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2090 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-08 08:31:45,429 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3727 states.
[2025-03-08 08:31:45,475 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3727 to 3241.
[2025-03-08 08:31:45,478 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3241 states, 3201 states have (on average 1.3130271790065604) internal successors, (4203), 3201 states have internal predecessors, (4203), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38)
[2025-03-08 08:31:45,480 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 4279 transitions.
[2025-03-08 08:31:45,481 INFO  L78                 Accepts]: Start accepts. Automaton has 3241 states and 4279 transitions. Word has length 353
[2025-03-08 08:31:45,483 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:45,483 INFO  L471      AbstractCegarLoop]: Abstraction has 3241 states and 4279 transitions.
[2025-03-08 08:31:45,483 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 36.22222222222222) internal successors, (326), 9 states have internal predecessors, (326), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-03-08 08:31:45,483 INFO  L276                IsEmpty]: Start isEmpty. Operand 3241 states and 4279 transitions.
[2025-03-08 08:31:45,488 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 354
[2025-03-08 08:31:45,488 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:45,488 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:45,488 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2025-03-08 08:31:45,489 INFO  L396      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:45,489 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:45,489 INFO  L85        PathProgramCache]: Analyzing trace with hash 491045453, now seen corresponding path program 1 times
[2025-03-08 08:31:45,489 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:45,489 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190768296]
[2025-03-08 08:31:45,489 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:45,489 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:45,551 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes.
[2025-03-08 08:31:46,264 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements.
[2025-03-08 08:31:46,264 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:46,264 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:48,877 INFO  L134       CoverageAnalysis]: Checked inductivity of 148 backedges. 51 proven. 37 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-03-08 08:31:48,877 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:48,877 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190768296]
[2025-03-08 08:31:48,877 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190768296] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 08:31:48,877 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039705750]
[2025-03-08 08:31:48,877 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:48,877 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 08:31:48,877 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 08:31:48,879 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 08:31:48,880 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-03-08 08:31:49,612 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes.
[2025-03-08 08:31:50,277 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements.
[2025-03-08 08:31:50,278 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:50,278 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:50,287 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2071 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-03-08 08:31:50,292 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 08:31:50,338 INFO  L134       CoverageAnalysis]: Checked inductivity of 148 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked.
[2025-03-08 08:31:50,338 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 08:31:50,338 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039705750] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:50,338 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 08:31:50,338 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 22
[2025-03-08 08:31:50,338 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933598972]
[2025-03-08 08:31:50,338 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:50,339 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 08:31:50,339 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:50,339 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 08:31:50,339 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462
[2025-03-08 08:31:50,339 INFO  L87              Difference]: Start difference. First operand 3241 states and 4279 transitions. Second operand  has 6 states, 5 states have (on average 54.6) internal successors, (273), 6 states have internal predecessors, (273), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-03-08 08:31:50,519 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:50,519 INFO  L93              Difference]: Finished difference Result 6005 states and 7914 transitions.
[2025-03-08 08:31:50,519 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 08:31:50,519 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 54.6) internal successors, (273), 6 states have internal predecessors, (273), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 353
[2025-03-08 08:31:50,519 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:50,524 INFO  L225             Difference]: With dead ends: 6005
[2025-03-08 08:31:50,524 INFO  L226             Difference]: Without dead ends: 3241
[2025-03-08 08:31:50,527 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462
[2025-03-08 08:31:50,527 INFO  L435           NwaCegarLoop]: 451 mSDtfsCounter, 0 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2237 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:50,527 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2237 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 08:31:50,528 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3241 states.
[2025-03-08 08:31:50,560 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3241 to 3241.
[2025-03-08 08:31:50,562 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3241 states, 3201 states have (on average 1.3105279600124962) internal successors, (4195), 3201 states have internal predecessors, (4195), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38)
[2025-03-08 08:31:50,565 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 4271 transitions.
[2025-03-08 08:31:50,565 INFO  L78                 Accepts]: Start accepts. Automaton has 3241 states and 4271 transitions. Word has length 353
[2025-03-08 08:31:50,565 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:50,565 INFO  L471      AbstractCegarLoop]: Abstraction has 3241 states and 4271 transitions.
[2025-03-08 08:31:50,565 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 54.6) internal successors, (273), 6 states have internal predecessors, (273), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-03-08 08:31:50,565 INFO  L276                IsEmpty]: Start isEmpty. Operand 3241 states and 4271 transitions.
[2025-03-08 08:31:50,570 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 354
[2025-03-08 08:31:50,570 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:50,570 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:50,589 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-03-08 08:31:50,770 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48
[2025-03-08 08:31:50,771 INFO  L396      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:50,771 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:50,771 INFO  L85        PathProgramCache]: Analyzing trace with hash -590925895, now seen corresponding path program 1 times
[2025-03-08 08:31:50,771 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:50,771 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817859078]
[2025-03-08 08:31:50,771 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:50,771 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:50,828 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes.
[2025-03-08 08:31:51,249 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements.
[2025-03-08 08:31:51,249 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:51,249 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:51,646 INFO  L134       CoverageAnalysis]: Checked inductivity of 150 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-03-08 08:31:51,646 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:51,646 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817859078]
[2025-03-08 08:31:51,646 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817859078] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:51,646 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:51,646 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 08:31:51,646 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726627449]
[2025-03-08 08:31:51,646 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:51,647 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 08:31:51,647 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:51,647 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 08:31:51,647 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-08 08:31:51,647 INFO  L87              Difference]: Start difference. First operand 3241 states and 4271 transitions. Second operand  has 6 states, 6 states have (on average 54.333333333333336) internal successors, (326), 6 states have internal predecessors, (326), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:52,183 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:52,183 INFO  L93              Difference]: Finished difference Result 5285 states and 6980 transitions.
[2025-03-08 08:31:52,183 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 08:31:52,184 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 54.333333333333336) internal successors, (326), 6 states have internal predecessors, (326), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 353
[2025-03-08 08:31:52,184 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:52,191 INFO  L225             Difference]: With dead ends: 5285
[2025-03-08 08:31:52,191 INFO  L226             Difference]: Without dead ends: 4337
[2025-03-08 08:31:52,193 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-08 08:31:52,193 INFO  L435           NwaCegarLoop]: 583 mSDtfsCounter, 744 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 2058 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:52,193 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 2058 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1374 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 08:31:52,195 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4337 states.
[2025-03-08 08:31:52,234 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4337 to 3315.
[2025-03-08 08:31:52,236 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3315 states, 3273 states have (on average 1.3113351665139017) internal successors, (4292), 3273 states have internal predecessors, (4292), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40)
[2025-03-08 08:31:52,239 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3315 states to 3315 states and 4372 transitions.
[2025-03-08 08:31:52,240 INFO  L78                 Accepts]: Start accepts. Automaton has 3315 states and 4372 transitions. Word has length 353
[2025-03-08 08:31:52,240 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:52,240 INFO  L471      AbstractCegarLoop]: Abstraction has 3315 states and 4372 transitions.
[2025-03-08 08:31:52,240 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 54.333333333333336) internal successors, (326), 6 states have internal predecessors, (326), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:52,240 INFO  L276                IsEmpty]: Start isEmpty. Operand 3315 states and 4372 transitions.
[2025-03-08 08:31:52,244 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 354
[2025-03-08 08:31:52,244 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:52,245 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:52,245 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2025-03-08 08:31:52,245 INFO  L396      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:52,245 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:52,245 INFO  L85        PathProgramCache]: Analyzing trace with hash -232233251, now seen corresponding path program 1 times
[2025-03-08 08:31:52,245 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:52,245 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696658394]
[2025-03-08 08:31:52,245 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:52,245 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:52,303 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes.
[2025-03-08 08:31:52,660 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements.
[2025-03-08 08:31:52,660 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:52,660 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:53,491 INFO  L134       CoverageAnalysis]: Checked inductivity of 150 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-03-08 08:31:53,492 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:53,492 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696658394]
[2025-03-08 08:31:53,492 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696658394] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:53,492 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:53,492 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-08 08:31:53,492 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576952384]
[2025-03-08 08:31:53,492 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:53,492 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 08:31:53,492 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:53,493 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 08:31:53,493 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2025-03-08 08:31:53,493 INFO  L87              Difference]: Start difference. First operand 3315 states and 4372 transitions. Second operand  has 10 states, 10 states have (on average 32.6) internal successors, (326), 10 states have internal predecessors, (326), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:54,327 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:54,327 INFO  L93              Difference]: Finished difference Result 8522 states and 11272 transitions.
[2025-03-08 08:31:54,328 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-03-08 08:31:54,328 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 32.6) internal successors, (326), 10 states have internal predecessors, (326), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 353
[2025-03-08 08:31:54,328 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:54,335 INFO  L225             Difference]: With dead ends: 8522
[2025-03-08 08:31:54,335 INFO  L226             Difference]: Without dead ends: 7574
[2025-03-08 08:31:54,337 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156
[2025-03-08 08:31:54,338 INFO  L435           NwaCegarLoop]: 326 mSDtfsCounter, 1733 mSDsluCounter, 2240 mSDsCounter, 0 mSdLazyCounter, 1779 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1739 SdHoareTripleChecker+Valid, 2566 SdHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:54,338 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1739 Valid, 2566 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1779 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 08:31:54,341 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7574 states.
[2025-03-08 08:31:54,391 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7574 to 3489.
[2025-03-08 08:31:54,393 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3489 states, 3439 states have (on average 1.3102646118057575) internal successors, (4506), 3439 states have internal predecessors, (4506), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48)
[2025-03-08 08:31:54,396 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 3489 states and 4602 transitions.
[2025-03-08 08:31:54,397 INFO  L78                 Accepts]: Start accepts. Automaton has 3489 states and 4602 transitions. Word has length 353
[2025-03-08 08:31:54,397 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:54,397 INFO  L471      AbstractCegarLoop]: Abstraction has 3489 states and 4602 transitions.
[2025-03-08 08:31:54,397 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 32.6) internal successors, (326), 10 states have internal predecessors, (326), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:54,397 INFO  L276                IsEmpty]: Start isEmpty. Operand 3489 states and 4602 transitions.
[2025-03-08 08:31:54,401 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 355
[2025-03-08 08:31:54,401 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:54,402 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:54,402 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2025-03-08 08:31:54,402 INFO  L396      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:54,402 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:54,402 INFO  L85        PathProgramCache]: Analyzing trace with hash -1715382692, now seen corresponding path program 1 times
[2025-03-08 08:31:54,402 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:54,402 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189072316]
[2025-03-08 08:31:54,402 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:54,402 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:54,467 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes.
[2025-03-08 08:31:54,899 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements.
[2025-03-08 08:31:54,900 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:54,900 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:55,518 INFO  L134       CoverageAnalysis]: Checked inductivity of 150 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked.
[2025-03-08 08:31:55,518 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:55,518 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189072316]
[2025-03-08 08:31:55,518 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189072316] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:55,518 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:55,518 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-08 08:31:55,518 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968983509]
[2025-03-08 08:31:55,518 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:55,518 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 08:31:55,518 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:55,519 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 08:31:55,519 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2025-03-08 08:31:55,519 INFO  L87              Difference]: Start difference. First operand 3489 states and 4602 transitions. Second operand  has 8 states, 8 states have (on average 35.0) internal successors, (280), 8 states have internal predecessors, (280), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-03-08 08:31:55,891 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:55,892 INFO  L93              Difference]: Finished difference Result 7298 states and 9625 transitions.
[2025-03-08 08:31:55,892 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 08:31:55,892 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 35.0) internal successors, (280), 8 states have internal predecessors, (280), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 354
[2025-03-08 08:31:55,892 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:55,897 INFO  L225             Difference]: With dead ends: 7298
[2025-03-08 08:31:55,897 INFO  L226             Difference]: Without dead ends: 5521
[2025-03-08 08:31:55,900 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2025-03-08 08:31:55,900 INFO  L435           NwaCegarLoop]: 696 mSDtfsCounter, 1045 mSDsluCounter, 2406 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 3102 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:55,900 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 3102 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 08:31:55,902 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5521 states.
[2025-03-08 08:31:55,951 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5521 to 3637.
[2025-03-08 08:31:55,953 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3637 states, 3581 states have (on average 1.3080145210834961) internal successors, (4684), 3581 states have internal predecessors, (4684), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54)
[2025-03-08 08:31:55,957 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3637 states to 3637 states and 4792 transitions.
[2025-03-08 08:31:55,957 INFO  L78                 Accepts]: Start accepts. Automaton has 3637 states and 4792 transitions. Word has length 354
[2025-03-08 08:31:55,958 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:55,958 INFO  L471      AbstractCegarLoop]: Abstraction has 3637 states and 4792 transitions.
[2025-03-08 08:31:55,958 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 35.0) internal successors, (280), 8 states have internal predecessors, (280), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-03-08 08:31:55,958 INFO  L276                IsEmpty]: Start isEmpty. Operand 3637 states and 4792 transitions.
[2025-03-08 08:31:55,962 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 355
[2025-03-08 08:31:55,963 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:55,963 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:55,963 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2025-03-08 08:31:55,963 INFO  L396      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:55,963 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:55,964 INFO  L85        PathProgramCache]: Analyzing trace with hash -1473381018, now seen corresponding path program 1 times
[2025-03-08 08:31:55,964 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:55,964 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256431340]
[2025-03-08 08:31:55,964 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:55,964 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:56,023 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes.
[2025-03-08 08:31:56,087 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements.
[2025-03-08 08:31:56,087 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:56,087 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:31:56,417 INFO  L134       CoverageAnalysis]: Checked inductivity of 150 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked.
[2025-03-08 08:31:56,417 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:31:56,417 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256431340]
[2025-03-08 08:31:56,417 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256431340] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 08:31:56,417 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 08:31:56,417 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 08:31:56,417 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085475946]
[2025-03-08 08:31:56,417 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 08:31:56,418 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 08:31:56,418 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 08:31:56,418 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 08:31:56,418 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-08 08:31:56,418 INFO  L87              Difference]: Start difference. First operand 3637 states and 4792 transitions. Second operand  has 6 states, 6 states have (on average 47.0) internal successors, (282), 6 states have internal predecessors, (282), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:56,756 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 08:31:56,757 INFO  L93              Difference]: Finished difference Result 6089 states and 8003 transitions.
[2025-03-08 08:31:56,757 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 08:31:56,757 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 47.0) internal successors, (282), 6 states have internal predecessors, (282), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 354
[2025-03-08 08:31:56,757 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 08:31:56,761 INFO  L225             Difference]: With dead ends: 6089
[2025-03-08 08:31:56,761 INFO  L226             Difference]: Without dead ends: 3733
[2025-03-08 08:31:56,763 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-08 08:31:56,763 INFO  L435           NwaCegarLoop]: 337 mSDtfsCounter, 504 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 08:31:56,763 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1328 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 08:31:56,765 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3733 states.
[2025-03-08 08:31:56,804 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3733 to 3685.
[2025-03-08 08:31:56,806 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3685 states, 3629 states have (on average 1.3039404794709286) internal successors, (4732), 3629 states have internal predecessors, (4732), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54)
[2025-03-08 08:31:56,808 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3685 states to 3685 states and 4840 transitions.
[2025-03-08 08:31:56,808 INFO  L78                 Accepts]: Start accepts. Automaton has 3685 states and 4840 transitions. Word has length 354
[2025-03-08 08:31:56,809 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 08:31:56,809 INFO  L471      AbstractCegarLoop]: Abstraction has 3685 states and 4840 transitions.
[2025-03-08 08:31:56,809 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 47.0) internal successors, (282), 6 states have internal predecessors, (282), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)
[2025-03-08 08:31:56,809 INFO  L276                IsEmpty]: Start isEmpty. Operand 3685 states and 4840 transitions.
[2025-03-08 08:31:56,813 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 355
[2025-03-08 08:31:56,813 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 08:31:56,813 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 08:31:56,813 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2025-03-08 08:31:56,813 INFO  L396      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 08:31:56,813 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 08:31:56,813 INFO  L85        PathProgramCache]: Analyzing trace with hash 110205581, now seen corresponding path program 1 times
[2025-03-08 08:31:56,813 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 08:31:56,813 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713292242]
[2025-03-08 08:31:56,813 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:31:56,814 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 08:31:56,866 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes.
[2025-03-08 08:31:57,860 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements.
[2025-03-08 08:31:57,860 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:31:57,860 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:32:01,347 INFO  L134       CoverageAnalysis]: Checked inductivity of 149 backedges. 51 proven. 38 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-03-08 08:32:01,348 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 08:32:01,348 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713292242]
[2025-03-08 08:32:01,348 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713292242] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 08:32:01,348 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653548128]
[2025-03-08 08:32:01,348 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 08:32:01,348 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 08:32:01,348 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 08:32:01,351 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 08:32:01,352 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-03-08 08:32:02,194 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes.
[2025-03-08 08:32:02,892 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements.
[2025-03-08 08:32:02,892 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 08:32:02,892 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 08:32:02,903 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2074 conjuncts, 42 conjuncts are in the unsatisfiable core
[2025-03-08 08:32:02,911 INFO  L279         TraceCheckSpWp]: Computing forward predicates...