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


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


Checking for ERROR reachability
Using default analysis
Version c00e63dc
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal9.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 21ba1e2aac39d30ab80cebcc5810c00ee6372583f3d8403b849f6ba17231dc2d
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 18:50:24,498 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 18:50:24,541 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf
[2025-02-05 18:50:24,547 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 18:50:24,548 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 18:50:24,569 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 18:50:24,570 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 18:50:24,570 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 18:50:24,570 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 18:50:24,571 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 18:50:24,571 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 18:50:24,571 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 18:50:24,571 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 18:50:24,572 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 18:50:24,572 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 18:50:24,572 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 18:50:24,572 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 18:50:24,572 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 18:50:24,572 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 18:50:24,572 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 18:50:24,572 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 18:50:24,572 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 18:50:24,572 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 18:50:24,572 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 18:50:24,573 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 18:50:24,573 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 18:50:24,573 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 18:50:24,573 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 18:50:24,573 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 18:50:24,573 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 18:50:24,573 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 18:50:24,573 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 18:50:24,573 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 18:50:24,573 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 18:50:24,573 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 18:50:24,573 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 18:50:24,573 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 18:50:24,573 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 18:50:24,573 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 18:50:24,573 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 18:50:24,573 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 21ba1e2aac39d30ab80cebcc5810c00ee6372583f3d8403b849f6ba17231dc2d
[2025-02-05 18:50:24,770 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 18:50:24,775 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 18:50:24,776 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 18:50:24,777 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 18:50:24,777 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 18:50:24,778 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal9.c
[2025-02-05 18:50:25,910 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8152b4eee/45df9f0649c54372bd5a4063b22b98b3/FLAGef8537856
[2025-02-05 18:50:26,285 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 18:50:26,285 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal9.c
[2025-02-05 18:50:26,301 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8152b4eee/45df9f0649c54372bd5a4063b22b98b3/FLAGef8537856
[2025-02-05 18:50:26,469 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8152b4eee/45df9f0649c54372bd5a4063b22b98b3
[2025-02-05 18:50:26,471 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 18:50:26,472 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 18:50:26,473 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 18:50:26,474 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 18:50:26,478 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 18:50:26,478 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:50:26" (1/1) ...
[2025-02-05 18:50:26,479 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30270c5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:50:26, skipping insertion in model container
[2025-02-05 18:50:26,479 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:50:26" (1/1) ...
[2025-02-05 18:50:26,518 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 18:50:26,640 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal9.c[1244,1257]
[2025-02-05 18:50:26,849 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 18:50:26,857 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 18:50:26,864 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal9.c[1244,1257]
[2025-02-05 18:50:26,975 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 18:50:26,983 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 18:50:26,984 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:50:26 WrapperNode
[2025-02-05 18:50:26,984 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 18:50:26,985 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 18:50:26,985 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 18:50:26,985 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 18:50:26,989 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:50:26" (1/1) ...
[2025-02-05 18:50:27,016 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:50:26" (1/1) ...
[2025-02-05 18:50:27,293 INFO  L138                Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3628
[2025-02-05 18:50:27,294 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 18:50:27,294 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 18:50:27,295 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 18:50:27,295 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 18:50:27,300 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:50:26" (1/1) ...
[2025-02-05 18:50:27,301 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:50:26" (1/1) ...
[2025-02-05 18:50:27,342 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:50:26" (1/1) ...
[2025-02-05 18:50:27,487 INFO  L175           MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0].
[2025-02-05 18:50:27,487 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:50:26" (1/1) ...
[2025-02-05 18:50:27,488 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:50:26" (1/1) ...
[2025-02-05 18:50:27,564 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:50:26" (1/1) ...
[2025-02-05 18:50:27,583 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:50:26" (1/1) ...
[2025-02-05 18:50:27,599 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:50:26" (1/1) ...
[2025-02-05 18:50:27,617 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:50:26" (1/1) ...
[2025-02-05 18:50:27,716 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 18:50:27,719 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 18:50:27,719 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 18:50:27,719 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 18:50:27,720 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:50:26" (1/1) ...
[2025-02-05 18:50:27,727 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 18:50:27,746 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 18:50:27,771 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-05 18:50:27,777 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-05 18:50:27,822 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 18:50:27,823 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 18:50:27,823 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#1
[2025-02-05 18:50:27,823 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 18:50:27,823 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 18:50:28,135 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 18:50:28,137 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 18:50:30,885 INFO  L?                        ?]: Removed 2034 outVars from TransFormulas that were not future-live.
[2025-02-05 18:50:30,885 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 18:50:31,084 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 18:50:31,084 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 18:50:31,084 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:50:31 BoogieIcfgContainer
[2025-02-05 18:50:31,084 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 18:50:31,086 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 18:50:31,086 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 18:50:31,092 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 18:50:31,092 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 06:50:26" (1/3) ...
[2025-02-05 18:50:31,092 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b53e814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:50:31, skipping insertion in model container
[2025-02-05 18:50:31,096 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:50:26" (2/3) ...
[2025-02-05 18:50:31,097 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b53e814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:50:31, skipping insertion in model container
[2025-02-05 18:50:31,097 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:50:31" (3/3) ...
[2025-02-05 18:50:31,098 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal9.c
[2025-02-05 18:50:31,114 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 18:50:31,116 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal9.c that has 1 procedures, 1085 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 18:50:31,181 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 18:50:31,204 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;@55be4998, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 18:50:31,205 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 18:50:31,210 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 1085 states, 1083 states have (on average 1.5004616805170823) internal successors, (1625), 1084 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:31,245 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 346
[2025-02-05 18:50:31,247 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:50:31,248 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:50:31,251 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:50:31,259 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:50:31,260 INFO  L85        PathProgramCache]: Analyzing trace with hash -1313250636, now seen corresponding path program 1 times
[2025-02-05 18:50:31,272 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:50:31,272 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751102640]
[2025-02-05 18:50:31,274 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:50:31,274 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:50:31,440 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes.
[2025-02-05 18:50:31,815 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements.
[2025-02-05 18:50:31,816 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:50:31,816 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:50:33,339 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:50:33,342 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:50:33,342 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751102640]
[2025-02-05 18:50:33,343 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751102640] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:50:33,344 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:50:33,344 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 18:50:33,345 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888335782]
[2025-02-05 18:50:33,345 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:50:33,348 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 18:50:33,349 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:50:33,364 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 18:50:33,364 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 18:50:33,367 INFO  L87              Difference]: Start difference. First operand  has 1085 states, 1083 states have (on average 1.5004616805170823) internal successors, (1625), 1084 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:33,898 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:50:33,898 INFO  L93              Difference]: Finished difference Result 2139 states and 3207 transitions.
[2025-02-05 18:50:33,899 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:50:33,900 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 345
[2025-02-05 18:50:33,901 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:50:33,915 INFO  L225             Difference]: With dead ends: 2139
[2025-02-05 18:50:33,919 INFO  L226             Difference]: Without dead ends: 1084
[2025-02-05 18:50:33,923 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 18:50:33,928 INFO  L435           NwaCegarLoop]: 1351 mSDtfsCounter, 0 mSDsluCounter, 2697 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4048 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 18:50:33,928 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4048 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 18:50:33,947 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1084 states.
[2025-02-05 18:50:33,987 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1084.
[2025-02-05 18:50:33,993 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1084 states, 1083 states have (on average 1.4986149584487534) internal successors, (1623), 1083 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:34,000 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1623 transitions.
[2025-02-05 18:50:34,001 INFO  L78                 Accepts]: Start accepts. Automaton has 1084 states and 1623 transitions. Word has length 345
[2025-02-05 18:50:34,003 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:50:34,004 INFO  L471      AbstractCegarLoop]: Abstraction has 1084 states and 1623 transitions.
[2025-02-05 18:50:34,005 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:34,005 INFO  L276                IsEmpty]: Start isEmpty. Operand 1084 states and 1623 transitions.
[2025-02-05 18:50:34,009 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 347
[2025-02-05 18:50:34,009 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:50:34,009 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:50:34,009 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 18:50:34,009 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:50:34,012 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:50:34,012 INFO  L85        PathProgramCache]: Analyzing trace with hash -2051384221, now seen corresponding path program 1 times
[2025-02-05 18:50:34,012 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:50:34,012 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856428761]
[2025-02-05 18:50:34,012 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:50:34,013 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:50:34,082 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes.
[2025-02-05 18:50:34,192 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements.
[2025-02-05 18:50:34,194 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:50:34,194 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:50:34,693 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:50:34,696 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:50:34,696 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856428761]
[2025-02-05 18:50:34,696 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856428761] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:50:34,697 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:50:34,697 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 18:50:34,697 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834939881]
[2025-02-05 18:50:34,697 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:50:34,698 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 18:50:34,698 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:50:34,700 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 18:50:34,700 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 18:50:34,700 INFO  L87              Difference]: Start difference. First operand 1084 states and 1623 transitions. Second operand  has 4 states, 4 states have (on average 86.5) internal successors, (346), 4 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:35,167 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:50:35,168 INFO  L93              Difference]: Finished difference Result 2140 states and 3205 transitions.
[2025-02-05 18:50:35,169 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:50:35,169 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 86.5) internal successors, (346), 4 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 346
[2025-02-05 18:50:35,170 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:50:35,175 INFO  L225             Difference]: With dead ends: 2140
[2025-02-05 18:50:35,176 INFO  L226             Difference]: Without dead ends: 1086
[2025-02-05 18:50:35,177 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 18:50:35,177 INFO  L435           NwaCegarLoop]: 1351 mSDtfsCounter, 0 mSDsluCounter, 2694 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4045 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 18:50:35,178 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4045 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 18:50:35,179 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1086 states.
[2025-02-05 18:50:35,197 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 1086.
[2025-02-05 18:50:35,199 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1086 states, 1085 states have (on average 1.4976958525345623) internal successors, (1625), 1085 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:35,202 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1625 transitions.
[2025-02-05 18:50:35,202 INFO  L78                 Accepts]: Start accepts. Automaton has 1086 states and 1625 transitions. Word has length 346
[2025-02-05 18:50:35,203 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:50:35,203 INFO  L471      AbstractCegarLoop]: Abstraction has 1086 states and 1625 transitions.
[2025-02-05 18:50:35,203 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 86.5) internal successors, (346), 4 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:35,203 INFO  L276                IsEmpty]: Start isEmpty. Operand 1086 states and 1625 transitions.
[2025-02-05 18:50:35,206 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 348
[2025-02-05 18:50:35,206 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:50:35,206 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:50:35,206 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 18:50:35,206 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:50:35,209 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:50:35,210 INFO  L85        PathProgramCache]: Analyzing trace with hash -1531858801, now seen corresponding path program 1 times
[2025-02-05 18:50:35,210 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:50:35,210 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834165896]
[2025-02-05 18:50:35,210 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:50:35,210 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:50:35,290 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes.
[2025-02-05 18:50:37,050 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements.
[2025-02-05 18:50:37,050 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:50:37,050 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:50:38,810 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:50:38,810 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:50:38,811 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834165896]
[2025-02-05 18:50:38,811 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834165896] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:50:38,811 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:50:38,811 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-05 18:50:38,811 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289119394]
[2025-02-05 18:50:38,811 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:50:38,811 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 18:50:38,811 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:50:38,812 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 18:50:38,812 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-02-05 18:50:38,812 INFO  L87              Difference]: Start difference. First operand 1086 states and 1625 transitions. Second operand  has 6 states, 6 states have (on average 57.833333333333336) internal successors, (347), 6 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:39,672 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:50:39,673 INFO  L93              Difference]: Finished difference Result 2806 states and 4199 transitions.
[2025-02-05 18:50:39,673 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 18:50:39,673 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 57.833333333333336) internal successors, (347), 6 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 347
[2025-02-05 18:50:39,674 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:50:39,680 INFO  L225             Difference]: With dead ends: 2806
[2025-02-05 18:50:39,681 INFO  L226             Difference]: Without dead ends: 1750
[2025-02-05 18:50:39,683 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2025-02-05 18:50:39,683 INFO  L435           NwaCegarLoop]: 1332 mSDtfsCounter, 4181 mSDsluCounter, 3997 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4181 SdHoareTripleChecker+Valid, 5329 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 18:50:39,683 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4181 Valid, 5329 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 18:50:39,685 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1750 states.
[2025-02-05 18:50:39,704 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1731.
[2025-02-05 18:50:39,707 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1731 states, 1730 states have (on average 1.498843930635838) internal successors, (2593), 1730 states have internal predecessors, (2593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:39,711 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2593 transitions.
[2025-02-05 18:50:39,711 INFO  L78                 Accepts]: Start accepts. Automaton has 1731 states and 2593 transitions. Word has length 347
[2025-02-05 18:50:39,711 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:50:39,711 INFO  L471      AbstractCegarLoop]: Abstraction has 1731 states and 2593 transitions.
[2025-02-05 18:50:39,712 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 57.833333333333336) internal successors, (347), 6 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:39,712 INFO  L276                IsEmpty]: Start isEmpty. Operand 1731 states and 2593 transitions.
[2025-02-05 18:50:39,714 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 349
[2025-02-05 18:50:39,714 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:50:39,715 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:50:39,715 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 18:50:39,715 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:50:39,715 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:50:39,715 INFO  L85        PathProgramCache]: Analyzing trace with hash 1645380616, now seen corresponding path program 1 times
[2025-02-05 18:50:39,716 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:50:39,716 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030104191]
[2025-02-05 18:50:39,716 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:50:39,716 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:50:39,782 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes.
[2025-02-05 18:50:40,174 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements.
[2025-02-05 18:50:40,174 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:50:40,174 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:50:40,759 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:50:40,759 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:50:40,759 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030104191]
[2025-02-05 18:50:40,759 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030104191] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:50:40,759 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:50:40,759 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 18:50:40,759 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915845108]
[2025-02-05 18:50:40,759 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:50:40,761 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 18:50:40,761 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:50:40,761 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 18:50:40,761 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 18:50:40,762 INFO  L87              Difference]: Start difference. First operand 1731 states and 2593 transitions. Second operand  has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:41,600 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:50:41,601 INFO  L93              Difference]: Finished difference Result 3781 states and 5663 transitions.
[2025-02-05 18:50:41,601 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 18:50:41,601 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 348
[2025-02-05 18:50:41,602 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:50:41,606 INFO  L225             Difference]: With dead ends: 3781
[2025-02-05 18:50:41,606 INFO  L226             Difference]: Without dead ends: 1731
[2025-02-05 18:50:41,609 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-02-05 18:50:41,609 INFO  L435           NwaCegarLoop]: 2048 mSDtfsCounter, 1429 mSDsluCounter, 3248 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1429 SdHoareTripleChecker+Valid, 5296 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 18:50:41,609 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1429 Valid, 5296 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1302 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 18:50:41,611 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1731 states.
[2025-02-05 18:50:41,631 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1731.
[2025-02-05 18:50:41,633 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1731 states, 1730 states have (on average 1.4976878612716762) internal successors, (2591), 1730 states have internal predecessors, (2591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:41,637 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2591 transitions.
[2025-02-05 18:50:41,638 INFO  L78                 Accepts]: Start accepts. Automaton has 1731 states and 2591 transitions. Word has length 348
[2025-02-05 18:50:41,638 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:50:41,638 INFO  L471      AbstractCegarLoop]: Abstraction has 1731 states and 2591 transitions.
[2025-02-05 18:50:41,638 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:41,639 INFO  L276                IsEmpty]: Start isEmpty. Operand 1731 states and 2591 transitions.
[2025-02-05 18:50:41,641 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 350
[2025-02-05 18:50:41,641 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:50:41,641 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:50:41,641 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 18:50:41,642 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:50:41,642 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:50:41,642 INFO  L85        PathProgramCache]: Analyzing trace with hash 415405728, now seen corresponding path program 1 times
[2025-02-05 18:50:41,643 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:50:41,643 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280292726]
[2025-02-05 18:50:41,643 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:50:41,643 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:50:41,707 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes.
[2025-02-05 18:50:42,147 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements.
[2025-02-05 18:50:42,148 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:50:42,148 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:50:42,759 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:50:42,761 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:50:42,761 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280292726]
[2025-02-05 18:50:42,761 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280292726] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:50:42,761 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:50:42,761 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 18:50:42,761 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061403818]
[2025-02-05 18:50:42,761 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:50:42,762 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 18:50:42,762 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:50:42,762 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 18:50:42,762 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 18:50:42,763 INFO  L87              Difference]: Start difference. First operand 1731 states and 2591 transitions. Second operand  has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:43,192 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:50:43,192 INFO  L93              Difference]: Finished difference Result 2809 states and 4202 transitions.
[2025-02-05 18:50:43,193 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:50:43,193 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 349
[2025-02-05 18:50:43,193 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:50:43,198 INFO  L225             Difference]: With dead ends: 2809
[2025-02-05 18:50:43,198 INFO  L226             Difference]: Without dead ends: 1731
[2025-02-05 18:50:43,199 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-02-05 18:50:43,201 INFO  L435           NwaCegarLoop]: 1347 mSDtfsCounter, 28 mSDsluCounter, 2669 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 4016 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 18:50:43,201 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 4016 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 18:50:43,204 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1731 states.
[2025-02-05 18:50:43,225 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1731.
[2025-02-05 18:50:43,227 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1731 states, 1730 states have (on average 1.4965317919075145) internal successors, (2589), 1730 states have internal predecessors, (2589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:43,231 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2589 transitions.
[2025-02-05 18:50:43,232 INFO  L78                 Accepts]: Start accepts. Automaton has 1731 states and 2589 transitions. Word has length 349
[2025-02-05 18:50:43,232 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:50:43,232 INFO  L471      AbstractCegarLoop]: Abstraction has 1731 states and 2589 transitions.
[2025-02-05 18:50:43,232 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:43,232 INFO  L276                IsEmpty]: Start isEmpty. Operand 1731 states and 2589 transitions.
[2025-02-05 18:50:43,235 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 351
[2025-02-05 18:50:43,235 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:50:43,236 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:50:43,236 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 18:50:43,237 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:50:43,237 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:50:43,237 INFO  L85        PathProgramCache]: Analyzing trace with hash 1158209271, now seen corresponding path program 1 times
[2025-02-05 18:50:43,237 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:50:43,237 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148557794]
[2025-02-05 18:50:43,237 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:50:43,237 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:50:43,304 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes.
[2025-02-05 18:50:44,469 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements.
[2025-02-05 18:50:44,469 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:50:44,470 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:50:45,348 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:50:45,349 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:50:45,349 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148557794]
[2025-02-05 18:50:45,349 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148557794] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:50:45,349 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:50:45,349 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:50:45,352 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439214374]
[2025-02-05 18:50:45,352 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:50:45,353 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:50:45,353 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:50:45,353 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:50:45,353 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:50:45,354 INFO  L87              Difference]: Start difference. First operand 1731 states and 2589 transitions. Second operand  has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:46,052 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:50:46,053 INFO  L93              Difference]: Finished difference Result 2805 states and 4192 transitions.
[2025-02-05 18:50:46,053 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 18:50:46,053 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 350
[2025-02-05 18:50:46,053 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:50:46,061 INFO  L225             Difference]: With dead ends: 2805
[2025-02-05 18:50:46,061 INFO  L226             Difference]: Without dead ends: 1739
[2025-02-05 18:50:46,062 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-05 18:50:46,062 INFO  L435           NwaCegarLoop]: 1202 mSDtfsCounter, 1293 mSDsluCounter, 2399 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1293 SdHoareTripleChecker+Valid, 3601 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 18:50:46,063 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1293 Valid, 3601 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 18:50:46,064 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1739 states.
[2025-02-05 18:50:46,080 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1737.
[2025-02-05 18:50:46,082 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1737 states, 1736 states have (on average 1.494815668202765) internal successors, (2595), 1736 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:46,084 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 2595 transitions.
[2025-02-05 18:50:46,084 INFO  L78                 Accepts]: Start accepts. Automaton has 1737 states and 2595 transitions. Word has length 350
[2025-02-05 18:50:46,084 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:50:46,084 INFO  L471      AbstractCegarLoop]: Abstraction has 1737 states and 2595 transitions.
[2025-02-05 18:50:46,085 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:46,085 INFO  L276                IsEmpty]: Start isEmpty. Operand 1737 states and 2595 transitions.
[2025-02-05 18:50:46,087 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 352
[2025-02-05 18:50:46,087 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:50:46,087 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:50:46,088 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 18:50:46,088 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:50:46,088 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:50:46,088 INFO  L85        PathProgramCache]: Analyzing trace with hash 980177096, now seen corresponding path program 1 times
[2025-02-05 18:50:46,088 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:50:46,088 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937575403]
[2025-02-05 18:50:46,088 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:50:46,089 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:50:46,145 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes.
[2025-02-05 18:50:47,329 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements.
[2025-02-05 18:50:47,330 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:50:47,330 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:50:48,207 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:50:48,207 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:50:48,207 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937575403]
[2025-02-05 18:50:48,208 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937575403] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:50:48,208 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:50:48,208 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-05 18:50:48,208 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158359223]
[2025-02-05 18:50:48,208 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:50:48,208 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-05 18:50:48,208 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:50:48,209 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-05 18:50:48,209 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-02-05 18:50:48,210 INFO  L87              Difference]: Start difference. First operand 1737 states and 2595 transitions. Second operand  has 8 states, 8 states have (on average 43.875) internal successors, (351), 8 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:49,175 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:50:49,175 INFO  L93              Difference]: Finished difference Result 2817 states and 4204 transitions.
[2025-02-05 18:50:49,175 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-05 18:50:49,175 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 43.875) internal successors, (351), 8 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 351
[2025-02-05 18:50:49,176 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:50:49,180 INFO  L225             Difference]: With dead ends: 2817
[2025-02-05 18:50:49,180 INFO  L226             Difference]: Without dead ends: 1758
[2025-02-05 18:50:49,181 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156
[2025-02-05 18:50:49,182 INFO  L435           NwaCegarLoop]: 1329 mSDtfsCounter, 4173 mSDsluCounter, 6641 mSDsCounter, 0 mSdLazyCounter, 1744 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4173 SdHoareTripleChecker+Valid, 7970 SdHoareTripleChecker+Invalid, 1744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-05 18:50:49,182 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4173 Valid, 7970 Invalid, 1744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1744 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-05 18:50:49,183 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1758 states.
[2025-02-05 18:50:49,198 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1740.
[2025-02-05 18:50:49,200 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1740 states, 1739 states have (on average 1.4945370902817712) internal successors, (2599), 1739 states have internal predecessors, (2599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:49,202 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1740 states and 2599 transitions.
[2025-02-05 18:50:49,203 INFO  L78                 Accepts]: Start accepts. Automaton has 1740 states and 2599 transitions. Word has length 351
[2025-02-05 18:50:49,203 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:50:49,203 INFO  L471      AbstractCegarLoop]: Abstraction has 1740 states and 2599 transitions.
[2025-02-05 18:50:49,203 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 43.875) internal successors, (351), 8 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:49,203 INFO  L276                IsEmpty]: Start isEmpty. Operand 1740 states and 2599 transitions.
[2025-02-05 18:50:49,206 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 353
[2025-02-05 18:50:49,206 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:50:49,206 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:50:49,206 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 18:50:49,206 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:50:49,206 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:50:49,207 INFO  L85        PathProgramCache]: Analyzing trace with hash 1521985787, now seen corresponding path program 1 times
[2025-02-05 18:50:49,207 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:50:49,207 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100525363]
[2025-02-05 18:50:49,207 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:50:49,207 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:50:49,266 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes.
[2025-02-05 18:50:49,572 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements.
[2025-02-05 18:50:49,573 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:50:49,573 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:50:50,150 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:50:50,150 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:50:50,150 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100525363]
[2025-02-05 18:50:50,150 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100525363] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:50:50,150 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:50:50,150 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 18:50:50,150 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993035148]
[2025-02-05 18:50:50,150 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:50:50,151 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 18:50:50,151 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:50:50,151 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 18:50:50,151 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 18:50:50,152 INFO  L87              Difference]: Start difference. First operand 1740 states and 2599 transitions. Second operand  has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:50,670 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:50:50,671 INFO  L93              Difference]: Finished difference Result 2847 states and 4245 transitions.
[2025-02-05 18:50:50,671 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:50:50,671 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 352
[2025-02-05 18:50:50,672 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:50:50,675 INFO  L225             Difference]: With dead ends: 2847
[2025-02-05 18:50:50,675 INFO  L226             Difference]: Without dead ends: 1740
[2025-02-05 18:50:50,677 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 18:50:50,677 INFO  L435           NwaCegarLoop]: 1347 mSDtfsCounter, 12 mSDsluCounter, 2547 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3894 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 18:50:50,677 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3894 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 18:50:50,678 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1740 states.
[2025-02-05 18:50:50,693 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740 to 1740.
[2025-02-05 18:50:50,695 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1740 states, 1739 states have (on average 1.493387004025302) internal successors, (2597), 1739 states have internal predecessors, (2597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:50,697 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1740 states and 2597 transitions.
[2025-02-05 18:50:50,697 INFO  L78                 Accepts]: Start accepts. Automaton has 1740 states and 2597 transitions. Word has length 352
[2025-02-05 18:50:50,697 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:50:50,697 INFO  L471      AbstractCegarLoop]: Abstraction has 1740 states and 2597 transitions.
[2025-02-05 18:50:50,697 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:50,698 INFO  L276                IsEmpty]: Start isEmpty. Operand 1740 states and 2597 transitions.
[2025-02-05 18:50:50,699 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 354
[2025-02-05 18:50:50,699 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:50:50,699 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:50:50,699 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 18:50:50,700 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:50:50,700 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:50:50,700 INFO  L85        PathProgramCache]: Analyzing trace with hash -1357707521, now seen corresponding path program 1 times
[2025-02-05 18:50:50,700 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:50:50,700 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533096574]
[2025-02-05 18:50:50,700 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:50:50,700 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:50:50,766 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes.
[2025-02-05 18:50:50,815 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements.
[2025-02-05 18:50:50,816 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:50:50,816 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:50:51,378 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:50:51,379 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:50:51,379 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533096574]
[2025-02-05 18:50:51,379 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533096574] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:50:51,379 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:50:51,379 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:50:51,379 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443173557]
[2025-02-05 18:50:51,379 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:50:51,380 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:50:51,380 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:50:51,380 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:50:51,380 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:50:51,380 INFO  L87              Difference]: Start difference. First operand 1740 states and 2597 transitions. Second operand  has 5 states, 5 states have (on average 70.6) internal successors, (353), 5 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:52,034 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:50:52,035 INFO  L93              Difference]: Finished difference Result 2835 states and 4226 transitions.
[2025-02-05 18:50:52,035 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 18:50:52,035 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 70.6) internal successors, (353), 5 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 353
[2025-02-05 18:50:52,035 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:50:52,039 INFO  L225             Difference]: With dead ends: 2835
[2025-02-05 18:50:52,039 INFO  L226             Difference]: Without dead ends: 1748
[2025-02-05 18:50:52,040 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:50:52,041 INFO  L435           NwaCegarLoop]: 1201 mSDtfsCounter, 1617 mSDsluCounter, 2397 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1617 SdHoareTripleChecker+Valid, 3598 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 18:50:52,041 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1617 Valid, 3598 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 18:50:52,042 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1748 states.
[2025-02-05 18:50:52,055 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1746.
[2025-02-05 18:50:52,057 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1746 states, 1745 states have (on average 1.4916905444126074) internal successors, (2603), 1745 states have internal predecessors, (2603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:52,059 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1746 states and 2603 transitions.
[2025-02-05 18:50:52,059 INFO  L78                 Accepts]: Start accepts. Automaton has 1746 states and 2603 transitions. Word has length 353
[2025-02-05 18:50:52,059 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:50:52,059 INFO  L471      AbstractCegarLoop]: Abstraction has 1746 states and 2603 transitions.
[2025-02-05 18:50:52,059 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 70.6) internal successors, (353), 5 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:52,060 INFO  L276                IsEmpty]: Start isEmpty. Operand 1746 states and 2603 transitions.
[2025-02-05 18:50:52,061 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 355
[2025-02-05 18:50:52,061 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:50:52,061 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:50:52,061 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 18:50:52,061 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:50:52,062 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:50:52,062 INFO  L85        PathProgramCache]: Analyzing trace with hash -1812079321, now seen corresponding path program 1 times
[2025-02-05 18:50:52,062 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:50:52,062 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296581166]
[2025-02-05 18:50:52,062 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:50:52,062 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:50:52,122 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes.
[2025-02-05 18:50:53,008 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements.
[2025-02-05 18:50:53,008 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:50:53,009 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:50:54,339 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:50:54,339 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:50:54,339 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296581166]
[2025-02-05 18:50:54,339 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296581166] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:50:54,339 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:50:54,339 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-02-05 18:50:54,339 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607962408]
[2025-02-05 18:50:54,339 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:50:54,341 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-02-05 18:50:54,341 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:50:54,341 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-02-05 18:50:54,341 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2025-02-05 18:50:54,342 INFO  L87              Difference]: Start difference. First operand 1746 states and 2603 transitions. Second operand  has 9 states, 9 states have (on average 39.333333333333336) internal successors, (354), 9 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:55,432 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:50:55,432 INFO  L93              Difference]: Finished difference Result 2826 states and 4209 transitions.
[2025-02-05 18:50:55,432 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-02-05 18:50:55,433 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 39.333333333333336) internal successors, (354), 9 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 354
[2025-02-05 18:50:55,433 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:50:55,436 INFO  L225             Difference]: With dead ends: 2826
[2025-02-05 18:50:55,437 INFO  L226             Difference]: Without dead ends: 1764
[2025-02-05 18:50:55,438 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210
[2025-02-05 18:50:55,438 INFO  L435           NwaCegarLoop]: 1323 mSDtfsCounter, 4161 mSDsluCounter, 7936 mSDsCounter, 0 mSdLazyCounter, 2067 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4161 SdHoareTripleChecker+Valid, 9259 SdHoareTripleChecker+Invalid, 2068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-02-05 18:50:55,438 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4161 Valid, 9259 Invalid, 2068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2067 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-02-05 18:50:55,439 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1764 states.
[2025-02-05 18:50:55,452 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1750.
[2025-02-05 18:50:55,453 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1750 states, 1749 states have (on average 1.4911377930245855) internal successors, (2608), 1749 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:55,455 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2608 transitions.
[2025-02-05 18:50:55,455 INFO  L78                 Accepts]: Start accepts. Automaton has 1750 states and 2608 transitions. Word has length 354
[2025-02-05 18:50:55,456 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:50:55,456 INFO  L471      AbstractCegarLoop]: Abstraction has 1750 states and 2608 transitions.
[2025-02-05 18:50:55,456 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 39.333333333333336) internal successors, (354), 9 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:55,456 INFO  L276                IsEmpty]: Start isEmpty. Operand 1750 states and 2608 transitions.
[2025-02-05 18:50:55,458 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 356
[2025-02-05 18:50:55,458 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:50:55,458 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:50:55,458 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 18:50:55,458 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:50:55,459 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:50:55,459 INFO  L85        PathProgramCache]: Analyzing trace with hash 2078752085, now seen corresponding path program 1 times
[2025-02-05 18:50:55,459 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:50:55,459 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173038803]
[2025-02-05 18:50:55,459 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:50:55,459 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:50:55,514 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes.
[2025-02-05 18:50:56,205 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements.
[2025-02-05 18:50:56,206 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:50:56,206 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:50:57,093 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:50:57,093 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:50:57,093 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173038803]
[2025-02-05 18:50:57,093 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173038803] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:50:57,093 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:50:57,094 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-05 18:50:57,094 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550548246]
[2025-02-05 18:50:57,094 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:50:57,094 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-05 18:50:57,094 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:50:57,095 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-05 18:50:57,095 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-02-05 18:50:57,095 INFO  L87              Difference]: Start difference. First operand 1750 states and 2608 transitions. Second operand  has 8 states, 8 states have (on average 44.375) internal successors, (355), 8 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:57,878 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:50:57,878 INFO  L93              Difference]: Finished difference Result 4145 states and 6183 transitions.
[2025-02-05 18:50:57,879 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-02-05 18:50:57,879 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 44.375) internal successors, (355), 8 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 355
[2025-02-05 18:50:57,879 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:50:57,884 INFO  L225             Difference]: With dead ends: 4145
[2025-02-05 18:50:57,885 INFO  L226             Difference]: Without dead ends: 2694
[2025-02-05 18:50:57,886 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132
[2025-02-05 18:50:57,886 INFO  L435           NwaCegarLoop]: 1338 mSDtfsCounter, 3024 mSDsluCounter, 6542 mSDsCounter, 0 mSdLazyCounter, 1828 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3024 SdHoareTripleChecker+Valid, 7880 SdHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 18:50:57,886 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3024 Valid, 7880 Invalid, 1831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1828 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 18:50:57,888 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2694 states.
[2025-02-05 18:50:57,906 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2640.
[2025-02-05 18:50:57,909 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2640 states, 2639 states have (on average 1.4945054945054945) internal successors, (3944), 2639 states have internal predecessors, (3944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:57,911 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2640 states and 3944 transitions.
[2025-02-05 18:50:57,912 INFO  L78                 Accepts]: Start accepts. Automaton has 2640 states and 3944 transitions. Word has length 355
[2025-02-05 18:50:57,912 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:50:57,912 INFO  L471      AbstractCegarLoop]: Abstraction has 2640 states and 3944 transitions.
[2025-02-05 18:50:57,914 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 44.375) internal successors, (355), 8 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:50:57,915 INFO  L276                IsEmpty]: Start isEmpty. Operand 2640 states and 3944 transitions.
[2025-02-05 18:50:57,916 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 357
[2025-02-05 18:50:57,917 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:50:57,917 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:50:57,917 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 18:50:57,917 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:50:57,917 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:50:57,917 INFO  L85        PathProgramCache]: Analyzing trace with hash 882538804, now seen corresponding path program 1 times
[2025-02-05 18:50:57,918 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:50:57,918 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755915785]
[2025-02-05 18:50:57,918 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:50:57,918 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:50:57,985 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes.
[2025-02-05 18:50:58,816 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements.
[2025-02-05 18:50:58,817 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:50:58,817 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:50:59,625 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:50:59,626 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:50:59,626 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755915785]
[2025-02-05 18:50:59,626 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755915785] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:50:59,626 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:50:59,626 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-05 18:50:59,626 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026861616]
[2025-02-05 18:50:59,626 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:50:59,626 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-05 18:50:59,627 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:50:59,627 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-05 18:50:59,627 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-02-05 18:50:59,630 INFO  L87              Difference]: Start difference. First operand 2640 states and 3944 transitions. Second operand  has 7 states, 7 states have (on average 50.857142857142854) internal successors, (356), 7 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:00,569 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:51:00,569 INFO  L93              Difference]: Finished difference Result 4396 states and 6560 transitions.
[2025-02-05 18:51:00,569 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-05 18:51:00,570 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 50.857142857142854) internal successors, (356), 7 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 356
[2025-02-05 18:51:00,570 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:51:00,575 INFO  L225             Difference]: With dead ends: 4396
[2025-02-05 18:51:00,575 INFO  L226             Difference]: Without dead ends: 2694
[2025-02-05 18:51:00,576 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2025-02-05 18:51:00,577 INFO  L435           NwaCegarLoop]: 1230 mSDtfsCounter, 2699 mSDsluCounter, 4875 mSDsCounter, 0 mSdLazyCounter, 2132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2699 SdHoareTripleChecker+Valid, 6105 SdHoareTripleChecker+Invalid, 2132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-05 18:51:00,577 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2699 Valid, 6105 Invalid, 2132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2132 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-05 18:51:00,578 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2694 states.
[2025-02-05 18:51:00,617 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2642.
[2025-02-05 18:51:00,620 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2642 states, 2641 states have (on average 1.4941310109806891) internal successors, (3946), 2641 states have internal predecessors, (3946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:00,622 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2642 states to 2642 states and 3946 transitions.
[2025-02-05 18:51:00,622 INFO  L78                 Accepts]: Start accepts. Automaton has 2642 states and 3946 transitions. Word has length 356
[2025-02-05 18:51:00,622 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:51:00,622 INFO  L471      AbstractCegarLoop]: Abstraction has 2642 states and 3946 transitions.
[2025-02-05 18:51:00,623 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 50.857142857142854) internal successors, (356), 7 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:00,623 INFO  L276                IsEmpty]: Start isEmpty. Operand 2642 states and 3946 transitions.
[2025-02-05 18:51:00,625 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 357
[2025-02-05 18:51:00,625 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:51:00,625 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:51:00,625 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 18:51:00,625 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:51:00,625 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:51:00,626 INFO  L85        PathProgramCache]: Analyzing trace with hash 593309381, now seen corresponding path program 1 times
[2025-02-05 18:51:00,626 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:51:00,626 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646245947]
[2025-02-05 18:51:00,626 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:51:00,626 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:51:00,680 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes.
[2025-02-05 18:51:01,878 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements.
[2025-02-05 18:51:01,878 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:51:01,878 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:51:02,547 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:51:02,548 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:51:02,548 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646245947]
[2025-02-05 18:51:02,548 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646245947] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:51:02,548 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:51:02,548 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 18:51:02,548 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993256243]
[2025-02-05 18:51:02,548 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:51:02,548 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 18:51:02,548 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:51:02,549 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 18:51:02,549 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 18:51:02,549 INFO  L87              Difference]: Start difference. First operand 2642 states and 3946 transitions. Second operand  has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:02,911 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:51:02,913 INFO  L93              Difference]: Finished difference Result 4253 states and 6345 transitions.
[2025-02-05 18:51:02,914 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:51:02,914 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 356
[2025-02-05 18:51:02,915 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:51:02,920 INFO  L225             Difference]: With dead ends: 4253
[2025-02-05 18:51:02,920 INFO  L226             Difference]: Without dead ends: 2642
[2025-02-05 18:51:02,921 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-02-05 18:51:02,921 INFO  L435           NwaCegarLoop]: 1340 mSDtfsCounter, 906 mSDsluCounter, 1733 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 3073 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-05 18:51:02,922 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 3073 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-05 18:51:02,923 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2642 states.
[2025-02-05 18:51:02,940 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2642 to 2642.
[2025-02-05 18:51:02,943 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2642 states, 2641 states have (on average 1.4933737220749717) internal successors, (3944), 2641 states have internal predecessors, (3944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:02,946 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2642 states to 2642 states and 3944 transitions.
[2025-02-05 18:51:02,946 INFO  L78                 Accepts]: Start accepts. Automaton has 2642 states and 3944 transitions. Word has length 356
[2025-02-05 18:51:02,946 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:51:02,946 INFO  L471      AbstractCegarLoop]: Abstraction has 2642 states and 3944 transitions.
[2025-02-05 18:51:02,947 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:02,947 INFO  L276                IsEmpty]: Start isEmpty. Operand 2642 states and 3944 transitions.
[2025-02-05 18:51:02,949 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 358
[2025-02-05 18:51:02,949 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:51:02,949 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:51:02,949 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-05 18:51:02,949 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:51:02,950 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:51:02,950 INFO  L85        PathProgramCache]: Analyzing trace with hash 1289972145, now seen corresponding path program 1 times
[2025-02-05 18:51:02,950 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:51:02,950 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696431215]
[2025-02-05 18:51:02,950 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:51:02,950 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:51:03,005 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes.
[2025-02-05 18:51:03,799 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements.
[2025-02-05 18:51:03,799 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:51:03,799 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:51:04,495 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:51:04,496 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:51:04,496 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696431215]
[2025-02-05 18:51:04,496 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696431215] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:51:04,496 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:51:04,496 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-05 18:51:04,496 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771609995]
[2025-02-05 18:51:04,496 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:51:04,497 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-05 18:51:04,497 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:51:04,497 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-05 18:51:04,497 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-02-05 18:51:04,497 INFO  L87              Difference]: Start difference. First operand 2642 states and 3944 transitions. Second operand  has 7 states, 7 states have (on average 51.0) internal successors, (357), 7 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:05,483 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:51:05,483 INFO  L93              Difference]: Finished difference Result 4257 states and 6348 transitions.
[2025-02-05 18:51:05,488 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-05 18:51:05,488 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 51.0) internal successors, (357), 7 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 357
[2025-02-05 18:51:05,488 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:51:05,498 INFO  L225             Difference]: With dead ends: 4257
[2025-02-05 18:51:05,501 INFO  L226             Difference]: Without dead ends: 2650
[2025-02-05 18:51:05,503 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2025-02-05 18:51:05,503 INFO  L435           NwaCegarLoop]: 1096 mSDtfsCounter, 1355 mSDsluCounter, 3585 mSDsCounter, 0 mSdLazyCounter, 2259 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 4681 SdHoareTripleChecker+Invalid, 2260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-05 18:51:05,503 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1355 Valid, 4681 Invalid, 2260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2259 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-05 18:51:05,505 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2650 states.
[2025-02-05 18:51:05,521 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2646.
[2025-02-05 18:51:05,524 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2646 states, 2645 states have (on average 1.4926275992438562) internal successors, (3948), 2645 states have internal predecessors, (3948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:05,528 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2646 states to 2646 states and 3948 transitions.
[2025-02-05 18:51:05,529 INFO  L78                 Accepts]: Start accepts. Automaton has 2646 states and 3948 transitions. Word has length 357
[2025-02-05 18:51:05,529 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:51:05,529 INFO  L471      AbstractCegarLoop]: Abstraction has 2646 states and 3948 transitions.
[2025-02-05 18:51:05,529 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 51.0) internal successors, (357), 7 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:05,529 INFO  L276                IsEmpty]: Start isEmpty. Operand 2646 states and 3948 transitions.
[2025-02-05 18:51:05,531 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 359
[2025-02-05 18:51:05,531 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:51:05,531 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:51:05,531 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-05 18:51:05,532 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:51:05,532 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:51:05,532 INFO  L85        PathProgramCache]: Analyzing trace with hash 1934890976, now seen corresponding path program 1 times
[2025-02-05 18:51:05,532 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:51:05,533 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388605273]
[2025-02-05 18:51:05,533 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:51:05,533 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:51:05,595 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes.
[2025-02-05 18:51:05,969 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements.
[2025-02-05 18:51:05,970 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:51:05,970 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:51:06,554 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:51:06,555 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:51:06,555 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388605273]
[2025-02-05 18:51:06,555 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388605273] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:51:06,555 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:51:06,555 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 18:51:06,555 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907841400]
[2025-02-05 18:51:06,555 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:51:06,555 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 18:51:06,555 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:51:06,556 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 18:51:06,556 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 18:51:06,556 INFO  L87              Difference]: Start difference. First operand 2646 states and 3948 transitions. Second operand  has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:06,944 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:51:06,944 INFO  L93              Difference]: Finished difference Result 4169 states and 6219 transitions.
[2025-02-05 18:51:06,945 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:51:06,945 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 358
[2025-02-05 18:51:06,945 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:51:06,952 INFO  L225             Difference]: With dead ends: 4169
[2025-02-05 18:51:06,952 INFO  L226             Difference]: Without dead ends: 2646
[2025-02-05 18:51:06,956 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 18:51:06,957 INFO  L435           NwaCegarLoop]: 1344 mSDtfsCounter, 14 mSDsluCounter, 2662 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4006 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 18:51:06,957 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4006 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 18:51:06,959 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2646 states.
[2025-02-05 18:51:06,971 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2646 to 2646.
[2025-02-05 18:51:06,973 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2646 states, 2645 states have (on average 1.4918714555765595) internal successors, (3946), 2645 states have internal predecessors, (3946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:06,975 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2646 states to 2646 states and 3946 transitions.
[2025-02-05 18:51:06,975 INFO  L78                 Accepts]: Start accepts. Automaton has 2646 states and 3946 transitions. Word has length 358
[2025-02-05 18:51:06,975 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:51:06,975 INFO  L471      AbstractCegarLoop]: Abstraction has 2646 states and 3946 transitions.
[2025-02-05 18:51:06,975 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:06,975 INFO  L276                IsEmpty]: Start isEmpty. Operand 2646 states and 3946 transitions.
[2025-02-05 18:51:06,977 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 360
[2025-02-05 18:51:06,977 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:51:06,978 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:51:06,978 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-05 18:51:06,978 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:51:06,978 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:51:06,978 INFO  L85        PathProgramCache]: Analyzing trace with hash -1984991329, now seen corresponding path program 1 times
[2025-02-05 18:51:06,978 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:51:06,978 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911932337]
[2025-02-05 18:51:06,978 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:51:06,979 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:51:07,034 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes.
[2025-02-05 18:51:08,192 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements.
[2025-02-05 18:51:08,192 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:51:08,192 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:51:08,635 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:51:08,636 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:51:08,636 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911932337]
[2025-02-05 18:51:08,639 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911932337] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:51:08,639 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:51:08,640 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:51:08,640 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176638506]
[2025-02-05 18:51:08,640 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:51:08,640 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:51:08,640 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:51:08,641 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:51:08,641 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:51:08,641 INFO  L87              Difference]: Start difference. First operand 2646 states and 3946 transitions. Second operand  has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:09,430 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:51:09,430 INFO  L93              Difference]: Finished difference Result 4257 states and 6342 transitions.
[2025-02-05 18:51:09,430 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 18:51:09,431 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 359
[2025-02-05 18:51:09,431 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:51:09,434 INFO  L225             Difference]: With dead ends: 4257
[2025-02-05 18:51:09,434 INFO  L226             Difference]: Without dead ends: 2648
[2025-02-05 18:51:09,435 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:51:09,435 INFO  L435           NwaCegarLoop]: 1103 mSDtfsCounter, 1324 mSDsluCounter, 2202 mSDsCounter, 0 mSdLazyCounter, 1541 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1324 SdHoareTripleChecker+Valid, 3305 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 18:51:09,436 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1324 Valid, 3305 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1541 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 18:51:09,437 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2648 states.
[2025-02-05 18:51:09,449 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 2648.
[2025-02-05 18:51:09,451 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2648 states, 2647 states have (on average 1.4914998111069135) internal successors, (3948), 2647 states have internal predecessors, (3948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:09,453 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2648 states to 2648 states and 3948 transitions.
[2025-02-05 18:51:09,453 INFO  L78                 Accepts]: Start accepts. Automaton has 2648 states and 3948 transitions. Word has length 359
[2025-02-05 18:51:09,453 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:51:09,453 INFO  L471      AbstractCegarLoop]: Abstraction has 2648 states and 3948 transitions.
[2025-02-05 18:51:09,456 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:09,456 INFO  L276                IsEmpty]: Start isEmpty. Operand 2648 states and 3948 transitions.
[2025-02-05 18:51:09,458 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 360
[2025-02-05 18:51:09,458 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:51:09,458 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:51:09,458 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-05 18:51:09,459 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:51:09,459 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:51:09,459 INFO  L85        PathProgramCache]: Analyzing trace with hash -1760128055, now seen corresponding path program 1 times
[2025-02-05 18:51:09,459 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:51:09,459 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982361088]
[2025-02-05 18:51:09,459 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:51:09,459 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:51:09,582 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes.
[2025-02-05 18:51:10,653 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements.
[2025-02-05 18:51:10,654 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:51:10,654 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:51:11,403 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:51:11,404 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:51:11,404 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982361088]
[2025-02-05 18:51:11,404 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982361088] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:51:11,404 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:51:11,405 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:51:11,405 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376048904]
[2025-02-05 18:51:11,405 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:51:11,405 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:51:11,405 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:51:11,406 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:51:11,406 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:51:11,406 INFO  L87              Difference]: Start difference. First operand 2648 states and 3948 transitions. Second operand  has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:11,982 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:51:11,983 INFO  L93              Difference]: Finished difference Result 4203 states and 6258 transitions.
[2025-02-05 18:51:11,983 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 18:51:11,983 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 359
[2025-02-05 18:51:11,983 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:51:11,986 INFO  L225             Difference]: With dead ends: 4203
[2025-02-05 18:51:11,986 INFO  L226             Difference]: Without dead ends: 2656
[2025-02-05 18:51:11,988 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-05 18:51:11,988 INFO  L435           NwaCegarLoop]: 1200 mSDtfsCounter, 1296 mSDsluCounter, 2395 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 3595 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 18:51:11,988 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1296 Valid, 3595 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 18:51:11,989 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2656 states.
[2025-02-05 18:51:12,001 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2654.
[2025-02-05 18:51:12,002 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2654 states, 2653 states have (on average 1.4903882397286092) internal successors, (3954), 2653 states have internal predecessors, (3954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:12,004 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 3954 transitions.
[2025-02-05 18:51:12,004 INFO  L78                 Accepts]: Start accepts. Automaton has 2654 states and 3954 transitions. Word has length 359
[2025-02-05 18:51:12,004 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:51:12,004 INFO  L471      AbstractCegarLoop]: Abstraction has 2654 states and 3954 transitions.
[2025-02-05 18:51:12,004 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:12,005 INFO  L276                IsEmpty]: Start isEmpty. Operand 2654 states and 3954 transitions.
[2025-02-05 18:51:12,006 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 360
[2025-02-05 18:51:12,006 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:51:12,006 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:51:12,006 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-02-05 18:51:12,006 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:51:12,007 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:51:12,007 INFO  L85        PathProgramCache]: Analyzing trace with hash -28596031, now seen corresponding path program 1 times
[2025-02-05 18:51:12,007 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:51:12,008 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186165993]
[2025-02-05 18:51:12,008 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:51:12,008 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:51:12,082 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes.
[2025-02-05 18:51:12,908 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements.
[2025-02-05 18:51:12,908 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:51:12,908 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:51:13,605 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:51:13,606 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:51:13,606 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186165993]
[2025-02-05 18:51:13,606 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186165993] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:51:13,606 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:51:13,606 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:51:13,606 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458587336]
[2025-02-05 18:51:13,606 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:51:13,606 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:51:13,606 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:51:13,607 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:51:13,607 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:51:13,607 INFO  L87              Difference]: Start difference. First operand 2654 states and 3954 transitions. Second operand  has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:14,080 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:51:14,080 INFO  L93              Difference]: Finished difference Result 4242 states and 6311 transitions.
[2025-02-05 18:51:14,080 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 18:51:14,080 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 359
[2025-02-05 18:51:14,081 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:51:14,084 INFO  L225             Difference]: With dead ends: 4242
[2025-02-05 18:51:14,084 INFO  L226             Difference]: Without dead ends: 2654
[2025-02-05 18:51:14,085 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-02-05 18:51:14,086 INFO  L435           NwaCegarLoop]: 1333 mSDtfsCounter, 1388 mSDsluCounter, 2649 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1388 SdHoareTripleChecker+Valid, 3982 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 18:51:14,086 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1388 Valid, 3982 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 18:51:14,087 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2654 states.
[2025-02-05 18:51:14,099 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 2654.
[2025-02-05 18:51:14,101 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2654 states, 2653 states have (on average 1.4896343761779118) internal successors, (3952), 2653 states have internal predecessors, (3952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:14,102 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 3952 transitions.
[2025-02-05 18:51:14,102 INFO  L78                 Accepts]: Start accepts. Automaton has 2654 states and 3952 transitions. Word has length 359
[2025-02-05 18:51:14,103 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:51:14,103 INFO  L471      AbstractCegarLoop]: Abstraction has 2654 states and 3952 transitions.
[2025-02-05 18:51:14,103 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:14,103 INFO  L276                IsEmpty]: Start isEmpty. Operand 2654 states and 3952 transitions.
[2025-02-05 18:51:14,104 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 361
[2025-02-05 18:51:14,105 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:51:14,105 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:51:14,105 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-02-05 18:51:14,105 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:51:14,105 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:51:14,105 INFO  L85        PathProgramCache]: Analyzing trace with hash -12087937, now seen corresponding path program 1 times
[2025-02-05 18:51:14,106 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:51:14,106 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631841075]
[2025-02-05 18:51:14,106 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:51:14,106 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:51:14,170 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes.
[2025-02-05 18:51:15,130 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements.
[2025-02-05 18:51:15,130 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:51:15,130 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:51:15,692 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:51:15,692 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:51:15,693 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631841075]
[2025-02-05 18:51:15,693 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631841075] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:51:15,693 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:51:15,693 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-05 18:51:15,693 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618518575]
[2025-02-05 18:51:15,693 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:51:15,694 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-05 18:51:15,694 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:51:15,694 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-05 18:51:15,694 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-02-05 18:51:15,694 INFO  L87              Difference]: Start difference. First operand 2654 states and 3952 transitions. Second operand  has 7 states, 7 states have (on average 51.42857142857143) internal successors, (360), 7 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:16,679 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:51:16,679 INFO  L93              Difference]: Finished difference Result 4204 states and 6256 transitions.
[2025-02-05 18:51:16,683 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-05 18:51:16,683 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 51.42857142857143) internal successors, (360), 7 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 360
[2025-02-05 18:51:16,683 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:51:16,687 INFO  L225             Difference]: With dead ends: 4204
[2025-02-05 18:51:16,687 INFO  L226             Difference]: Without dead ends: 2662
[2025-02-05 18:51:16,688 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2025-02-05 18:51:16,688 INFO  L435           NwaCegarLoop]: 1098 mSDtfsCounter, 1314 mSDsluCounter, 4372 mSDsCounter, 0 mSdLazyCounter, 2575 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 5470 SdHoareTripleChecker+Invalid, 2576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-05 18:51:16,689 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1314 Valid, 5470 Invalid, 2576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2575 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-05 18:51:16,690 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2662 states.
[2025-02-05 18:51:16,704 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2658.
[2025-02-05 18:51:16,706 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2658 states, 2657 states have (on average 1.4888972525404591) internal successors, (3956), 2657 states have internal predecessors, (3956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:16,708 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 3956 transitions.
[2025-02-05 18:51:16,708 INFO  L78                 Accepts]: Start accepts. Automaton has 2658 states and 3956 transitions. Word has length 360
[2025-02-05 18:51:16,708 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:51:16,708 INFO  L471      AbstractCegarLoop]: Abstraction has 2658 states and 3956 transitions.
[2025-02-05 18:51:16,709 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 51.42857142857143) internal successors, (360), 7 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:16,709 INFO  L276                IsEmpty]: Start isEmpty. Operand 2658 states and 3956 transitions.
[2025-02-05 18:51:16,710 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 362
[2025-02-05 18:51:16,710 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:51:16,710 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:51:16,711 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-02-05 18:51:16,711 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:51:16,712 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:51:16,712 INFO  L85        PathProgramCache]: Analyzing trace with hash -821440980, now seen corresponding path program 1 times
[2025-02-05 18:51:16,712 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:51:16,712 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21745559]
[2025-02-05 18:51:16,712 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:51:16,712 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:51:16,778 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes.
[2025-02-05 18:51:18,297 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements.
[2025-02-05 18:51:18,298 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:51:18,298 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:51:19,257 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:51:19,257 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:51:19,257 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21745559]
[2025-02-05 18:51:19,258 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21745559] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:51:19,258 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:51:19,258 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-05 18:51:19,258 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857261445]
[2025-02-05 18:51:19,258 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:51:19,258 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-05 18:51:19,258 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:51:19,259 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-05 18:51:19,259 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2025-02-05 18:51:19,259 INFO  L87              Difference]: Start difference. First operand 2658 states and 3956 transitions. Second operand  has 8 states, 8 states have (on average 45.125) internal successors, (361), 8 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:19,981 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:51:19,981 INFO  L93              Difference]: Finished difference Result 7474 states and 11118 transitions.
[2025-02-05 18:51:19,981 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-05 18:51:19,981 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 45.125) internal successors, (361), 8 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 361
[2025-02-05 18:51:19,982 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:51:19,989 INFO  L225             Difference]: With dead ends: 7474
[2025-02-05 18:51:19,989 INFO  L226             Difference]: Without dead ends: 5066
[2025-02-05 18:51:19,991 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110
[2025-02-05 18:51:19,993 INFO  L435           NwaCegarLoop]: 1334 mSDtfsCounter, 3906 mSDsluCounter, 6295 mSDsCounter, 0 mSdLazyCounter, 1616 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3906 SdHoareTripleChecker+Valid, 7629 SdHoareTripleChecker+Invalid, 1617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 18:51:19,993 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3906 Valid, 7629 Invalid, 1617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1616 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 18:51:19,999 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5066 states.
[2025-02-05 18:51:20,030 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5066 to 4590.
[2025-02-05 18:51:20,033 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4590 states, 4589 states have (on average 1.4931357594247112) internal successors, (6852), 4589 states have internal predecessors, (6852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:20,035 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4590 states to 4590 states and 6852 transitions.
[2025-02-05 18:51:20,036 INFO  L78                 Accepts]: Start accepts. Automaton has 4590 states and 6852 transitions. Word has length 361
[2025-02-05 18:51:20,037 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:51:20,037 INFO  L471      AbstractCegarLoop]: Abstraction has 4590 states and 6852 transitions.
[2025-02-05 18:51:20,037 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 45.125) internal successors, (361), 8 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:20,037 INFO  L276                IsEmpty]: Start isEmpty. Operand 4590 states and 6852 transitions.
[2025-02-05 18:51:20,039 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 363
[2025-02-05 18:51:20,039 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:51:20,040 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:51:20,040 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-02-05 18:51:20,040 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:51:20,040 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:51:20,040 INFO  L85        PathProgramCache]: Analyzing trace with hash 1253912365, now seen corresponding path program 1 times
[2025-02-05 18:51:20,040 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:51:20,041 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170881619]
[2025-02-05 18:51:20,041 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:51:20,041 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:51:20,098 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes.
[2025-02-05 18:51:20,835 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements.
[2025-02-05 18:51:20,835 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:51:20,835 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:51:21,665 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:51:21,665 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:51:21,665 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170881619]
[2025-02-05 18:51:21,665 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170881619] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:51:21,665 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:51:21,666 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:51:21,666 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191812628]
[2025-02-05 18:51:21,666 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:51:21,666 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:51:21,666 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:51:21,666 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:51:21,667 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:51:21,667 INFO  L87              Difference]: Start difference. First operand 4590 states and 6852 transitions. Second operand  has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:22,402 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:51:22,402 INFO  L93              Difference]: Finished difference Result 7116 states and 10614 transitions.
[2025-02-05 18:51:22,402 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 18:51:22,402 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 362
[2025-02-05 18:51:22,403 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:51:22,409 INFO  L225             Difference]: With dead ends: 7116
[2025-02-05 18:51:22,409 INFO  L226             Difference]: Without dead ends: 4598
[2025-02-05 18:51:22,411 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-02-05 18:51:22,412 INFO  L435           NwaCegarLoop]: 1175 mSDtfsCounter, 1289 mSDsluCounter, 2348 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 3523 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 18:51:22,412 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 3523 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 18:51:22,414 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4598 states.
[2025-02-05 18:51:22,436 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4598 to 4590.
[2025-02-05 18:51:22,439 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4590 states, 4589 states have (on average 1.4931357594247112) internal successors, (6852), 4589 states have internal predecessors, (6852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:22,442 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4590 states to 4590 states and 6852 transitions.
[2025-02-05 18:51:22,442 INFO  L78                 Accepts]: Start accepts. Automaton has 4590 states and 6852 transitions. Word has length 362
[2025-02-05 18:51:22,443 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:51:22,443 INFO  L471      AbstractCegarLoop]: Abstraction has 4590 states and 6852 transitions.
[2025-02-05 18:51:22,443 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:22,443 INFO  L276                IsEmpty]: Start isEmpty. Operand 4590 states and 6852 transitions.
[2025-02-05 18:51:22,445 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 363
[2025-02-05 18:51:22,445 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:51:22,445 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:51:22,445 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-02-05 18:51:22,445 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:51:22,446 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:51:22,446 INFO  L85        PathProgramCache]: Analyzing trace with hash 1167778306, now seen corresponding path program 1 times
[2025-02-05 18:51:22,446 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:51:22,446 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917881408]
[2025-02-05 18:51:22,446 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:51:22,446 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:51:22,508 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes.
[2025-02-05 18:51:23,401 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements.
[2025-02-05 18:51:23,402 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:51:23,402 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:51:24,341 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:51:24,342 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:51:24,342 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917881408]
[2025-02-05 18:51:24,342 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917881408] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:51:24,342 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:51:24,342 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-02-05 18:51:24,342 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438710198]
[2025-02-05 18:51:24,342 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:51:24,342 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-02-05 18:51:24,343 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:51:24,343 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-02-05 18:51:24,343 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2025-02-05 18:51:24,343 INFO  L87              Difference]: Start difference. First operand 4590 states and 6852 transitions. Second operand  has 9 states, 9 states have (on average 40.22222222222222) internal successors, (362), 9 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:25,343 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:51:25,345 INFO  L93              Difference]: Finished difference Result 7152 states and 10666 transitions.
[2025-02-05 18:51:25,346 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-02-05 18:51:25,346 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 40.22222222222222) internal successors, (362), 9 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 362
[2025-02-05 18:51:25,346 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:51:25,354 INFO  L225             Difference]: With dead ends: 7152
[2025-02-05 18:51:25,354 INFO  L226             Difference]: Without dead ends: 4598
[2025-02-05 18:51:25,360 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182
[2025-02-05 18:51:25,361 INFO  L435           NwaCegarLoop]: 1212 mSDtfsCounter, 2698 mSDsluCounter, 6062 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2698 SdHoareTripleChecker+Valid, 7274 SdHoareTripleChecker+Invalid, 2383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-05 18:51:25,361 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2698 Valid, 7274 Invalid, 2383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2382 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-05 18:51:25,363 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4598 states.
[2025-02-05 18:51:25,401 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4598 to 4596.
[2025-02-05 18:51:25,405 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4596 states, 4595 states have (on average 1.4924918389553863) internal successors, (6858), 4595 states have internal predecessors, (6858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:25,409 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4596 states to 4596 states and 6858 transitions.
[2025-02-05 18:51:25,409 INFO  L78                 Accepts]: Start accepts. Automaton has 4596 states and 6858 transitions. Word has length 362
[2025-02-05 18:51:25,409 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:51:25,409 INFO  L471      AbstractCegarLoop]: Abstraction has 4596 states and 6858 transitions.
[2025-02-05 18:51:25,410 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 40.22222222222222) internal successors, (362), 9 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:25,410 INFO  L276                IsEmpty]: Start isEmpty. Operand 4596 states and 6858 transitions.
[2025-02-05 18:51:25,412 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 364
[2025-02-05 18:51:25,412 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:51:25,412 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:51:25,413 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-02-05 18:51:25,413 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:51:25,413 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:51:25,413 INFO  L85        PathProgramCache]: Analyzing trace with hash 1889030133, now seen corresponding path program 1 times
[2025-02-05 18:51:25,413 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:51:25,413 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922102219]
[2025-02-05 18:51:25,413 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:51:25,413 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:51:25,494 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes.
[2025-02-05 18:51:25,787 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements.
[2025-02-05 18:51:25,788 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:51:25,788 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:51:26,143 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:51:26,144 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:51:26,144 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922102219]
[2025-02-05 18:51:26,144 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922102219] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:51:26,144 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:51:26,144 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 18:51:26,144 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809052281]
[2025-02-05 18:51:26,144 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:51:26,144 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 18:51:26,144 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:51:26,145 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 18:51:26,145 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 18:51:26,145 INFO  L87              Difference]: Start difference. First operand 4596 states and 6858 transitions. Second operand  has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:26,474 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:51:26,474 INFO  L93              Difference]: Finished difference Result 7164 states and 10678 transitions.
[2025-02-05 18:51:26,474 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:51:26,475 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 363
[2025-02-05 18:51:26,475 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:51:26,478 INFO  L225             Difference]: With dead ends: 7164
[2025-02-05 18:51:26,478 INFO  L226             Difference]: Without dead ends: 4602
[2025-02-05 18:51:26,480 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 18:51:26,481 INFO  L435           NwaCegarLoop]: 1344 mSDtfsCounter, 0 mSDsluCounter, 2682 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4026 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-05 18:51:26,481 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4026 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-05 18:51:26,484 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4602 states.
[2025-02-05 18:51:26,509 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4602 to 4602.
[2025-02-05 18:51:26,553 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4602 states, 4601 states have (on average 1.4918495979134971) internal successors, (6864), 4601 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:26,558 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4602 states to 4602 states and 6864 transitions.
[2025-02-05 18:51:26,558 INFO  L78                 Accepts]: Start accepts. Automaton has 4602 states and 6864 transitions. Word has length 363
[2025-02-05 18:51:26,558 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:51:26,558 INFO  L471      AbstractCegarLoop]: Abstraction has 4602 states and 6864 transitions.
[2025-02-05 18:51:26,559 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:26,559 INFO  L276                IsEmpty]: Start isEmpty. Operand 4602 states and 6864 transitions.
[2025-02-05 18:51:26,561 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 365
[2025-02-05 18:51:26,561 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:51:26,562 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:51:26,562 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-02-05 18:51:26,562 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:51:26,563 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:51:26,563 INFO  L85        PathProgramCache]: Analyzing trace with hash 117669260, now seen corresponding path program 1 times
[2025-02-05 18:51:26,563 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:51:26,563 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379881284]
[2025-02-05 18:51:26,563 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:51:26,563 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:51:26,638 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes.
[2025-02-05 18:51:27,377 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements.
[2025-02-05 18:51:27,377 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:51:27,377 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:51:27,820 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:51:27,820 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:51:27,820 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379881284]
[2025-02-05 18:51:27,820 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379881284] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:51:27,821 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:51:27,821 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:51:27,821 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20067185]
[2025-02-05 18:51:27,821 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:51:27,821 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:51:27,821 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:51:27,821 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:51:27,822 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:51:27,822 INFO  L87              Difference]: Start difference. First operand 4602 states and 6864 transitions. Second operand  has 5 states, 5 states have (on average 72.8) internal successors, (364), 5 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:28,392 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:51:28,392 INFO  L93              Difference]: Finished difference Result 7694 states and 11446 transitions.
[2025-02-05 18:51:28,392 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 18:51:28,393 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 72.8) internal successors, (364), 5 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 364
[2025-02-05 18:51:28,393 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:51:28,400 INFO  L225             Difference]: With dead ends: 7694
[2025-02-05 18:51:28,402 INFO  L226             Difference]: Without dead ends: 4602
[2025-02-05 18:51:28,406 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-02-05 18:51:28,411 INFO  L435           NwaCegarLoop]: 1338 mSDtfsCounter, 548 mSDsluCounter, 3420 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 4758 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 18:51:28,411 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 4758 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 18:51:28,413 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4602 states.
[2025-02-05 18:51:28,439 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4602 to 4602.
[2025-02-05 18:51:28,442 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4602 states, 4601 states have (on average 1.4909802216909367) internal successors, (6860), 4601 states have internal predecessors, (6860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:28,445 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4602 states to 4602 states and 6860 transitions.
[2025-02-05 18:51:28,445 INFO  L78                 Accepts]: Start accepts. Automaton has 4602 states and 6860 transitions. Word has length 364
[2025-02-05 18:51:28,447 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:51:28,447 INFO  L471      AbstractCegarLoop]: Abstraction has 4602 states and 6860 transitions.
[2025-02-05 18:51:28,447 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 72.8) internal successors, (364), 5 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:28,447 INFO  L276                IsEmpty]: Start isEmpty. Operand 4602 states and 6860 transitions.
[2025-02-05 18:51:28,450 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 366
[2025-02-05 18:51:28,450 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:51:28,450 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:51:28,450 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-02-05 18:51:28,451 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:51:28,452 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:51:28,452 INFO  L85        PathProgramCache]: Analyzing trace with hash 1118671281, now seen corresponding path program 1 times
[2025-02-05 18:51:28,452 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:51:28,452 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625931727]
[2025-02-05 18:51:28,452 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:51:28,453 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:51:28,509 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes.
[2025-02-05 18:51:29,370 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements.
[2025-02-05 18:51:29,370 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:51:29,370 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:51:29,640 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:51:29,640 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:51:29,640 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625931727]
[2025-02-05 18:51:29,640 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625931727] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:51:29,640 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:51:29,640 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:51:29,640 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824385765]
[2025-02-05 18:51:29,640 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:51:29,641 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:51:29,641 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:51:29,641 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:51:29,641 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:51:29,641 INFO  L87              Difference]: Start difference. First operand 4602 states and 6860 transitions. Second operand  has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:30,377 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:51:30,378 INFO  L93              Difference]: Finished difference Result 7120 states and 10610 transitions.
[2025-02-05 18:51:30,378 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 18:51:30,378 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 365
[2025-02-05 18:51:30,378 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:51:30,381 INFO  L225             Difference]: With dead ends: 7120
[2025-02-05 18:51:30,381 INFO  L226             Difference]: Without dead ends: 4604
[2025-02-05 18:51:30,383 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:51:30,383 INFO  L435           NwaCegarLoop]: 1101 mSDtfsCounter, 1279 mSDsluCounter, 2197 mSDsCounter, 0 mSdLazyCounter, 1541 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1279 SdHoareTripleChecker+Valid, 3298 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 18:51:30,384 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1279 Valid, 3298 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1541 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 18:51:30,387 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4604 states.
[2025-02-05 18:51:30,406 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4604 to 4604.
[2025-02-05 18:51:30,408 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4604 states, 4603 states have (on average 1.4907668911579404) internal successors, (6862), 4603 states have internal predecessors, (6862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:30,411 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4604 states to 4604 states and 6862 transitions.
[2025-02-05 18:51:30,411 INFO  L78                 Accepts]: Start accepts. Automaton has 4604 states and 6862 transitions. Word has length 365
[2025-02-05 18:51:30,412 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:51:30,412 INFO  L471      AbstractCegarLoop]: Abstraction has 4604 states and 6862 transitions.
[2025-02-05 18:51:30,412 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:30,412 INFO  L276                IsEmpty]: Start isEmpty. Operand 4604 states and 6862 transitions.
[2025-02-05 18:51:30,414 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 366
[2025-02-05 18:51:30,414 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:51:30,414 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:51:30,414 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2025-02-05 18:51:30,415 INFO  L396      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:51:30,415 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:51:30,415 INFO  L85        PathProgramCache]: Analyzing trace with hash 1971495997, now seen corresponding path program 1 times
[2025-02-05 18:51:30,415 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:51:30,415 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55857865]
[2025-02-05 18:51:30,415 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:51:30,415 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:51:30,490 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes.
[2025-02-05 18:51:32,156 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements.
[2025-02-05 18:51:32,156 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:51:32,156 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:51:32,823 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:51:32,823 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:51:32,823 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55857865]
[2025-02-05 18:51:32,823 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55857865] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:51:32,823 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:51:32,823 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-05 18:51:32,823 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451657767]
[2025-02-05 18:51:32,823 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:51:32,824 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 18:51:32,824 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:51:32,824 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 18:51:32,824 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-02-05 18:51:32,824 INFO  L87              Difference]: Start difference. First operand 4604 states and 6862 transitions. Second operand  has 6 states, 6 states have (on average 60.833333333333336) internal successors, (365), 6 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:33,709 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:51:33,709 INFO  L93              Difference]: Finished difference Result 14118 states and 21029 transitions.
[2025-02-05 18:51:33,709 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 18:51:33,709 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 60.833333333333336) internal successors, (365), 6 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 365
[2025-02-05 18:51:33,710 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:51:33,718 INFO  L225             Difference]: With dead ends: 14118
[2025-02-05 18:51:33,718 INFO  L226             Difference]: Without dead ends: 11526
[2025-02-05 18:51:33,723 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-02-05 18:51:33,723 INFO  L435           NwaCegarLoop]: 1703 mSDtfsCounter, 1483 mSDsluCounter, 5841 mSDsCounter, 0 mSdLazyCounter, 2114 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 7544 SdHoareTripleChecker+Invalid, 2126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 18:51:33,723 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1483 Valid, 7544 Invalid, 2126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2114 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 18:51:33,730 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11526 states.
[2025-02-05 18:51:33,783 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11526 to 8252.
[2025-02-05 18:51:33,789 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8252 states, 8251 states have (on average 1.4921827657253666) internal successors, (12312), 8251 states have internal predecessors, (12312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:33,797 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8252 states to 8252 states and 12312 transitions.
[2025-02-05 18:51:33,797 INFO  L78                 Accepts]: Start accepts. Automaton has 8252 states and 12312 transitions. Word has length 365
[2025-02-05 18:51:33,797 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:51:33,797 INFO  L471      AbstractCegarLoop]: Abstraction has 8252 states and 12312 transitions.
[2025-02-05 18:51:33,797 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 60.833333333333336) internal successors, (365), 6 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:33,798 INFO  L276                IsEmpty]: Start isEmpty. Operand 8252 states and 12312 transitions.
[2025-02-05 18:51:33,802 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 367
[2025-02-05 18:51:33,802 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:51:33,802 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:51:33,802 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2025-02-05 18:51:33,802 INFO  L396      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:51:33,803 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:51:33,803 INFO  L85        PathProgramCache]: Analyzing trace with hash -506382506, now seen corresponding path program 1 times
[2025-02-05 18:51:33,803 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:51:33,803 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772362540]
[2025-02-05 18:51:33,803 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:51:33,803 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:51:33,864 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes.
[2025-02-05 18:51:35,436 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements.
[2025-02-05 18:51:35,436 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:51:35,436 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:51:35,908 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:51:35,908 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:51:35,908 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772362540]
[2025-02-05 18:51:35,908 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772362540] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:51:35,908 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:51:35,908 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-05 18:51:35,908 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149923616]
[2025-02-05 18:51:35,909 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:51:35,909 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-05 18:51:35,909 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:51:35,909 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-05 18:51:35,909 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2025-02-05 18:51:35,909 INFO  L87              Difference]: Start difference. First operand 8252 states and 12312 transitions. Second operand  has 8 states, 8 states have (on average 45.75) internal successors, (366), 8 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:37,256 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:51:37,256 INFO  L93              Difference]: Finished difference Result 12676 states and 18898 transitions.
[2025-02-05 18:51:37,256 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-05 18:51:37,257 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 45.75) internal successors, (366), 8 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 366
[2025-02-05 18:51:37,257 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:51:37,262 INFO  L225             Difference]: With dead ends: 12676
[2025-02-05 18:51:37,262 INFO  L226             Difference]: Without dead ends: 8264
[2025-02-05 18:51:37,267 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2025-02-05 18:51:37,268 INFO  L435           NwaCegarLoop]: 952 mSDtfsCounter, 2926 mSDsluCounter, 3798 mSDsCounter, 0 mSdLazyCounter, 3315 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2926 SdHoareTripleChecker+Valid, 4750 SdHoareTripleChecker+Invalid, 3318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-02-05 18:51:37,268 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2926 Valid, 4750 Invalid, 3318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3315 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-02-05 18:51:37,275 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8264 states.
[2025-02-05 18:51:37,328 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8264 to 8262.
[2025-02-05 18:51:37,333 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8262 states, 8261 states have (on average 1.4918290763830044) internal successors, (12324), 8261 states have internal predecessors, (12324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:37,340 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8262 states to 8262 states and 12324 transitions.
[2025-02-05 18:51:37,340 INFO  L78                 Accepts]: Start accepts. Automaton has 8262 states and 12324 transitions. Word has length 366
[2025-02-05 18:51:37,340 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:51:37,340 INFO  L471      AbstractCegarLoop]: Abstraction has 8262 states and 12324 transitions.
[2025-02-05 18:51:37,341 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 45.75) internal successors, (366), 8 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:37,341 INFO  L276                IsEmpty]: Start isEmpty. Operand 8262 states and 12324 transitions.
[2025-02-05 18:51:37,345 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 367
[2025-02-05 18:51:37,345 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:51:37,345 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:51:37,345 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2025-02-05 18:51:37,346 INFO  L396      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:51:37,346 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:51:37,346 INFO  L85        PathProgramCache]: Analyzing trace with hash -900745124, now seen corresponding path program 1 times
[2025-02-05 18:51:37,346 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:51:37,346 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918728965]
[2025-02-05 18:51:37,346 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:51:37,346 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:51:37,425 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes.
[2025-02-05 18:51:37,475 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements.
[2025-02-05 18:51:37,476 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:51:37,476 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:51:37,897 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:51:37,897 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:51:37,897 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918728965]
[2025-02-05 18:51:37,898 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918728965] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:51:37,898 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:51:37,898 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 18:51:37,898 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945841458]
[2025-02-05 18:51:37,898 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:51:37,898 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 18:51:37,898 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:51:37,899 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 18:51:37,899 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 18:51:37,899 INFO  L87              Difference]: Start difference. First operand 8262 states and 12324 transitions. Second operand  has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:38,291 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:51:38,291 INFO  L93              Difference]: Finished difference Result 16366 states and 24408 transitions.
[2025-02-05 18:51:38,291 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:51:38,292 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 366
[2025-02-05 18:51:38,292 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:51:38,297 INFO  L225             Difference]: With dead ends: 16366
[2025-02-05 18:51:38,297 INFO  L226             Difference]: Without dead ends: 8278
[2025-02-05 18:51:38,303 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 18:51:38,303 INFO  L435           NwaCegarLoop]: 1344 mSDtfsCounter, 0 mSDsluCounter, 2663 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4007 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 18:51:38,303 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4007 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 18:51:38,306 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8278 states.
[2025-02-05 18:51:38,342 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8278 to 8278.
[2025-02-05 18:51:38,346 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8278 states, 8277 states have (on average 1.4908783375619186) internal successors, (12340), 8277 states have internal predecessors, (12340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:38,352 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8278 states to 8278 states and 12340 transitions.
[2025-02-05 18:51:38,352 INFO  L78                 Accepts]: Start accepts. Automaton has 8278 states and 12340 transitions. Word has length 366
[2025-02-05 18:51:38,352 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:51:38,352 INFO  L471      AbstractCegarLoop]: Abstraction has 8278 states and 12340 transitions.
[2025-02-05 18:51:38,353 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:38,353 INFO  L276                IsEmpty]: Start isEmpty. Operand 8278 states and 12340 transitions.
[2025-02-05 18:51:38,357 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 368
[2025-02-05 18:51:38,357 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:51:38,357 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:51:38,357 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2025-02-05 18:51:38,357 INFO  L396      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:51:38,358 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:51:38,358 INFO  L85        PathProgramCache]: Analyzing trace with hash -1192414762, now seen corresponding path program 1 times
[2025-02-05 18:51:38,358 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:51:38,358 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664572860]
[2025-02-05 18:51:38,358 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:51:38,358 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:51:38,416 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes.
[2025-02-05 18:51:39,475 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements.
[2025-02-05 18:51:39,476 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:51:39,476 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:51:39,983 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:51:39,984 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:51:39,984 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664572860]
[2025-02-05 18:51:39,984 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664572860] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:51:39,984 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:51:39,984 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:51:39,984 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061949022]
[2025-02-05 18:51:39,984 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:51:39,984 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:51:39,984 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:51:39,985 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:51:39,985 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:51:39,985 INFO  L87              Difference]: Start difference. First operand 8278 states and 12340 transitions. Second operand  has 5 states, 5 states have (on average 73.4) internal successors, (367), 5 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:40,365 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:51:40,366 INFO  L93              Difference]: Finished difference Result 16430 states and 24492 transitions.
[2025-02-05 18:51:40,366 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 18:51:40,366 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 73.4) internal successors, (367), 5 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 367
[2025-02-05 18:51:40,366 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:51:40,371 INFO  L225             Difference]: With dead ends: 16430
[2025-02-05 18:51:40,371 INFO  L226             Difference]: Without dead ends: 8318
[2025-02-05 18:51:40,376 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:51:40,377 INFO  L435           NwaCegarLoop]: 1341 mSDtfsCounter, 4 mSDsluCounter, 2660 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4001 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 18:51:40,377 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4001 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 18:51:40,380 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8318 states.
[2025-02-05 18:51:40,414 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8318 to 8310.
[2025-02-05 18:51:40,418 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8310 states, 8309 states have (on average 1.4899506559152726) internal successors, (12380), 8309 states have internal predecessors, (12380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:40,424 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8310 states to 8310 states and 12380 transitions.
[2025-02-05 18:51:40,424 INFO  L78                 Accepts]: Start accepts. Automaton has 8310 states and 12380 transitions. Word has length 367
[2025-02-05 18:51:40,424 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:51:40,424 INFO  L471      AbstractCegarLoop]: Abstraction has 8310 states and 12380 transitions.
[2025-02-05 18:51:40,424 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 73.4) internal successors, (367), 5 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:40,425 INFO  L276                IsEmpty]: Start isEmpty. Operand 8310 states and 12380 transitions.
[2025-02-05 18:51:40,428 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 368
[2025-02-05 18:51:40,429 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:51:40,429 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:51:40,429 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2025-02-05 18:51:40,429 INFO  L396      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:51:40,429 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:51:40,429 INFO  L85        PathProgramCache]: Analyzing trace with hash 1997975207, now seen corresponding path program 1 times
[2025-02-05 18:51:40,430 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:51:40,430 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843020133]
[2025-02-05 18:51:40,430 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:51:40,430 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:51:40,487 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes.
[2025-02-05 18:51:42,299 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements.
[2025-02-05 18:51:42,299 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:51:42,299 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:51:43,598 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:51:43,598 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:51:43,598 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843020133]
[2025-02-05 18:51:43,598 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843020133] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:51:43,598 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:51:43,598 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-05 18:51:43,599 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738620724]
[2025-02-05 18:51:43,599 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:51:43,599 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-05 18:51:43,599 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:51:43,599 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-05 18:51:43,599 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-02-05 18:51:43,600 INFO  L87              Difference]: Start difference. First operand 8310 states and 12380 transitions. Second operand  has 7 states, 7 states have (on average 52.42857142857143) internal successors, (367), 7 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:44,394 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:51:44,395 INFO  L93              Difference]: Finished difference Result 19354 states and 28800 transitions.
[2025-02-05 18:51:44,395 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-05 18:51:44,395 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 52.42857142857143) internal successors, (367), 7 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 367
[2025-02-05 18:51:44,395 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:51:44,406 INFO  L225             Difference]: With dead ends: 19354
[2025-02-05 18:51:44,407 INFO  L226             Difference]: Without dead ends: 14654
[2025-02-05 18:51:44,413 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2025-02-05 18:51:44,413 INFO  L435           NwaCegarLoop]: 1719 mSDtfsCounter, 819 mSDsluCounter, 8202 mSDsCounter, 0 mSdLazyCounter, 2068 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 9921 SdHoareTripleChecker+Invalid, 2069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 18:51:44,413 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 9921 Invalid, 2069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2068 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 18:51:44,419 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14654 states.
[2025-02-05 18:51:44,491 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14654 to 13758.
[2025-02-05 18:51:44,500 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13758 states, 13757 states have (on average 1.4918950352547793) internal successors, (20524), 13757 states have internal predecessors, (20524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:44,512 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13758 states to 13758 states and 20524 transitions.
[2025-02-05 18:51:44,512 INFO  L78                 Accepts]: Start accepts. Automaton has 13758 states and 20524 transitions. Word has length 367
[2025-02-05 18:51:44,513 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:51:44,513 INFO  L471      AbstractCegarLoop]: Abstraction has 13758 states and 20524 transitions.
[2025-02-05 18:51:44,513 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 52.42857142857143) internal successors, (367), 7 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:44,513 INFO  L276                IsEmpty]: Start isEmpty. Operand 13758 states and 20524 transitions.
[2025-02-05 18:51:44,520 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 369
[2025-02-05 18:51:44,520 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:51:44,521 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:51:44,521 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2025-02-05 18:51:44,521 INFO  L396      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:51:44,521 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:51:44,521 INFO  L85        PathProgramCache]: Analyzing trace with hash -1886646149, now seen corresponding path program 1 times
[2025-02-05 18:51:44,521 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:51:44,521 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013945471]
[2025-02-05 18:51:44,521 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:51:44,521 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:51:44,585 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes.
[2025-02-05 18:51:45,636 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements.
[2025-02-05 18:51:45,636 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:51:45,637 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:51:46,600 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 18:51:46,600 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:51:46,600 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013945471]
[2025-02-05 18:51:46,600 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013945471] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:51:46,600 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:51:46,600 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-02-05 18:51:46,601 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258664238]
[2025-02-05 18:51:46,601 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:51:46,601 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-05 18:51:46,601 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:51:46,601 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-05 18:51:46,601 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-02-05 18:51:46,602 INFO  L87              Difference]: Start difference. First operand 13758 states and 20524 transitions. Second operand  has 8 states, 8 states have (on average 46.0) internal successors, (368), 8 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:48,079 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:51:48,079 INFO  L93              Difference]: Finished difference Result 30829 states and 45957 transitions.
[2025-02-05 18:51:48,079 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-02-05 18:51:48,080 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 46.0) internal successors, (368), 8 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 368
[2025-02-05 18:51:48,080 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:51:48,094 INFO  L225             Difference]: With dead ends: 30829
[2025-02-05 18:51:48,094 INFO  L226             Difference]: Without dead ends: 16759
[2025-02-05 18:51:48,105 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156
[2025-02-05 18:51:48,106 INFO  L435           NwaCegarLoop]: 2349 mSDtfsCounter, 1140 mSDsluCounter, 12803 mSDsCounter, 0 mSdLazyCounter, 3868 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 15152 SdHoareTripleChecker+Invalid, 3924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 3868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-02-05 18:51:48,107 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 15152 Invalid, 3924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 3868 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-02-05 18:51:48,113 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16759 states.
[2025-02-05 18:51:48,193 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16759 to 16735.
[2025-02-05 18:51:48,203 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 16735 states, 16734 states have (on average 1.4824309788454644) internal successors, (24807), 16734 states have internal predecessors, (24807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:48,217 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16735 states to 16735 states and 24807 transitions.
[2025-02-05 18:51:48,217 INFO  L78                 Accepts]: Start accepts. Automaton has 16735 states and 24807 transitions. Word has length 368
[2025-02-05 18:51:48,217 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:51:48,218 INFO  L471      AbstractCegarLoop]: Abstraction has 16735 states and 24807 transitions.
[2025-02-05 18:51:48,218 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 46.0) internal successors, (368), 8 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 18:51:48,218 INFO  L276                IsEmpty]: Start isEmpty. Operand 16735 states and 24807 transitions.
[2025-02-05 18:51:48,227 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 369
[2025-02-05 18:51:48,227 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:51:48,227 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:51:48,227 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2025-02-05 18:51:48,227 INFO  L396      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:51:48,227 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:51:48,228 INFO  L85        PathProgramCache]: Analyzing trace with hash -1677322193, now seen corresponding path program 1 times
[2025-02-05 18:51:48,228 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:51:48,228 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463464789]
[2025-02-05 18:51:48,228 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:51:48,228 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:51:48,285 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes.