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


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


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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c1dfcbee3b3c08868a7bc65611f640bbe908ac332f2cba22ac0e18c87a2548d6
[2025-03-03 16:39:15,387 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 16:39:15,393 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 16:39:15,396 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 16:39:15,397 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 16:39:15,397 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 16:39:15,399 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n4_w8_d8_e0.c
[2025-03-03 16:39:16,480 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b14d6a2c3/1e853a387dc6495fac4bf3494dc495bc/FLAGb6121b4c8
[2025-03-03 16:39:16,780 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 16:39:16,781 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n4_w8_d8_e0.c
[2025-03-03 16:39:16,797 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b14d6a2c3/1e853a387dc6495fac4bf3494dc495bc/FLAGb6121b4c8
[2025-03-03 16:39:17,043 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b14d6a2c3/1e853a387dc6495fac4bf3494dc495bc
[2025-03-03 16:39:17,045 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 16:39:17,046 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 16:39:17,047 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 16:39:17,047 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 16:39:17,051 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 16:39:17,051 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:39:17" (1/1) ...
[2025-03-03 16:39:17,052 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d7492e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:39:17, skipping insertion in model container
[2025-03-03 16:39:17,052 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:39:17" (1/1) ...
[2025-03-03 16:39:17,095 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 16:39:17,221 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n4_w8_d8_e0.c[1269,1282]
[2025-03-03 16:39:17,520 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 16:39:17,527 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 16:39:17,534 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n4_w8_d8_e0.c[1269,1282]
[2025-03-03 16:39:17,692 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 16:39:17,702 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 16:39:17,703 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:39:17 WrapperNode
[2025-03-03 16:39:17,703 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 16:39:17,704 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 16:39:17,704 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 16:39:17,704 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 16:39:17,708 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:39:17" (1/1) ...
[2025-03-03 16:39:17,753 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:39:17" (1/1) ...
[2025-03-03 16:39:18,065 INFO  L138                Inliner]: procedures = 17, calls = 21, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4763
[2025-03-03 16:39:18,066 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 16:39:18,066 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 16:39:18,066 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 16:39:18,066 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 16:39:18,072 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:39:17" (1/1) ...
[2025-03-03 16:39:18,073 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:39:17" (1/1) ...
[2025-03-03 16:39:18,176 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:39:17" (1/1) ...
[2025-03-03 16:39:18,324 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-03 16:39:18,328 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:39:17" (1/1) ...
[2025-03-03 16:39:18,329 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:39:17" (1/1) ...
[2025-03-03 16:39:18,472 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:39:17" (1/1) ...
[2025-03-03 16:39:18,499 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:39:17" (1/1) ...
[2025-03-03 16:39:18,519 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:39:17" (1/1) ...
[2025-03-03 16:39:18,542 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:39:17" (1/1) ...
[2025-03-03 16:39:18,633 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 16:39:18,634 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 16:39:18,635 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 16:39:18,635 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 16:39:18,636 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:39:17" (1/1) ...
[2025-03-03 16:39:18,640 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 16:39:18,649 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 16:39:18,661 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-03 16:39:18,662 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-03 16:39:18,677 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 16:39:18,677 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-03 16:39:18,677 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-03 16:39:18,677 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 16:39:18,677 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 16:39:18,677 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 16:39:18,975 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 16:39:18,976 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 16:39:22,433 INFO  L?                        ?]: Removed 2675 outVars from TransFormulas that were not future-live.
[2025-03-03 16:39:22,433 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 16:39:22,582 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 16:39:22,583 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 16:39:22,583 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:39:22 BoogieIcfgContainer
[2025-03-03 16:39:22,583 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 16:39:22,585 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 16:39:22,585 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 16:39:22,588 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 16:39:22,589 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:39:17" (1/3) ...
[2025-03-03 16:39:22,589 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8017b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:39:22, skipping insertion in model container
[2025-03-03 16:39:22,589 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:39:17" (2/3) ...
[2025-03-03 16:39:22,590 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8017b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:39:22, skipping insertion in model container
[2025-03-03 16:39:22,590 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:39:22" (3/3) ...
[2025-03-03 16:39:22,591 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.arbitrated_top_n4_w8_d8_e0.c
[2025-03-03 16:39:22,605 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 16:39:22,606 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.arbitrated_top_n4_w8_d8_e0.c that has 2 procedures, 1412 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 16:39:22,690 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 16:39:22,700 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;@68ec5dcc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 16:39:22,700 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 16:39:22,709 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 1412 states, 1396 states have (on average 1.494269340974212) internal successors, (2086), 1397 states have internal predecessors, (2086), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2025-03-03 16:39:22,740 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 480
[2025-03-03 16:39:22,742 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:39:22,743 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:39:22,743 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:39:22,747 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:39:22,749 INFO  L85        PathProgramCache]: Analyzing trace with hash -1898266689, now seen corresponding path program 1 times
[2025-03-03 16:39:22,754 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:39:22,755 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567289277]
[2025-03-03 16:39:22,756 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:39:22,756 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:39:22,925 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes.
[2025-03-03 16:39:23,025 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements.
[2025-03-03 16:39:23,028 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:39:23,028 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:39:23,425 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked.
[2025-03-03 16:39:23,425 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:39:23,426 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567289277]
[2025-03-03 16:39:23,427 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567289277] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 16:39:23,427 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85030371]
[2025-03-03 16:39:23,427 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:39:23,428 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 16:39:23,428 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 16:39:23,430 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 16:39:23,431 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-03 16:39:24,086 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes.
[2025-03-03 16:39:24,348 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements.
[2025-03-03 16:39:24,348 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:39:24,348 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:39:24,360 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2380 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-03 16:39:24,378 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 16:39:24,422 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked.
[2025-03-03 16:39:24,424 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 16:39:24,424 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [85030371] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:39:24,424 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 16:39:24,424 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-03 16:39:24,426 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626272545]
[2025-03-03 16:39:24,426 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:39:24,431 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-03 16:39:24,431 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:39:24,448 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-03 16:39:24,448 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-03 16:39:24,453 INFO  L87              Difference]: Start difference. First operand  has 1412 states, 1396 states have (on average 1.494269340974212) internal successors, (2086), 1397 states have internal predecessors, (2086), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand  has 2 states, 2 states have (on average 209.5) internal successors, (419), 2 states have internal predecessors, (419), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13)
[2025-03-03 16:39:24,837 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:39:24,838 INFO  L93              Difference]: Finished difference Result 2607 states and 3915 transitions.
[2025-03-03 16:39:24,839 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-03 16:39:24,840 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 209.5) internal successors, (419), 2 states have internal predecessors, (419), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 479
[2025-03-03 16:39:24,840 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:39:24,850 INFO  L225             Difference]: With dead ends: 2607
[2025-03-03 16:39:24,850 INFO  L226             Difference]: Without dead ends: 1409
[2025-03-03 16:39:24,861 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-03 16:39:24,864 INFO  L435           NwaCegarLoop]: 1764 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1764 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 16:39:24,864 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1764 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 16:39:24,878 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1409 states.
[2025-03-03 16:39:24,933 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1409.
[2025-03-03 16:39:24,936 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1409 states, 1394 states have (on average 1.492826398852224) internal successors, (2081), 1394 states have internal predecessors, (2081), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2025-03-03 16:39:24,944 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 2107 transitions.
[2025-03-03 16:39:24,946 INFO  L78                 Accepts]: Start accepts. Automaton has 1409 states and 2107 transitions. Word has length 479
[2025-03-03 16:39:24,946 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:39:24,948 INFO  L471      AbstractCegarLoop]: Abstraction has 1409 states and 2107 transitions.
[2025-03-03 16:39:24,948 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 209.5) internal successors, (419), 2 states have internal predecessors, (419), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13)
[2025-03-03 16:39:24,948 INFO  L276                IsEmpty]: Start isEmpty. Operand 1409 states and 2107 transitions.
[2025-03-03 16:39:24,953 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 480
[2025-03-03 16:39:24,953 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:39:24,954 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:39:24,964 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-03-03 16:39:25,154 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-03-03 16:39:25,155 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:39:25,155 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:39:25,156 INFO  L85        PathProgramCache]: Analyzing trace with hash -541396654, now seen corresponding path program 1 times
[2025-03-03 16:39:25,156 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:39:25,156 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940670901]
[2025-03-03 16:39:25,156 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:39:25,156 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:39:25,230 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes.
[2025-03-03 16:39:25,499 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements.
[2025-03-03 16:39:25,500 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:39:25,500 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:39:27,133 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2025-03-03 16:39:27,134 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:39:27,134 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940670901]
[2025-03-03 16:39:27,134 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940670901] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:39:27,134 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:39:27,134 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 16:39:27,134 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43942278]
[2025-03-03 16:39:27,134 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:39:27,135 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 16:39:27,136 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:39:27,137 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 16:39:27,137 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 16:39:27,138 INFO  L87              Difference]: Start difference. First operand 1409 states and 2107 transitions. Second operand  has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2025-03-03 16:39:27,865 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:39:27,865 INFO  L93              Difference]: Finished difference Result 1413 states and 2111 transitions.
[2025-03-03 16:39:27,865 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 16:39:27,866 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 479
[2025-03-03 16:39:27,871 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:39:27,885 INFO  L225             Difference]: With dead ends: 1413
[2025-03-03 16:39:27,885 INFO  L226             Difference]: Without dead ends: 1411
[2025-03-03 16:39:27,886 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 16:39:27,886 INFO  L435           NwaCegarLoop]: 1762 mSDtfsCounter, 0 mSDsluCounter, 3519 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5281 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 16:39:27,886 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5281 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 16:39:27,894 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1411 states.
[2025-03-03 16:39:27,915 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1411.
[2025-03-03 16:39:27,917 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1411 states, 1396 states have (on average 1.4921203438395416) internal successors, (2083), 1396 states have internal predecessors, (2083), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2025-03-03 16:39:27,925 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2109 transitions.
[2025-03-03 16:39:27,926 INFO  L78                 Accepts]: Start accepts. Automaton has 1411 states and 2109 transitions. Word has length 479
[2025-03-03 16:39:27,927 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:39:27,927 INFO  L471      AbstractCegarLoop]: Abstraction has 1411 states and 2109 transitions.
[2025-03-03 16:39:27,928 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2025-03-03 16:39:27,928 INFO  L276                IsEmpty]: Start isEmpty. Operand 1411 states and 2109 transitions.
[2025-03-03 16:39:27,935 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 481
[2025-03-03 16:39:27,935 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:39:27,935 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:39:27,935 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 16:39:27,935 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:39:27,936 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:39:27,936 INFO  L85        PathProgramCache]: Analyzing trace with hash 401253070, now seen corresponding path program 1 times
[2025-03-03 16:39:27,936 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:39:27,936 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438006691]
[2025-03-03 16:39:27,936 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:39:27,936 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:39:28,002 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes.
[2025-03-03 16:39:28,153 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements.
[2025-03-03 16:39:28,156 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:39:28,156 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:39:28,939 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2025-03-03 16:39:28,941 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:39:28,941 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438006691]
[2025-03-03 16:39:28,941 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438006691] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:39:28,941 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:39:28,942 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 16:39:28,942 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206781982]
[2025-03-03 16:39:28,942 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:39:28,942 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 16:39:28,943 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:39:28,944 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 16:39:28,944 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 16:39:28,944 INFO  L87              Difference]: Start difference. First operand 1411 states and 2109 transitions. Second operand  has 5 states, 5 states have (on average 83.6) internal successors, (418), 5 states have internal predecessors, (418), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13)
[2025-03-03 16:39:30,461 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:39:30,462 INFO  L93              Difference]: Finished difference Result 3585 states and 5362 transitions.
[2025-03-03 16:39:30,462 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 16:39:30,462 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 83.6) internal successors, (418), 5 states have internal predecessors, (418), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 480
[2025-03-03 16:39:30,463 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:39:30,467 INFO  L225             Difference]: With dead ends: 3585
[2025-03-03 16:39:30,468 INFO  L226             Difference]: Without dead ends: 1411
[2025-03-03 16:39:30,470 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2025-03-03 16:39:30,472 INFO  L435           NwaCegarLoop]: 2701 mSDtfsCounter, 3088 mSDsluCounter, 4033 mSDsCounter, 0 mSdLazyCounter, 2143 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3096 SdHoareTripleChecker+Valid, 6734 SdHoareTripleChecker+Invalid, 2257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 2143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-03 16:39:30,472 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3096 Valid, 6734 Invalid, 2257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 2143 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-03 16:39:30,474 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1411 states.
[2025-03-03 16:39:30,499 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1411.
[2025-03-03 16:39:30,501 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1411 states, 1396 states have (on average 1.491404011461318) internal successors, (2082), 1396 states have internal predecessors, (2082), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2025-03-03 16:39:30,506 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2108 transitions.
[2025-03-03 16:39:30,506 INFO  L78                 Accepts]: Start accepts. Automaton has 1411 states and 2108 transitions. Word has length 480
[2025-03-03 16:39:30,508 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:39:30,508 INFO  L471      AbstractCegarLoop]: Abstraction has 1411 states and 2108 transitions.
[2025-03-03 16:39:30,508 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 83.6) internal successors, (418), 5 states have internal predecessors, (418), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13)
[2025-03-03 16:39:30,508 INFO  L276                IsEmpty]: Start isEmpty. Operand 1411 states and 2108 transitions.
[2025-03-03 16:39:30,514 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 482
[2025-03-03 16:39:30,514 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:39:30,515 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:39:30,515 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 16:39:30,515 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:39:30,516 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:39:30,516 INFO  L85        PathProgramCache]: Analyzing trace with hash 2074437880, now seen corresponding path program 1 times
[2025-03-03 16:39:30,516 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:39:30,517 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072390302]
[2025-03-03 16:39:30,517 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:39:30,517 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:39:30,596 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes.
[2025-03-03 16:39:30,720 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements.
[2025-03-03 16:39:30,721 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:39:30,721 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:39:31,378 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2025-03-03 16:39:31,378 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:39:31,378 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072390302]
[2025-03-03 16:39:31,378 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072390302] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:39:31,378 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:39:31,379 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 16:39:31,379 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510237857]
[2025-03-03 16:39:31,379 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:39:31,379 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 16:39:31,379 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:39:31,380 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 16:39:31,380 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 16:39:31,380 INFO  L87              Difference]: Start difference. First operand 1411 states and 2108 transitions. Second operand  has 5 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13)
[2025-03-03 16:39:32,410 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:39:32,411 INFO  L93              Difference]: Finished difference Result 2608 states and 3896 transitions.
[2025-03-03 16:39:32,411 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 16:39:32,411 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 481
[2025-03-03 16:39:32,412 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:39:32,416 INFO  L225             Difference]: With dead ends: 2608
[2025-03-03 16:39:32,417 INFO  L226             Difference]: Without dead ends: 1411
[2025-03-03 16:39:32,418 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 16:39:32,419 INFO  L435           NwaCegarLoop]: 1303 mSDtfsCounter, 3818 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 1616 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3823 SdHoareTripleChecker+Valid, 2608 SdHoareTripleChecker+Invalid, 1617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-03 16:39:32,419 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3823 Valid, 2608 Invalid, 1617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1616 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-03 16:39:32,421 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1411 states.
[2025-03-03 16:39:32,436 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1411.
[2025-03-03 16:39:32,438 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1411 states, 1396 states have (on average 1.4906876790830945) internal successors, (2081), 1396 states have internal predecessors, (2081), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2025-03-03 16:39:32,443 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2107 transitions.
[2025-03-03 16:39:32,443 INFO  L78                 Accepts]: Start accepts. Automaton has 1411 states and 2107 transitions. Word has length 481
[2025-03-03 16:39:32,443 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:39:32,443 INFO  L471      AbstractCegarLoop]: Abstraction has 1411 states and 2107 transitions.
[2025-03-03 16:39:32,444 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13)
[2025-03-03 16:39:32,444 INFO  L276                IsEmpty]: Start isEmpty. Operand 1411 states and 2107 transitions.
[2025-03-03 16:39:32,446 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 483
[2025-03-03 16:39:32,447 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:39:32,447 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:39:32,447 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 16:39:32,447 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:39:32,448 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:39:32,448 INFO  L85        PathProgramCache]: Analyzing trace with hash 2029774931, now seen corresponding path program 1 times
[2025-03-03 16:39:32,448 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:39:32,448 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206878228]
[2025-03-03 16:39:32,448 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:39:32,448 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:39:32,527 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes.
[2025-03-03 16:39:32,627 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements.
[2025-03-03 16:39:32,627 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:39:32,627 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:39:33,126 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2025-03-03 16:39:33,127 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:39:33,127 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206878228]
[2025-03-03 16:39:33,127 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206878228] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:39:33,127 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:39:33,127 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 16:39:33,127 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650561497]
[2025-03-03 16:39:33,127 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:39:33,127 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 16:39:33,127 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:39:33,128 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 16:39:33,128 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 16:39:33,128 INFO  L87              Difference]: Start difference. First operand 1411 states and 2107 transitions. Second operand  has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13)
[2025-03-03 16:39:34,179 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:39:34,180 INFO  L93              Difference]: Finished difference Result 2608 states and 3894 transitions.
[2025-03-03 16:39:34,181 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 16:39:34,181 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 482
[2025-03-03 16:39:34,181 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:39:34,186 INFO  L225             Difference]: With dead ends: 2608
[2025-03-03 16:39:34,187 INFO  L226             Difference]: Without dead ends: 1411
[2025-03-03 16:39:34,189 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 16:39:34,190 INFO  L435           NwaCegarLoop]: 1303 mSDtfsCounter, 1950 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1955 SdHoareTripleChecker+Valid, 2625 SdHoareTripleChecker+Invalid, 1615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-03 16:39:34,191 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1955 Valid, 2625 Invalid, 1615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-03 16:39:34,193 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1411 states.
[2025-03-03 16:39:34,208 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1411.
[2025-03-03 16:39:34,210 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1411 states, 1396 states have (on average 1.489971346704871) internal successors, (2080), 1396 states have internal predecessors, (2080), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2025-03-03 16:39:34,213 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2106 transitions.
[2025-03-03 16:39:34,213 INFO  L78                 Accepts]: Start accepts. Automaton has 1411 states and 2106 transitions. Word has length 482
[2025-03-03 16:39:34,214 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:39:34,214 INFO  L471      AbstractCegarLoop]: Abstraction has 1411 states and 2106 transitions.
[2025-03-03 16:39:34,216 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13)
[2025-03-03 16:39:34,216 INFO  L276                IsEmpty]: Start isEmpty. Operand 1411 states and 2106 transitions.
[2025-03-03 16:39:34,218 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 484
[2025-03-03 16:39:34,218 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:39:34,219 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:39:34,219 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 16:39:34,219 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:39:34,220 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:39:34,220 INFO  L85        PathProgramCache]: Analyzing trace with hash 3218039, now seen corresponding path program 1 times
[2025-03-03 16:39:34,220 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:39:34,221 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498101891]
[2025-03-03 16:39:34,223 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:39:34,223 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:39:34,294 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes.
[2025-03-03 16:39:34,431 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements.
[2025-03-03 16:39:34,431 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:39:34,431 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:39:35,026 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2025-03-03 16:39:35,027 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:39:35,027 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498101891]
[2025-03-03 16:39:35,027 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498101891] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:39:35,027 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:39:35,027 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 16:39:35,027 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602056745]
[2025-03-03 16:39:35,027 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:39:35,029 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 16:39:35,029 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:39:35,030 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 16:39:35,030 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 16:39:35,030 INFO  L87              Difference]: Start difference. First operand 1411 states and 2106 transitions. Second operand  has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13)
[2025-03-03 16:39:35,996 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:39:35,997 INFO  L93              Difference]: Finished difference Result 2608 states and 3892 transitions.
[2025-03-03 16:39:35,997 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 16:39:35,998 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 483
[2025-03-03 16:39:35,998 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:39:36,002 INFO  L225             Difference]: With dead ends: 2608
[2025-03-03 16:39:36,002 INFO  L226             Difference]: Without dead ends: 1411
[2025-03-03 16:39:36,004 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 16:39:36,004 INFO  L435           NwaCegarLoop]: 1303 mSDtfsCounter, 1910 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 1612 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1915 SdHoareTripleChecker+Valid, 2625 SdHoareTripleChecker+Invalid, 1613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-03 16:39:36,004 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1915 Valid, 2625 Invalid, 1613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1612 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-03 16:39:36,006 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1411 states.
[2025-03-03 16:39:36,019 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1411.
[2025-03-03 16:39:36,021 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1411 states, 1396 states have (on average 1.4892550143266476) internal successors, (2079), 1396 states have internal predecessors, (2079), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2025-03-03 16:39:36,024 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2105 transitions.
[2025-03-03 16:39:36,024 INFO  L78                 Accepts]: Start accepts. Automaton has 1411 states and 2105 transitions. Word has length 483
[2025-03-03 16:39:36,024 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:39:36,025 INFO  L471      AbstractCegarLoop]: Abstraction has 1411 states and 2105 transitions.
[2025-03-03 16:39:36,025 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13)
[2025-03-03 16:39:36,025 INFO  L276                IsEmpty]: Start isEmpty. Operand 1411 states and 2105 transitions.
[2025-03-03 16:39:36,027 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 485
[2025-03-03 16:39:36,027 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:39:36,028 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:39:36,028 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 16:39:36,028 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:39:36,028 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:39:36,029 INFO  L85        PathProgramCache]: Analyzing trace with hash -134606, now seen corresponding path program 1 times
[2025-03-03 16:39:36,029 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:39:36,029 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494383616]
[2025-03-03 16:39:36,029 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:39:36,029 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:39:36,094 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes.
[2025-03-03 16:39:36,246 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements.
[2025-03-03 16:39:36,246 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:39:36,247 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:39:36,856 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2025-03-03 16:39:36,856 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:39:36,856 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494383616]
[2025-03-03 16:39:36,856 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494383616] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:39:36,856 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:39:36,856 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 16:39:36,857 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070471685]
[2025-03-03 16:39:36,857 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:39:36,857 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 16:39:36,857 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:39:36,858 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 16:39:36,859 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 16:39:36,859 INFO  L87              Difference]: Start difference. First operand 1411 states and 2105 transitions. Second operand  has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13)
[2025-03-03 16:39:37,792 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:39:37,792 INFO  L93              Difference]: Finished difference Result 2608 states and 3890 transitions.
[2025-03-03 16:39:37,793 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 16:39:37,793 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 484
[2025-03-03 16:39:37,794 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:39:37,797 INFO  L225             Difference]: With dead ends: 2608
[2025-03-03 16:39:37,797 INFO  L226             Difference]: Without dead ends: 1411
[2025-03-03 16:39:37,798 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 16:39:37,799 INFO  L435           NwaCegarLoop]: 1303 mSDtfsCounter, 1870 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 1610 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1875 SdHoareTripleChecker+Valid, 2625 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-03 16:39:37,799 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1875 Valid, 2625 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1610 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-03 16:39:37,801 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1411 states.
[2025-03-03 16:39:37,815 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1411.
[2025-03-03 16:39:37,817 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1411 states, 1396 states have (on average 1.488538681948424) internal successors, (2078), 1396 states have internal predecessors, (2078), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2025-03-03 16:39:37,819 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2104 transitions.
[2025-03-03 16:39:37,819 INFO  L78                 Accepts]: Start accepts. Automaton has 1411 states and 2104 transitions. Word has length 484
[2025-03-03 16:39:37,820 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:39:37,820 INFO  L471      AbstractCegarLoop]: Abstraction has 1411 states and 2104 transitions.
[2025-03-03 16:39:37,820 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13)
[2025-03-03 16:39:37,820 INFO  L276                IsEmpty]: Start isEmpty. Operand 1411 states and 2104 transitions.
[2025-03-03 16:39:37,823 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 486
[2025-03-03 16:39:37,823 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:39:37,823 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:39:37,823 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 16:39:37,823 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:39:37,824 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:39:37,824 INFO  L85        PathProgramCache]: Analyzing trace with hash -820689290, now seen corresponding path program 1 times
[2025-03-03 16:39:37,824 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:39:37,824 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121990081]
[2025-03-03 16:39:37,824 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:39:37,824 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:39:37,888 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes.
[2025-03-03 16:39:38,010 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements.
[2025-03-03 16:39:38,011 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:39:38,011 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:39:38,400 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2025-03-03 16:39:38,400 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:39:38,400 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121990081]
[2025-03-03 16:39:38,400 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121990081] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:39:38,401 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:39:38,401 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 16:39:38,401 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932273902]
[2025-03-03 16:39:38,401 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:39:38,401 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 16:39:38,401 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:39:38,402 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 16:39:38,403 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 16:39:38,403 INFO  L87              Difference]: Start difference. First operand 1411 states and 2104 transitions. Second operand  has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2025-03-03 16:39:38,873 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:39:38,873 INFO  L93              Difference]: Finished difference Result 2610 states and 3891 transitions.
[2025-03-03 16:39:38,874 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 16:39:38,874 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 485
[2025-03-03 16:39:38,875 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:39:38,878 INFO  L225             Difference]: With dead ends: 2610
[2025-03-03 16:39:38,878 INFO  L226             Difference]: Without dead ends: 1413
[2025-03-03 16:39:38,879 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 16:39:38,880 INFO  L435           NwaCegarLoop]: 1757 mSDtfsCounter, 0 mSDsluCounter, 3506 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5263 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 16:39:38,880 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5263 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 16:39:38,881 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1413 states.
[2025-03-03 16:39:38,893 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1413.
[2025-03-03 16:39:38,895 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1413 states, 1398 states have (on average 1.4878397711015736) internal successors, (2080), 1398 states have internal predecessors, (2080), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2025-03-03 16:39:38,896 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2106 transitions.
[2025-03-03 16:39:38,897 INFO  L78                 Accepts]: Start accepts. Automaton has 1413 states and 2106 transitions. Word has length 485
[2025-03-03 16:39:38,897 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:39:38,898 INFO  L471      AbstractCegarLoop]: Abstraction has 1413 states and 2106 transitions.
[2025-03-03 16:39:38,898 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2025-03-03 16:39:38,898 INFO  L276                IsEmpty]: Start isEmpty. Operand 1413 states and 2106 transitions.
[2025-03-03 16:39:38,900 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 487
[2025-03-03 16:39:38,900 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:39:38,900 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:39:38,900 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 16:39:38,901 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:39:38,901 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:39:38,901 INFO  L85        PathProgramCache]: Analyzing trace with hash -2035021275, now seen corresponding path program 1 times
[2025-03-03 16:39:38,901 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:39:38,901 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192227216]
[2025-03-03 16:39:38,901 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:39:38,901 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:39:38,962 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes.
[2025-03-03 16:39:39,099 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements.
[2025-03-03 16:39:39,100 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:39:39,100 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:39:39,680 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2025-03-03 16:39:39,681 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:39:39,681 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192227216]
[2025-03-03 16:39:39,682 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192227216] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:39:39,682 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:39:39,682 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 16:39:39,682 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286678263]
[2025-03-03 16:39:39,682 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:39:39,683 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 16:39:39,683 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:39:39,684 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 16:39:39,684 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 16:39:39,684 INFO  L87              Difference]: Start difference. First operand 1413 states and 2106 transitions. Second operand  has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2025-03-03 16:39:40,218 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:39:40,218 INFO  L93              Difference]: Finished difference Result 2612 states and 3892 transitions.
[2025-03-03 16:39:40,218 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 16:39:40,218 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 486
[2025-03-03 16:39:40,219 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:39:40,222 INFO  L225             Difference]: With dead ends: 2612
[2025-03-03 16:39:40,222 INFO  L226             Difference]: Without dead ends: 1413
[2025-03-03 16:39:40,224 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 16:39:40,225 INFO  L435           NwaCegarLoop]: 1666 mSDtfsCounter, 1744 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1744 SdHoareTripleChecker+Valid, 3334 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 16:39:40,225 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1744 Valid, 3334 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 16:39:40,243 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1413 states.
[2025-03-03 16:39:40,256 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1413.
[2025-03-03 16:39:40,258 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1413 states, 1398 states have (on average 1.486409155937053) internal successors, (2078), 1398 states have internal predecessors, (2078), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2025-03-03 16:39:40,260 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2104 transitions.
[2025-03-03 16:39:40,260 INFO  L78                 Accepts]: Start accepts. Automaton has 1413 states and 2104 transitions. Word has length 486
[2025-03-03 16:39:40,261 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:39:40,261 INFO  L471      AbstractCegarLoop]: Abstraction has 1413 states and 2104 transitions.
[2025-03-03 16:39:40,261 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2025-03-03 16:39:40,262 INFO  L276                IsEmpty]: Start isEmpty. Operand 1413 states and 2104 transitions.
[2025-03-03 16:39:40,264 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 489
[2025-03-03 16:39:40,264 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:39:40,264 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:39:40,265 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-03 16:39:40,265 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:39:40,265 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:39:40,265 INFO  L85        PathProgramCache]: Analyzing trace with hash 2002356620, now seen corresponding path program 1 times
[2025-03-03 16:39:40,265 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:39:40,266 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208482696]
[2025-03-03 16:39:40,266 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:39:40,266 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:39:40,341 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes.
[2025-03-03 16:39:40,441 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements.
[2025-03-03 16:39:40,441 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:39:40,441 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:39:40,946 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2025-03-03 16:39:40,947 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:39:40,947 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208482696]
[2025-03-03 16:39:40,947 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208482696] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:39:40,947 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:39:40,947 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 16:39:40,947 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811725304]
[2025-03-03 16:39:40,947 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:39:40,948 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 16:39:40,948 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:39:40,948 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 16:39:40,948 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 16:39:40,948 INFO  L87              Difference]: Start difference. First operand 1413 states and 2104 transitions. Second operand  has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2025-03-03 16:39:41,480 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:39:41,480 INFO  L93              Difference]: Finished difference Result 2752 states and 4095 transitions.
[2025-03-03 16:39:41,481 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 16:39:41,482 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 488
[2025-03-03 16:39:41,482 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:39:41,485 INFO  L225             Difference]: With dead ends: 2752
[2025-03-03 16:39:41,485 INFO  L226             Difference]: Without dead ends: 1413
[2025-03-03 16:39:41,486 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-03 16:39:41,487 INFO  L435           NwaCegarLoop]: 1739 mSDtfsCounter, 2147 mSDsluCounter, 3419 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2147 SdHoareTripleChecker+Valid, 5158 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 16:39:41,487 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2147 Valid, 5158 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 16:39:41,488 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1413 states.
[2025-03-03 16:39:41,499 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1413.
[2025-03-03 16:39:41,501 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1413 states, 1398 states have (on average 1.4856938483547926) internal successors, (2077), 1398 states have internal predecessors, (2077), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2025-03-03 16:39:41,502 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2103 transitions.
[2025-03-03 16:39:41,502 INFO  L78                 Accepts]: Start accepts. Automaton has 1413 states and 2103 transitions. Word has length 488
[2025-03-03 16:39:41,503 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:39:41,503 INFO  L471      AbstractCegarLoop]: Abstraction has 1413 states and 2103 transitions.
[2025-03-03 16:39:41,503 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2025-03-03 16:39:41,503 INFO  L276                IsEmpty]: Start isEmpty. Operand 1413 states and 2103 transitions.
[2025-03-03 16:39:41,505 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 490
[2025-03-03 16:39:41,505 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:39:41,505 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:39:41,505 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 16:39:41,506 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:39:41,506 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:39:41,506 INFO  L85        PathProgramCache]: Analyzing trace with hash -1476031978, now seen corresponding path program 1 times
[2025-03-03 16:39:41,506 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:39:41,506 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936674886]
[2025-03-03 16:39:41,506 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:39:41,506 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:39:41,569 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes.
[2025-03-03 16:39:41,716 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements.
[2025-03-03 16:39:41,716 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:39:41,717 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:39:42,156 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2025-03-03 16:39:42,156 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:39:42,156 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936674886]
[2025-03-03 16:39:42,156 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936674886] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:39:42,157 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:39:42,157 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 16:39:42,157 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914250676]
[2025-03-03 16:39:42,157 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:39:42,158 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 16:39:42,158 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:39:42,159 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 16:39:42,159 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 16:39:42,159 INFO  L87              Difference]: Start difference. First operand 1413 states and 2103 transitions. Second operand  has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2025-03-03 16:39:42,636 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:39:42,636 INFO  L93              Difference]: Finished difference Result 2612 states and 3886 transitions.
[2025-03-03 16:39:42,636 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 16:39:42,637 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 489
[2025-03-03 16:39:42,637 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:39:42,640 INFO  L225             Difference]: With dead ends: 2612
[2025-03-03 16:39:42,640 INFO  L226             Difference]: Without dead ends: 1413
[2025-03-03 16:39:42,641 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 16:39:42,642 INFO  L435           NwaCegarLoop]: 1666 mSDtfsCounter, 2067 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2080 SdHoareTripleChecker+Valid, 3351 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 16:39:42,642 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2080 Valid, 3351 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 16:39:42,643 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1413 states.
[2025-03-03 16:39:42,654 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1413.
[2025-03-03 16:39:42,655 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1413 states, 1398 states have (on average 1.4849785407725322) internal successors, (2076), 1398 states have internal predecessors, (2076), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2025-03-03 16:39:42,656 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2102 transitions.
[2025-03-03 16:39:42,656 INFO  L78                 Accepts]: Start accepts. Automaton has 1413 states and 2102 transitions. Word has length 489
[2025-03-03 16:39:42,657 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:39:42,657 INFO  L471      AbstractCegarLoop]: Abstraction has 1413 states and 2102 transitions.
[2025-03-03 16:39:42,657 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2025-03-03 16:39:42,657 INFO  L276                IsEmpty]: Start isEmpty. Operand 1413 states and 2102 transitions.
[2025-03-03 16:39:42,659 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 491
[2025-03-03 16:39:42,659 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:39:42,660 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:39:42,660 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 16:39:42,660 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:39:42,660 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:39:42,660 INFO  L85        PathProgramCache]: Analyzing trace with hash -510241711, now seen corresponding path program 1 times
[2025-03-03 16:39:42,660 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:39:42,660 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716315400]
[2025-03-03 16:39:42,660 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:39:42,660 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:39:42,720 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 490 statements into 1 equivalence classes.
[2025-03-03 16:39:42,803 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 490 of 490 statements.
[2025-03-03 16:39:42,804 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:39:42,804 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:39:43,190 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2025-03-03 16:39:43,191 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:39:43,191 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716315400]
[2025-03-03 16:39:43,191 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716315400] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:39:43,191 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:39:43,191 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 16:39:43,191 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533032714]
[2025-03-03 16:39:43,191 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:39:43,192 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 16:39:43,192 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:39:43,192 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 16:39:43,192 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 16:39:43,193 INFO  L87              Difference]: Start difference. First operand 1413 states and 2102 transitions. Second operand  has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2025-03-03 16:39:43,773 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:39:43,773 INFO  L93              Difference]: Finished difference Result 2612 states and 3884 transitions.
[2025-03-03 16:39:43,773 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 16:39:43,773 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 490
[2025-03-03 16:39:43,774 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:39:43,777 INFO  L225             Difference]: With dead ends: 2612
[2025-03-03 16:39:43,777 INFO  L226             Difference]: Without dead ends: 1413
[2025-03-03 16:39:43,778 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 16:39:43,778 INFO  L435           NwaCegarLoop]: 1666 mSDtfsCounter, 3804 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3817 SdHoareTripleChecker+Valid, 3334 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 16:39:43,778 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3817 Valid, 3334 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 16:39:43,779 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1413 states.
[2025-03-03 16:39:43,790 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1413.
[2025-03-03 16:39:43,791 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1413 states, 1398 states have (on average 1.4842632331902719) internal successors, (2075), 1398 states have internal predecessors, (2075), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2025-03-03 16:39:43,793 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2101 transitions.
[2025-03-03 16:39:43,793 INFO  L78                 Accepts]: Start accepts. Automaton has 1413 states and 2101 transitions. Word has length 490
[2025-03-03 16:39:43,793 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:39:43,793 INFO  L471      AbstractCegarLoop]: Abstraction has 1413 states and 2101 transitions.
[2025-03-03 16:39:43,794 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2025-03-03 16:39:43,794 INFO  L276                IsEmpty]: Start isEmpty. Operand 1413 states and 2101 transitions.
[2025-03-03 16:39:43,796 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 492
[2025-03-03 16:39:43,796 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:39:43,796 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:39:43,796 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-03 16:39:43,796 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:39:43,797 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:39:43,797 INFO  L85        PathProgramCache]: Analyzing trace with hash 1440149990, now seen corresponding path program 1 times
[2025-03-03 16:39:43,797 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:39:43,797 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120223614]
[2025-03-03 16:39:43,797 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:39:43,797 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:39:43,865 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes.
[2025-03-03 16:39:43,952 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements.
[2025-03-03 16:39:43,953 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:39:43,953 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:39:44,333 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2025-03-03 16:39:44,333 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:39:44,333 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120223614]
[2025-03-03 16:39:44,333 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120223614] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:39:44,333 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:39:44,333 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 16:39:44,333 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782118075]
[2025-03-03 16:39:44,333 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:39:44,334 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 16:39:44,334 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:39:44,334 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 16:39:44,334 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 16:39:44,335 INFO  L87              Difference]: Start difference. First operand 1413 states and 2101 transitions. Second operand  has 5 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2025-03-03 16:39:44,794 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:39:44,794 INFO  L93              Difference]: Finished difference Result 2612 states and 3882 transitions.
[2025-03-03 16:39:44,794 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 16:39:44,795 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 491
[2025-03-03 16:39:44,795 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:39:44,798 INFO  L225             Difference]: With dead ends: 2612
[2025-03-03 16:39:44,798 INFO  L226             Difference]: Without dead ends: 1413
[2025-03-03 16:39:44,799 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 16:39:44,799 INFO  L435           NwaCegarLoop]: 1666 mSDtfsCounter, 2024 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2037 SdHoareTripleChecker+Valid, 3351 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 16:39:44,799 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2037 Valid, 3351 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 16:39:44,801 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1413 states.
[2025-03-03 16:39:44,812 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1413.
[2025-03-03 16:39:44,813 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1413 states, 1398 states have (on average 1.4835479256080115) internal successors, (2074), 1398 states have internal predecessors, (2074), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2025-03-03 16:39:44,815 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2100 transitions.
[2025-03-03 16:39:44,815 INFO  L78                 Accepts]: Start accepts. Automaton has 1413 states and 2100 transitions. Word has length 491
[2025-03-03 16:39:44,815 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:39:44,815 INFO  L471      AbstractCegarLoop]: Abstraction has 1413 states and 2100 transitions.
[2025-03-03 16:39:44,815 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2025-03-03 16:39:44,815 INFO  L276                IsEmpty]: Start isEmpty. Operand 1413 states and 2100 transitions.
[2025-03-03 16:39:44,818 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 493
[2025-03-03 16:39:44,818 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:39:44,818 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:39:44,818 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-03 16:39:44,818 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:39:44,819 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:39:44,819 INFO  L85        PathProgramCache]: Analyzing trace with hash -962202356, now seen corresponding path program 1 times
[2025-03-03 16:39:44,819 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:39:44,819 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945605029]
[2025-03-03 16:39:44,819 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:39:44,819 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:39:44,882 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 492 statements into 1 equivalence classes.
[2025-03-03 16:39:44,964 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 492 of 492 statements.
[2025-03-03 16:39:44,965 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:39:44,965 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:39:45,331 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2025-03-03 16:39:45,331 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:39:45,332 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945605029]
[2025-03-03 16:39:45,332 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945605029] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:39:45,332 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:39:45,332 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 16:39:45,333 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596177223]
[2025-03-03 16:39:45,333 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:39:45,333 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 16:39:45,333 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:39:45,334 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 16:39:45,334 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 16:39:45,334 INFO  L87              Difference]: Start difference. First operand 1413 states and 2100 transitions. Second operand  has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2025-03-03 16:39:45,813 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:39:45,813 INFO  L93              Difference]: Finished difference Result 2612 states and 3880 transitions.
[2025-03-03 16:39:45,813 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 16:39:45,813 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 492
[2025-03-03 16:39:45,814 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:39:45,817 INFO  L225             Difference]: With dead ends: 2612
[2025-03-03 16:39:45,817 INFO  L226             Difference]: Without dead ends: 1413
[2025-03-03 16:39:45,818 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 16:39:45,818 INFO  L435           NwaCegarLoop]: 1666 mSDtfsCounter, 1981 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1994 SdHoareTripleChecker+Valid, 3351 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 16:39:45,818 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1994 Valid, 3351 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 16:39:45,820 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1413 states.
[2025-03-03 16:39:45,830 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1413.
[2025-03-03 16:39:45,831 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1413 states, 1398 states have (on average 1.4828326180257512) internal successors, (2073), 1398 states have internal predecessors, (2073), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2025-03-03 16:39:45,832 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2099 transitions.
[2025-03-03 16:39:45,833 INFO  L78                 Accepts]: Start accepts. Automaton has 1413 states and 2099 transitions. Word has length 492
[2025-03-03 16:39:45,833 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:39:45,833 INFO  L471      AbstractCegarLoop]: Abstraction has 1413 states and 2099 transitions.
[2025-03-03 16:39:45,833 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2025-03-03 16:39:45,833 INFO  L276                IsEmpty]: Start isEmpty. Operand 1413 states and 2099 transitions.
[2025-03-03 16:39:45,835 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 494
[2025-03-03 16:39:45,835 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:39:45,836 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:39:45,836 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-03 16:39:45,836 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:39:45,836 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:39:45,836 INFO  L85        PathProgramCache]: Analyzing trace with hash 431067213, now seen corresponding path program 1 times
[2025-03-03 16:39:45,836 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:39:45,836 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518209321]
[2025-03-03 16:39:45,836 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:39:45,836 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:39:45,913 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 493 statements into 1 equivalence classes.
[2025-03-03 16:39:45,993 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 493 of 493 statements.
[2025-03-03 16:39:45,993 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:39:45,993 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:39:46,355 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2025-03-03 16:39:46,356 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:39:46,356 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518209321]
[2025-03-03 16:39:46,356 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518209321] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:39:46,356 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:39:46,356 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 16:39:46,356 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338945624]
[2025-03-03 16:39:46,356 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:39:46,356 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 16:39:46,356 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:39:46,357 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 16:39:46,357 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 16:39:46,357 INFO  L87              Difference]: Start difference. First operand 1413 states and 2099 transitions. Second operand  has 5 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2025-03-03 16:39:46,796 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:39:46,796 INFO  L93              Difference]: Finished difference Result 2612 states and 3878 transitions.
[2025-03-03 16:39:46,797 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 16:39:46,797 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 493
[2025-03-03 16:39:46,797 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:39:46,800 INFO  L225             Difference]: With dead ends: 2612
[2025-03-03 16:39:46,800 INFO  L226             Difference]: Without dead ends: 1413
[2025-03-03 16:39:46,801 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 16:39:46,801 INFO  L435           NwaCegarLoop]: 1666 mSDtfsCounter, 1942 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1955 SdHoareTripleChecker+Valid, 3351 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 16:39:46,802 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1955 Valid, 3351 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 16:39:46,803 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1413 states.
[2025-03-03 16:39:46,811 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1413.
[2025-03-03 16:39:46,812 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1413 states, 1398 states have (on average 1.4821173104434906) internal successors, (2072), 1398 states have internal predecessors, (2072), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2025-03-03 16:39:46,813 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2098 transitions.
[2025-03-03 16:39:46,813 INFO  L78                 Accepts]: Start accepts. Automaton has 1413 states and 2098 transitions. Word has length 493
[2025-03-03 16:39:46,814 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:39:46,814 INFO  L471      AbstractCegarLoop]: Abstraction has 1413 states and 2098 transitions.
[2025-03-03 16:39:46,814 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2025-03-03 16:39:46,814 INFO  L276                IsEmpty]: Start isEmpty. Operand 1413 states and 2098 transitions.
[2025-03-03 16:39:46,816 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 495
[2025-03-03 16:39:46,816 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:39:46,816 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:39:46,816 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-03 16:39:46,816 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:39:46,817 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:39:46,817 INFO  L85        PathProgramCache]: Analyzing trace with hash 1471929756, now seen corresponding path program 1 times
[2025-03-03 16:39:46,817 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:39:46,817 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359474000]
[2025-03-03 16:39:46,817 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:39:46,817 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:39:46,878 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes.
[2025-03-03 16:39:46,959 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements.
[2025-03-03 16:39:46,959 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:39:46,959 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:39:47,325 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2025-03-03 16:39:47,325 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:39:47,325 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359474000]
[2025-03-03 16:39:47,325 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359474000] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:39:47,325 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:39:47,325 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 16:39:47,325 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141737665]
[2025-03-03 16:39:47,326 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:39:47,326 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 16:39:47,326 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:39:47,327 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 16:39:47,327 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 16:39:47,327 INFO  L87              Difference]: Start difference. First operand 1413 states and 2098 transitions. Second operand  has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2025-03-03 16:39:47,769 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:39:47,770 INFO  L93              Difference]: Finished difference Result 2612 states and 3876 transitions.
[2025-03-03 16:39:47,770 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 16:39:47,770 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 494
[2025-03-03 16:39:47,770 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:39:47,774 INFO  L225             Difference]: With dead ends: 2612
[2025-03-03 16:39:47,774 INFO  L226             Difference]: Without dead ends: 1413
[2025-03-03 16:39:47,775 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 16:39:47,775 INFO  L435           NwaCegarLoop]: 1666 mSDtfsCounter, 3624 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3637 SdHoareTripleChecker+Valid, 3334 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 16:39:47,775 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3637 Valid, 3334 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 16:39:47,776 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1413 states.
[2025-03-03 16:39:47,785 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1413.
[2025-03-03 16:39:47,786 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1413 states, 1398 states have (on average 1.4814020028612302) internal successors, (2071), 1398 states have internal predecessors, (2071), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2025-03-03 16:39:47,787 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2097 transitions.
[2025-03-03 16:39:47,787 INFO  L78                 Accepts]: Start accepts. Automaton has 1413 states and 2097 transitions. Word has length 494
[2025-03-03 16:39:47,788 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:39:47,788 INFO  L471      AbstractCegarLoop]: Abstraction has 1413 states and 2097 transitions.
[2025-03-03 16:39:47,788 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2025-03-03 16:39:47,788 INFO  L276                IsEmpty]: Start isEmpty. Operand 1413 states and 2097 transitions.
[2025-03-03 16:39:47,790 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 496
[2025-03-03 16:39:47,790 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:39:47,790 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:39:47,790 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-03 16:39:47,790 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:39:47,791 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:39:47,791 INFO  L85        PathProgramCache]: Analyzing trace with hash 1799558728, now seen corresponding path program 1 times
[2025-03-03 16:39:47,791 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:39:47,791 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731888437]
[2025-03-03 16:39:47,791 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:39:47,791 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:39:47,851 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 495 statements into 1 equivalence classes.
[2025-03-03 16:39:48,119 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 495 of 495 statements.
[2025-03-03 16:39:48,119 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:39:48,119 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:39:48,808 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2025-03-03 16:39:48,809 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:39:48,809 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731888437]
[2025-03-03 16:39:48,809 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731888437] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:39:48,809 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:39:48,809 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 16:39:48,809 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241633786]
[2025-03-03 16:39:48,809 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:39:48,810 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 16:39:48,810 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:39:48,810 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 16:39:48,810 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 16:39:48,810 INFO  L87              Difference]: Start difference. First operand 1413 states and 2097 transitions. Second operand  has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2025-03-03 16:39:49,262 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:39:49,262 INFO  L93              Difference]: Finished difference Result 2612 states and 3874 transitions.
[2025-03-03 16:39:49,262 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 16:39:49,262 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 495
[2025-03-03 16:39:49,263 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:39:49,266 INFO  L225             Difference]: With dead ends: 2612
[2025-03-03 16:39:49,266 INFO  L226             Difference]: Without dead ends: 1413
[2025-03-03 16:39:49,267 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 16:39:49,268 INFO  L435           NwaCegarLoop]: 1666 mSDtfsCounter, 1813 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1813 SdHoareTripleChecker+Valid, 3334 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 16:39:49,268 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1813 Valid, 3334 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 16:39:49,269 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1413 states.
[2025-03-03 16:39:49,279 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1413.
[2025-03-03 16:39:49,280 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1413 states, 1398 states have (on average 1.48068669527897) internal successors, (2070), 1398 states have internal predecessors, (2070), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2025-03-03 16:39:49,281 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2096 transitions.
[2025-03-03 16:39:49,282 INFO  L78                 Accepts]: Start accepts. Automaton has 1413 states and 2096 transitions. Word has length 495
[2025-03-03 16:39:49,282 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:39:49,282 INFO  L471      AbstractCegarLoop]: Abstraction has 1413 states and 2096 transitions.
[2025-03-03 16:39:49,282 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2025-03-03 16:39:49,282 INFO  L276                IsEmpty]: Start isEmpty. Operand 1413 states and 2096 transitions.
[2025-03-03 16:39:49,284 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 497
[2025-03-03 16:39:49,284 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:39:49,285 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:39:49,285 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-03 16:39:49,285 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:39:49,285 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:39:49,286 INFO  L85        PathProgramCache]: Analyzing trace with hash 704213237, now seen corresponding path program 1 times
[2025-03-03 16:39:49,286 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:39:49,286 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034110729]
[2025-03-03 16:39:49,286 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:39:49,286 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:39:49,356 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes.
[2025-03-03 16:39:49,567 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements.
[2025-03-03 16:39:49,567 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:39:49,567 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:39:50,124 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2025-03-03 16:39:50,124 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:39:50,124 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034110729]
[2025-03-03 16:39:50,124 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034110729] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:39:50,124 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:39:50,124 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 16:39:50,124 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586974634]
[2025-03-03 16:39:50,124 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:39:50,125 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 16:39:50,125 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:39:50,125 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 16:39:50,125 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 16:39:50,126 INFO  L87              Difference]: Start difference. First operand 1413 states and 2096 transitions. Second operand  has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2025-03-03 16:39:50,538 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:39:50,538 INFO  L93              Difference]: Finished difference Result 2612 states and 3872 transitions.
[2025-03-03 16:39:50,539 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 16:39:50,539 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 496
[2025-03-03 16:39:50,539 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:39:50,542 INFO  L225             Difference]: With dead ends: 2612
[2025-03-03 16:39:50,542 INFO  L226             Difference]: Without dead ends: 1413
[2025-03-03 16:39:50,544 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 16:39:50,544 INFO  L435           NwaCegarLoop]: 1666 mSDtfsCounter, 1770 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1770 SdHoareTripleChecker+Valid, 3334 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 16:39:50,544 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1770 Valid, 3334 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 16:39:50,545 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1413 states.
[2025-03-03 16:39:50,555 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1413.
[2025-03-03 16:39:50,556 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1413 states, 1398 states have (on average 1.4799713876967096) internal successors, (2069), 1398 states have internal predecessors, (2069), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2025-03-03 16:39:50,557 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2095 transitions.
[2025-03-03 16:39:50,558 INFO  L78                 Accepts]: Start accepts. Automaton has 1413 states and 2095 transitions. Word has length 496
[2025-03-03 16:39:50,558 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:39:50,558 INFO  L471      AbstractCegarLoop]: Abstraction has 1413 states and 2095 transitions.
[2025-03-03 16:39:50,558 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2025-03-03 16:39:50,559 INFO  L276                IsEmpty]: Start isEmpty. Operand 1413 states and 2095 transitions.
[2025-03-03 16:39:50,561 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 498
[2025-03-03 16:39:50,561 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:39:50,561 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:39:50,561 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-03 16:39:50,561 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:39:50,562 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:39:50,562 INFO  L85        PathProgramCache]: Analyzing trace with hash 669209597, now seen corresponding path program 1 times
[2025-03-03 16:39:50,562 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:39:50,562 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462736445]
[2025-03-03 16:39:50,562 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:39:50,562 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:39:50,623 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes.
[2025-03-03 16:39:50,833 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements.
[2025-03-03 16:39:50,833 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:39:50,833 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:39:51,372 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2025-03-03 16:39:51,372 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:39:51,372 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462736445]
[2025-03-03 16:39:51,372 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462736445] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:39:51,372 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:39:51,372 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 16:39:51,373 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929817459]
[2025-03-03 16:39:51,373 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:39:51,373 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 16:39:51,373 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:39:51,374 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 16:39:51,374 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 16:39:51,374 INFO  L87              Difference]: Start difference. First operand 1413 states and 2095 transitions. Second operand  has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2025-03-03 16:39:51,862 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:39:51,862 INFO  L93              Difference]: Finished difference Result 2612 states and 3870 transitions.
[2025-03-03 16:39:51,863 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 16:39:51,863 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 497
[2025-03-03 16:39:51,863 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:39:51,866 INFO  L225             Difference]: With dead ends: 2612
[2025-03-03 16:39:51,866 INFO  L226             Difference]: Without dead ends: 1413
[2025-03-03 16:39:51,867 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 16:39:51,867 INFO  L435           NwaCegarLoop]: 1666 mSDtfsCounter, 1685 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1685 SdHoareTripleChecker+Valid, 3334 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 16:39:51,867 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1685 Valid, 3334 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 16:39:51,869 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1413 states.
[2025-03-03 16:39:51,877 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1413.
[2025-03-03 16:39:51,878 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1413 states, 1398 states have (on average 1.4792560801144492) internal successors, (2068), 1398 states have internal predecessors, (2068), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2025-03-03 16:39:51,879 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2094 transitions.
[2025-03-03 16:39:51,879 INFO  L78                 Accepts]: Start accepts. Automaton has 1413 states and 2094 transitions. Word has length 497
[2025-03-03 16:39:51,880 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:39:51,880 INFO  L471      AbstractCegarLoop]: Abstraction has 1413 states and 2094 transitions.
[2025-03-03 16:39:51,880 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2025-03-03 16:39:51,880 INFO  L276                IsEmpty]: Start isEmpty. Operand 1413 states and 2094 transitions.
[2025-03-03 16:39:51,882 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 499
[2025-03-03 16:39:51,882 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:39:51,882 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:39:51,883 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-03-03 16:39:51,883 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:39:51,883 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:39:51,883 INFO  L85        PathProgramCache]: Analyzing trace with hash -2124469405, now seen corresponding path program 1 times
[2025-03-03 16:39:51,883 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:39:51,883 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106911799]
[2025-03-03 16:39:51,884 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:39:51,884 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:39:51,940 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes.
[2025-03-03 16:39:52,477 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements.
[2025-03-03 16:39:52,477 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:39:52,477 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:39:53,051 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2025-03-03 16:39:53,052 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:39:53,052 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106911799]
[2025-03-03 16:39:53,052 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106911799] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:39:53,052 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:39:53,052 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 16:39:53,052 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489973949]
[2025-03-03 16:39:53,052 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:39:53,052 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 16:39:53,053 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:39:53,053 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 16:39:53,053 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 16:39:53,053 INFO  L87              Difference]: Start difference. First operand 1413 states and 2094 transitions. Second operand  has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13)
[2025-03-03 16:39:53,774 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:39:53,774 INFO  L93              Difference]: Finished difference Result 2612 states and 3868 transitions.
[2025-03-03 16:39:53,774 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 16:39:53,775 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 498
[2025-03-03 16:39:53,775 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:39:53,781 INFO  L225             Difference]: With dead ends: 2612
[2025-03-03 16:39:53,781 INFO  L226             Difference]: Without dead ends: 1413
[2025-03-03 16:39:53,782 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 16:39:53,782 INFO  L435           NwaCegarLoop]: 1316 mSDtfsCounter, 1889 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1894 SdHoareTripleChecker+Valid, 2631 SdHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 16:39:53,782 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1894 Valid, 2631 Invalid, 1562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1561 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 16:39:53,784 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1413 states.
[2025-03-03 16:39:53,794 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1413.
[2025-03-03 16:39:53,795 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1413 states, 1398 states have (on average 1.4785407725321889) internal successors, (2067), 1398 states have internal predecessors, (2067), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2025-03-03 16:39:53,796 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2093 transitions.
[2025-03-03 16:39:53,797 INFO  L78                 Accepts]: Start accepts. Automaton has 1413 states and 2093 transitions. Word has length 498
[2025-03-03 16:39:53,797 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:39:53,797 INFO  L471      AbstractCegarLoop]: Abstraction has 1413 states and 2093 transitions.
[2025-03-03 16:39:53,797 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13)
[2025-03-03 16:39:53,797 INFO  L276                IsEmpty]: Start isEmpty. Operand 1413 states and 2093 transitions.
[2025-03-03 16:39:53,800 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 500
[2025-03-03 16:39:53,800 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:39:53,801 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:39:53,801 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-03-03 16:39:53,801 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:39:53,802 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:39:53,802 INFO  L85        PathProgramCache]: Analyzing trace with hash -2078991561, now seen corresponding path program 1 times
[2025-03-03 16:39:53,802 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:39:53,802 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094551888]
[2025-03-03 16:39:53,802 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:39:53,803 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:39:53,867 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes.
[2025-03-03 16:39:54,439 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements.
[2025-03-03 16:39:54,440 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:39:54,440 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:39:55,406 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2025-03-03 16:39:55,406 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:39:55,406 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094551888]
[2025-03-03 16:39:55,406 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094551888] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:39:55,406 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:39:55,406 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 16:39:55,407 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964510676]
[2025-03-03 16:39:55,407 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:39:55,407 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 16:39:55,407 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:39:55,407 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 16:39:55,408 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 16:39:55,408 INFO  L87              Difference]: Start difference. First operand 1413 states and 2093 transitions. Second operand  has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13)
[2025-03-03 16:39:56,285 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:39:56,285 INFO  L93              Difference]: Finished difference Result 2616 states and 3872 transitions.
[2025-03-03 16:39:56,285 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 16:39:56,286 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 499
[2025-03-03 16:39:56,286 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:39:56,293 INFO  L225             Difference]: With dead ends: 2616
[2025-03-03 16:39:56,293 INFO  L226             Difference]: Without dead ends: 1417
[2025-03-03 16:39:56,295 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 16:39:56,295 INFO  L435           NwaCegarLoop]: 1315 mSDtfsCounter, 1980 mSDsluCounter, 2597 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1985 SdHoareTripleChecker+Valid, 3912 SdHoareTripleChecker+Invalid, 2355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 16:39:56,295 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1985 Valid, 3912 Invalid, 2355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 16:39:56,297 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1417 states.
[2025-03-03 16:39:56,313 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 1415.
[2025-03-03 16:39:56,315 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1415 states, 1400 states have (on average 1.4778571428571428) internal successors, (2069), 1400 states have internal predecessors, (2069), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2025-03-03 16:39:56,316 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 2095 transitions.
[2025-03-03 16:39:56,316 INFO  L78                 Accepts]: Start accepts. Automaton has 1415 states and 2095 transitions. Word has length 499
[2025-03-03 16:39:56,316 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:39:56,316 INFO  L471      AbstractCegarLoop]: Abstraction has 1415 states and 2095 transitions.
[2025-03-03 16:39:56,317 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13)
[2025-03-03 16:39:56,317 INFO  L276                IsEmpty]: Start isEmpty. Operand 1415 states and 2095 transitions.
[2025-03-03 16:39:56,319 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 501
[2025-03-03 16:39:56,319 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:39:56,319 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:39:56,319 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-03-03 16:39:56,319 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:39:56,320 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:39:56,320 INFO  L85        PathProgramCache]: Analyzing trace with hash -1282438579, now seen corresponding path program 1 times
[2025-03-03 16:39:56,320 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:39:56,320 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869121191]
[2025-03-03 16:39:56,320 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:39:56,320 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:39:56,386 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes.
[2025-03-03 16:39:57,070 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements.
[2025-03-03 16:39:57,070 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:39:57,071 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:39:57,987 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2025-03-03 16:39:57,988 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:39:57,988 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869121191]
[2025-03-03 16:39:57,988 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869121191] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:39:57,988 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:39:57,988 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 16:39:57,988 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73097565]
[2025-03-03 16:39:57,988 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:39:57,989 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 16:39:57,989 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:39:57,989 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 16:39:57,989 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 16:39:57,990 INFO  L87              Difference]: Start difference. First operand 1415 states and 2095 transitions. Second operand  has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2025-03-03 16:39:58,926 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:39:58,926 INFO  L93              Difference]: Finished difference Result 2618 states and 3873 transitions.
[2025-03-03 16:39:58,926 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 16:39:58,927 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 500
[2025-03-03 16:39:58,927 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:39:58,929 INFO  L225             Difference]: With dead ends: 2618
[2025-03-03 16:39:58,929 INFO  L226             Difference]: Without dead ends: 1417
[2025-03-03 16:39:58,930 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 16:39:58,932 INFO  L435           NwaCegarLoop]: 1315 mSDtfsCounter, 1816 mSDsluCounter, 2614 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1816 SdHoareTripleChecker+Valid, 3929 SdHoareTripleChecker+Invalid, 2354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-03 16:39:58,932 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1816 Valid, 3929 Invalid, 2354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-03 16:39:58,934 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1417 states.
[2025-03-03 16:39:58,944 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 1416.
[2025-03-03 16:39:58,945 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1416 states, 1401 states have (on average 1.4775160599571735) internal successors, (2070), 1401 states have internal predecessors, (2070), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2025-03-03 16:39:58,946 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2096 transitions.
[2025-03-03 16:39:58,946 INFO  L78                 Accepts]: Start accepts. Automaton has 1416 states and 2096 transitions. Word has length 500
[2025-03-03 16:39:58,946 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:39:58,946 INFO  L471      AbstractCegarLoop]: Abstraction has 1416 states and 2096 transitions.
[2025-03-03 16:39:58,946 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2025-03-03 16:39:58,947 INFO  L276                IsEmpty]: Start isEmpty. Operand 1416 states and 2096 transitions.
[2025-03-03 16:39:58,948 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 501
[2025-03-03 16:39:58,949 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:39:58,949 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:39:58,949 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-03-03 16:39:58,949 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:39:58,949 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:39:58,949 INFO  L85        PathProgramCache]: Analyzing trace with hash -1683339256, now seen corresponding path program 1 times
[2025-03-03 16:39:58,949 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:39:58,950 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183642149]
[2025-03-03 16:39:58,950 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:39:58,950 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:39:59,011 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes.
[2025-03-03 16:39:59,260 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements.
[2025-03-03 16:39:59,260 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:39:59,260 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:40:00,020 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2025-03-03 16:40:00,020 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:40:00,020 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183642149]
[2025-03-03 16:40:00,020 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183642149] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:40:00,020 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:40:00,020 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 16:40:00,021 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88773055]
[2025-03-03 16:40:00,021 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:40:00,021 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 16:40:00,021 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:40:00,021 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 16:40:00,021 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 16:40:00,022 INFO  L87              Difference]: Start difference. First operand 1416 states and 2096 transitions. Second operand  has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13)
[2025-03-03 16:40:01,035 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:40:01,035 INFO  L93              Difference]: Finished difference Result 3809 states and 5633 transitions.
[2025-03-03 16:40:01,035 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 16:40:01,035 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 500
[2025-03-03 16:40:01,035 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:40:01,040 INFO  L225             Difference]: With dead ends: 3809
[2025-03-03 16:40:01,040 INFO  L226             Difference]: Without dead ends: 2587
[2025-03-03 16:40:01,041 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-03-03 16:40:01,042 INFO  L435           NwaCegarLoop]: 1737 mSDtfsCounter, 1679 mSDsluCounter, 6522 mSDsCounter, 0 mSdLazyCounter, 2185 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1688 SdHoareTripleChecker+Valid, 8259 SdHoareTripleChecker+Invalid, 2188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-03 16:40:01,042 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1688 Valid, 8259 Invalid, 2188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2185 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-03 16:40:01,044 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2587 states.
[2025-03-03 16:40:01,060 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2587 to 1531.
[2025-03-03 16:40:01,061 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1531 states, 1512 states have (on average 1.4768518518518519) internal successors, (2233), 1512 states have internal predecessors, (2233), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17)
[2025-03-03 16:40:01,063 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 2267 transitions.
[2025-03-03 16:40:01,063 INFO  L78                 Accepts]: Start accepts. Automaton has 1531 states and 2267 transitions. Word has length 500
[2025-03-03 16:40:01,063 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:40:01,063 INFO  L471      AbstractCegarLoop]: Abstraction has 1531 states and 2267 transitions.
[2025-03-03 16:40:01,064 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13)
[2025-03-03 16:40:01,064 INFO  L276                IsEmpty]: Start isEmpty. Operand 1531 states and 2267 transitions.
[2025-03-03 16:40:01,066 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 502
[2025-03-03 16:40:01,066 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:40:01,066 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:40:01,066 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-03-03 16:40:01,066 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:40:01,067 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:40:01,067 INFO  L85        PathProgramCache]: Analyzing trace with hash -991473490, now seen corresponding path program 1 times
[2025-03-03 16:40:01,067 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:40:01,067 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242559721]
[2025-03-03 16:40:01,067 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:40:01,068 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:40:01,134 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes.
[2025-03-03 16:40:01,640 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements.
[2025-03-03 16:40:01,640 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:40:01,640 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:40:02,577 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2025-03-03 16:40:02,577 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:40:02,577 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242559721]
[2025-03-03 16:40:02,577 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242559721] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:40:02,577 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:40:02,577 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 16:40:02,577 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522402056]
[2025-03-03 16:40:02,577 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:40:02,577 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 16:40:02,577 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:40:02,578 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 16:40:02,578 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-03 16:40:02,578 INFO  L87              Difference]: Start difference. First operand 1531 states and 2267 transitions. Second operand  has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13)
[2025-03-03 16:40:03,992 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:40:03,992 INFO  L93              Difference]: Finished difference Result 3789 states and 5603 transitions.
[2025-03-03 16:40:03,992 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 16:40:03,993 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 501
[2025-03-03 16:40:03,993 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:40:03,997 INFO  L225             Difference]: With dead ends: 3789
[2025-03-03 16:40:03,997 INFO  L226             Difference]: Without dead ends: 2587
[2025-03-03 16:40:03,998 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-03 16:40:03,999 INFO  L435           NwaCegarLoop]: 1313 mSDtfsCounter, 3610 mSDsluCounter, 3910 mSDsCounter, 0 mSdLazyCounter, 3149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3632 SdHoareTripleChecker+Valid, 5223 SdHoareTripleChecker+Invalid, 3149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-03 16:40:03,999 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3632 Valid, 5223 Invalid, 3149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3149 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-03 16:40:04,000 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2587 states.
[2025-03-03 16:40:04,013 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2587 to 1532.
[2025-03-03 16:40:04,015 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1532 states, 1513 states have (on average 1.4765366820885657) internal successors, (2234), 1513 states have internal predecessors, (2234), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17)
[2025-03-03 16:40:04,016 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 2268 transitions.
[2025-03-03 16:40:04,016 INFO  L78                 Accepts]: Start accepts. Automaton has 1532 states and 2268 transitions. Word has length 501
[2025-03-03 16:40:04,017 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:40:04,017 INFO  L471      AbstractCegarLoop]: Abstraction has 1532 states and 2268 transitions.
[2025-03-03 16:40:04,017 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13)
[2025-03-03 16:40:04,017 INFO  L276                IsEmpty]: Start isEmpty. Operand 1532 states and 2268 transitions.
[2025-03-03 16:40:04,019 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 502
[2025-03-03 16:40:04,019 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:40:04,019 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:40:04,019 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-03-03 16:40:04,019 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:40:04,020 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:40:04,020 INFO  L85        PathProgramCache]: Analyzing trace with hash -1643578546, now seen corresponding path program 1 times
[2025-03-03 16:40:04,020 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:40:04,020 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658609777]
[2025-03-03 16:40:04,020 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:40:04,020 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:40:04,083 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes.
[2025-03-03 16:40:04,571 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements.
[2025-03-03 16:40:04,571 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:40:04,571 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:40:05,098 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2025-03-03 16:40:05,098 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:40:05,098 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658609777]
[2025-03-03 16:40:05,098 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658609777] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:40:05,098 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:40:05,098 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 16:40:05,099 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626534589]
[2025-03-03 16:40:05,099 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:40:05,099 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 16:40:05,099 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:40:05,099 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 16:40:05,099 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 16:40:05,100 INFO  L87              Difference]: Start difference. First operand 1532 states and 2268 transitions. Second operand  has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13)
[2025-03-03 16:40:05,863 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:40:05,863 INFO  L93              Difference]: Finished difference Result 2734 states and 4044 transitions.
[2025-03-03 16:40:05,863 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 16:40:05,864 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 501
[2025-03-03 16:40:05,864 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:40:05,866 INFO  L225             Difference]: With dead ends: 2734
[2025-03-03 16:40:05,866 INFO  L226             Difference]: Without dead ends: 1532
[2025-03-03 16:40:05,868 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 16:40:05,868 INFO  L435           NwaCegarLoop]: 1316 mSDtfsCounter, 1973 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1978 SdHoareTripleChecker+Valid, 2614 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 16:40:05,869 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1978 Valid, 2614 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1559 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 16:40:05,871 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1532 states.
[2025-03-03 16:40:05,883 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1532.
[2025-03-03 16:40:05,885 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1532 states, 1513 states have (on average 1.4758757435558494) internal successors, (2233), 1513 states have internal predecessors, (2233), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17)
[2025-03-03 16:40:05,886 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 2267 transitions.
[2025-03-03 16:40:05,886 INFO  L78                 Accepts]: Start accepts. Automaton has 1532 states and 2267 transitions. Word has length 501
[2025-03-03 16:40:05,887 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:40:05,887 INFO  L471      AbstractCegarLoop]: Abstraction has 1532 states and 2267 transitions.
[2025-03-03 16:40:05,887 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13)
[2025-03-03 16:40:05,887 INFO  L276                IsEmpty]: Start isEmpty. Operand 1532 states and 2267 transitions.
[2025-03-03 16:40:05,889 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 503
[2025-03-03 16:40:05,889 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:40:05,890 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:40:05,890 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2025-03-03 16:40:05,890 INFO  L396      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:40:05,890 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:40:05,890 INFO  L85        PathProgramCache]: Analyzing trace with hash 1448743160, now seen corresponding path program 1 times
[2025-03-03 16:40:05,891 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:40:05,891 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158203547]
[2025-03-03 16:40:05,891 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:40:05,891 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:40:05,952 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes.
[2025-03-03 16:40:06,172 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements.
[2025-03-03 16:40:06,172 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:40:06,172 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:40:06,978 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2025-03-03 16:40:06,978 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:40:06,978 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158203547]
[2025-03-03 16:40:06,979 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158203547] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:40:06,979 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:40:06,979 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-03 16:40:06,979 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107199540]
[2025-03-03 16:40:06,979 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:40:06,979 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 16:40:06,979 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:40:06,980 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 16:40:06,980 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-03-03 16:40:06,980 INFO  L87              Difference]: Start difference. First operand 1532 states and 2267 transitions. Second operand  has 7 states, 7 states have (on average 62.857142857142854) internal successors, (440), 7 states have internal predecessors, (440), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13)
[2025-03-03 16:40:08,720 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:40:08,720 INFO  L93              Difference]: Finished difference Result 3945 states and 5831 transitions.
[2025-03-03 16:40:08,720 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-03 16:40:08,720 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 62.857142857142854) internal successors, (440), 7 states have internal predecessors, (440), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 502
[2025-03-03 16:40:08,721 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:40:08,725 INFO  L225             Difference]: With dead ends: 3945
[2025-03-03 16:40:08,725 INFO  L226             Difference]: Without dead ends: 2703
[2025-03-03 16:40:08,726 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-03-03 16:40:08,727 INFO  L435           NwaCegarLoop]: 3190 mSDtfsCounter, 1679 mSDsluCounter, 13702 mSDsCounter, 0 mSdLazyCounter, 4382 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1688 SdHoareTripleChecker+Valid, 16892 SdHoareTripleChecker+Invalid, 4386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-03-03 16:40:08,727 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1688 Valid, 16892 Invalid, 4386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4382 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-03-03 16:40:08,729 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2703 states.
[2025-03-03 16:40:08,743 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 1532.
[2025-03-03 16:40:08,745 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1532 states, 1513 states have (on average 1.4752148050231328) internal successors, (2232), 1513 states have internal predecessors, (2232), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17)
[2025-03-03 16:40:08,746 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 2266 transitions.
[2025-03-03 16:40:08,746 INFO  L78                 Accepts]: Start accepts. Automaton has 1532 states and 2266 transitions. Word has length 502
[2025-03-03 16:40:08,747 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:40:08,747 INFO  L471      AbstractCegarLoop]: Abstraction has 1532 states and 2266 transitions.
[2025-03-03 16:40:08,747 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 62.857142857142854) internal successors, (440), 7 states have internal predecessors, (440), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13)
[2025-03-03 16:40:08,747 INFO  L276                IsEmpty]: Start isEmpty. Operand 1532 states and 2266 transitions.
[2025-03-03 16:40:08,749 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 504
[2025-03-03 16:40:08,749 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:40:08,749 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:40:08,749 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2025-03-03 16:40:08,750 INFO  L396      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:40:08,750 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:40:08,750 INFO  L85        PathProgramCache]: Analyzing trace with hash 1496190316, now seen corresponding path program 1 times
[2025-03-03 16:40:08,750 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:40:08,750 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357384229]
[2025-03-03 16:40:08,750 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:40:08,750 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:40:08,820 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes.
[2025-03-03 16:40:09,261 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements.
[2025-03-03 16:40:09,261 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:40:09,261 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:40:10,057 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2025-03-03 16:40:10,058 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:40:10,058 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357384229]
[2025-03-03 16:40:10,058 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357384229] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:40:10,058 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:40:10,058 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 16:40:10,058 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382088588]
[2025-03-03 16:40:10,058 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:40:10,058 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 16:40:10,058 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:40:10,059 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 16:40:10,059 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 16:40:10,059 INFO  L87              Difference]: Start difference. First operand 1532 states and 2266 transitions. Second operand  has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13)
[2025-03-03 16:40:10,968 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:40:10,968 INFO  L93              Difference]: Finished difference Result 2738 states and 4046 transitions.
[2025-03-03 16:40:10,969 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 16:40:10,969 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 503
[2025-03-03 16:40:10,969 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:40:10,971 INFO  L225             Difference]: With dead ends: 2738
[2025-03-03 16:40:10,971 INFO  L226             Difference]: Without dead ends: 1536
[2025-03-03 16:40:10,973 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 16:40:10,973 INFO  L435           NwaCegarLoop]: 1315 mSDtfsCounter, 1917 mSDsluCounter, 2597 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1921 SdHoareTripleChecker+Valid, 3912 SdHoareTripleChecker+Invalid, 2349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-03 16:40:10,973 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1921 Valid, 3912 Invalid, 2349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-03 16:40:10,974 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1536 states.
[2025-03-03 16:40:10,985 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1534.
[2025-03-03 16:40:10,986 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1534 states, 1515 states have (on average 1.4745874587458745) internal successors, (2234), 1515 states have internal predecessors, (2234), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17)
[2025-03-03 16:40:10,987 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 2268 transitions.
[2025-03-03 16:40:10,988 INFO  L78                 Accepts]: Start accepts. Automaton has 1534 states and 2268 transitions. Word has length 503
[2025-03-03 16:40:10,988 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:40:10,988 INFO  L471      AbstractCegarLoop]: Abstraction has 1534 states and 2268 transitions.
[2025-03-03 16:40:10,988 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13)
[2025-03-03 16:40:10,988 INFO  L276                IsEmpty]: Start isEmpty. Operand 1534 states and 2268 transitions.
[2025-03-03 16:40:10,990 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 505
[2025-03-03 16:40:10,990 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:40:10,991 INFO  L218           NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:40:10,991 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2025-03-03 16:40:10,991 INFO  L396      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:40:10,991 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:40:10,991 INFO  L85        PathProgramCache]: Analyzing trace with hash 213613585, now seen corresponding path program 1 times
[2025-03-03 16:40:10,991 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:40:10,992 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522486193]
[2025-03-03 16:40:10,992 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:40:10,992 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:40:11,054 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes.
[2025-03-03 16:40:11,887 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements.
[2025-03-03 16:40:11,887 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:40:11,887 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:40:12,916 INFO  L134       CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2025-03-03 16:40:12,916 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:40:12,916 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522486193]
[2025-03-03 16:40:12,916 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522486193] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:40:12,916 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:40:12,917 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 16:40:12,917 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307142015]
[2025-03-03 16:40:12,917 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:40:12,917 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 16:40:12,917 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:40:12,918 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 16:40:12,918 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 16:40:12,918 INFO  L87              Difference]: Start difference. First operand 1534 states and 2268 transitions. Second operand  has 6 states, 6 states have (on average 73.66666666666667) internal successors, (442), 6 states have internal predecessors, (442), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2025-03-03 16:40:13,704 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:40:13,704 INFO  L93              Difference]: Finished difference Result 3343 states and 4929 transitions.
[2025-03-03 16:40:13,705 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 16:40:13,705 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 73.66666666666667) internal successors, (442), 6 states have internal predecessors, (442), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 504
[2025-03-03 16:40:13,705 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:40:13,713 INFO  L225             Difference]: With dead ends: 3343
[2025-03-03 16:40:13,713 INFO  L226             Difference]: Without dead ends: 2139
[2025-03-03 16:40:13,714 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2025-03-03 16:40:13,714 INFO  L435           NwaCegarLoop]: 1711 mSDtfsCounter, 3849 mSDsluCounter, 5128 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3862 SdHoareTripleChecker+Valid, 6839 SdHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 16:40:13,715 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3862 Valid, 6839 Invalid, 1538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 16:40:13,716 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2139 states.
[2025-03-03 16:40:13,737 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2139.
[2025-03-03 16:40:13,739 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2139 states, 2107 states have (on average 1.4674893213099194) internal successors, (3092), 2107 states have internal predecessors, (3092), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30)
[2025-03-03 16:40:13,742 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 3152 transitions.
[2025-03-03 16:40:13,742 INFO  L78                 Accepts]: Start accepts. Automaton has 2139 states and 3152 transitions. Word has length 504
[2025-03-03 16:40:13,743 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:40:13,743 INFO  L471      AbstractCegarLoop]: Abstraction has 2139 states and 3152 transitions.
[2025-03-03 16:40:13,743 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 73.66666666666667) internal successors, (442), 6 states have internal predecessors, (442), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2025-03-03 16:40:13,743 INFO  L276                IsEmpty]: Start isEmpty. Operand 2139 states and 3152 transitions.
[2025-03-03 16:40:13,751 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1188
[2025-03-03 16:40:13,751 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:40:13,752 INFO  L218           NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:40:13,752 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2025-03-03 16:40:13,752 INFO  L396      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:40:13,753 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:40:13,753 INFO  L85        PathProgramCache]: Analyzing trace with hash -1416202546, now seen corresponding path program 1 times
[2025-03-03 16:40:13,753 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:40:13,753 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283974527]
[2025-03-03 16:40:13,753 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:40:13,753 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:40:13,947 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1187 statements into 1 equivalence classes.
[2025-03-03 16:40:14,771 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1187 of 1187 statements.
[2025-03-03 16:40:14,772 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:40:14,772 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:40:16,096 INFO  L134       CoverageAnalysis]: Checked inductivity of 1640 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2025-03-03 16:40:16,096 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:40:16,096 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283974527]
[2025-03-03 16:40:16,096 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283974527] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:40:16,096 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:40:16,096 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 16:40:16,096 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843848465]
[2025-03-03 16:40:16,097 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:40:16,097 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 16:40:16,097 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:40:16,098 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 16:40:16,098 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 16:40:16,099 INFO  L87              Difference]: Start difference. First operand 2139 states and 3152 transitions. Second operand  has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26)
[2025-03-03 16:40:16,585 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:40:16,586 INFO  L93              Difference]: Finished difference Result 3343 states and 4928 transitions.
[2025-03-03 16:40:16,586 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 16:40:16,586 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 1187
[2025-03-03 16:40:16,586 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:40:16,589 INFO  L225             Difference]: With dead ends: 3343
[2025-03-03 16:40:16,589 INFO  L226             Difference]: Without dead ends: 2139
[2025-03-03 16:40:16,590 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 16:40:16,590 INFO  L435           NwaCegarLoop]: 1663 mSDtfsCounter, 1847 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1860 SdHoareTripleChecker+Valid, 3345 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 16:40:16,590 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1860 Valid, 3345 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 16:40:16,591 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2139 states.
[2025-03-03 16:40:16,606 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2139.
[2025-03-03 16:40:16,607 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2139 states, 2107 states have (on average 1.467014712861889) internal successors, (3091), 2107 states have internal predecessors, (3091), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30)
[2025-03-03 16:40:16,608 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 3151 transitions.
[2025-03-03 16:40:16,609 INFO  L78                 Accepts]: Start accepts. Automaton has 2139 states and 3151 transitions. Word has length 1187
[2025-03-03 16:40:16,609 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:40:16,609 INFO  L471      AbstractCegarLoop]: Abstraction has 2139 states and 3151 transitions.
[2025-03-03 16:40:16,609 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26)
[2025-03-03 16:40:16,609 INFO  L276                IsEmpty]: Start isEmpty. Operand 2139 states and 3151 transitions.
[2025-03-03 16:40:16,616 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1189
[2025-03-03 16:40:16,616 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:40:16,617 INFO  L218           NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:40:16,617 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2025-03-03 16:40:16,617 INFO  L396      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:40:16,617 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:40:16,618 INFO  L85        PathProgramCache]: Analyzing trace with hash 936259719, now seen corresponding path program 1 times
[2025-03-03 16:40:16,618 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:40:16,618 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828055464]
[2025-03-03 16:40:16,618 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:40:16,618 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:40:16,760 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1188 statements into 1 equivalence classes.
[2025-03-03 16:40:17,196 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1188 of 1188 statements.
[2025-03-03 16:40:17,196 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:40:17,196 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:40:18,442 INFO  L134       CoverageAnalysis]: Checked inductivity of 1640 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2025-03-03 16:40:18,443 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:40:18,443 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828055464]
[2025-03-03 16:40:18,443 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828055464] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:40:18,443 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:40:18,443 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 16:40:18,443 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385828028]
[2025-03-03 16:40:18,443 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:40:18,444 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 16:40:18,444 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:40:18,445 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 16:40:18,445 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 16:40:18,445 INFO  L87              Difference]: Start difference. First operand 2139 states and 3151 transitions. Second operand  has 5 states, 5 states have (on average 212.2) internal successors, (1061), 5 states have internal predecessors, (1061), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26)
[2025-03-03 16:40:18,913 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:40:18,913 INFO  L93              Difference]: Finished difference Result 3343 states and 4926 transitions.
[2025-03-03 16:40:18,913 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 16:40:18,914 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 212.2) internal successors, (1061), 5 states have internal predecessors, (1061), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 1188
[2025-03-03 16:40:18,914 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:40:18,917 INFO  L225             Difference]: With dead ends: 3343
[2025-03-03 16:40:18,917 INFO  L226             Difference]: Without dead ends: 2139
[2025-03-03 16:40:18,918 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 16:40:18,919 INFO  L435           NwaCegarLoop]: 1663 mSDtfsCounter, 3422 mSDsluCounter, 1665 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3435 SdHoareTripleChecker+Valid, 3328 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 16:40:18,919 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3435 Valid, 3328 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 16:40:18,921 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2139 states.
[2025-03-03 16:40:18,946 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2139.
[2025-03-03 16:40:18,948 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2139 states, 2107 states have (on average 1.4665401044138586) internal successors, (3090), 2107 states have internal predecessors, (3090), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30)
[2025-03-03 16:40:18,950 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 3150 transitions.
[2025-03-03 16:40:18,951 INFO  L78                 Accepts]: Start accepts. Automaton has 2139 states and 3150 transitions. Word has length 1188
[2025-03-03 16:40:18,951 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:40:18,951 INFO  L471      AbstractCegarLoop]: Abstraction has 2139 states and 3150 transitions.
[2025-03-03 16:40:18,952 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 212.2) internal successors, (1061), 5 states have internal predecessors, (1061), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26)
[2025-03-03 16:40:18,952 INFO  L276                IsEmpty]: Start isEmpty. Operand 2139 states and 3150 transitions.
[2025-03-03 16:40:18,966 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1190
[2025-03-03 16:40:18,967 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:40:18,967 INFO  L218           NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:40:18,967 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2025-03-03 16:40:18,967 INFO  L396      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:40:18,968 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:40:18,968 INFO  L85        PathProgramCache]: Analyzing trace with hash -852984131, now seen corresponding path program 1 times
[2025-03-03 16:40:18,968 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:40:18,968 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090062834]
[2025-03-03 16:40:18,968 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:40:18,969 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:40:19,174 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1189 statements into 1 equivalence classes.
[2025-03-03 16:40:19,611 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1189 of 1189 statements.
[2025-03-03 16:40:19,611 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:40:19,611 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:40:20,831 INFO  L134       CoverageAnalysis]: Checked inductivity of 1640 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2025-03-03 16:40:20,831 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:40:20,831 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090062834]
[2025-03-03 16:40:20,831 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090062834] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:40:20,831 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:40:20,831 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 16:40:20,831 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610181778]
[2025-03-03 16:40:20,831 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:40:20,832 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 16:40:20,832 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:40:20,833 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 16:40:20,833 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 16:40:20,833 INFO  L87              Difference]: Start difference. First operand 2139 states and 3150 transitions. Second operand  has 5 states, 5 states have (on average 212.4) internal successors, (1062), 5 states have internal predecessors, (1062), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26)
[2025-03-03 16:40:21,563 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:40:21,563 INFO  L93              Difference]: Finished difference Result 3343 states and 4924 transitions.
[2025-03-03 16:40:21,564 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 16:40:21,564 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 212.4) internal successors, (1062), 5 states have internal predecessors, (1062), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 1189
[2025-03-03 16:40:21,564 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:40:21,566 INFO  L225             Difference]: With dead ends: 3343
[2025-03-03 16:40:21,566 INFO  L226             Difference]: Without dead ends: 2139
[2025-03-03 16:40:21,567 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 16:40:21,567 INFO  L435           NwaCegarLoop]: 1289 mSDtfsCounter, 1724 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 1602 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1728 SdHoareTripleChecker+Valid, 2597 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 16:40:21,568 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1728 Valid, 2597 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1602 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 16:40:21,569 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2139 states.
[2025-03-03 16:40:21,584 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2139.
[2025-03-03 16:40:21,585 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2139 states, 2107 states have (on average 1.4660654959658281) internal successors, (3089), 2107 states have internal predecessors, (3089), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30)
[2025-03-03 16:40:21,587 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 3149 transitions.
[2025-03-03 16:40:21,587 INFO  L78                 Accepts]: Start accepts. Automaton has 2139 states and 3149 transitions. Word has length 1189
[2025-03-03 16:40:21,588 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:40:21,588 INFO  L471      AbstractCegarLoop]: Abstraction has 2139 states and 3149 transitions.
[2025-03-03 16:40:21,588 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 212.4) internal successors, (1062), 5 states have internal predecessors, (1062), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26)
[2025-03-03 16:40:21,588 INFO  L276                IsEmpty]: Start isEmpty. Operand 2139 states and 3149 transitions.
[2025-03-03 16:40:21,595 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1191
[2025-03-03 16:40:21,596 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:40:21,596 INFO  L218           NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:40:21,596 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2025-03-03 16:40:21,596 INFO  L396      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:40:21,597 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:40:21,597 INFO  L85        PathProgramCache]: Analyzing trace with hash 2065125206, now seen corresponding path program 1 times
[2025-03-03 16:40:21,597 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:40:21,597 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890657668]
[2025-03-03 16:40:21,597 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:40:21,597 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:40:21,762 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1190 statements into 1 equivalence classes.
[2025-03-03 16:40:22,207 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1190 of 1190 statements.
[2025-03-03 16:40:22,207 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:40:22,207 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:40:23,316 INFO  L134       CoverageAnalysis]: Checked inductivity of 1640 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2025-03-03 16:40:23,316 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:40:23,316 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890657668]
[2025-03-03 16:40:23,317 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890657668] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:40:23,317 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:40:23,317 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 16:40:23,317 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299682448]
[2025-03-03 16:40:23,317 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:40:23,317 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 16:40:23,317 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:40:23,318 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 16:40:23,318 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 16:40:23,318 INFO  L87              Difference]: Start difference. First operand 2139 states and 3149 transitions. Second operand  has 5 states, 5 states have (on average 212.6) internal successors, (1063), 5 states have internal predecessors, (1063), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26)
[2025-03-03 16:40:23,744 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:40:23,744 INFO  L93              Difference]: Finished difference Result 3343 states and 4922 transitions.
[2025-03-03 16:40:23,744 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 16:40:23,745 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 212.6) internal successors, (1063), 5 states have internal predecessors, (1063), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 1190
[2025-03-03 16:40:23,745 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:40:23,747 INFO  L225             Difference]: With dead ends: 3343
[2025-03-03 16:40:23,747 INFO  L226             Difference]: Without dead ends: 2139
[2025-03-03 16:40:23,748 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 16:40:23,748 INFO  L435           NwaCegarLoop]: 1662 mSDtfsCounter, 1789 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1802 SdHoareTripleChecker+Valid, 3343 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 16:40:23,748 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1802 Valid, 3343 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 16:40:23,751 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2139 states.
[2025-03-03 16:40:23,767 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2139.
[2025-03-03 16:40:23,768 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2139 states, 2107 states have (on average 1.4655908875177979) internal successors, (3088), 2107 states have internal predecessors, (3088), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30)
[2025-03-03 16:40:23,770 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 3148 transitions.
[2025-03-03 16:40:23,770 INFO  L78                 Accepts]: Start accepts. Automaton has 2139 states and 3148 transitions. Word has length 1190
[2025-03-03 16:40:23,771 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:40:23,771 INFO  L471      AbstractCegarLoop]: Abstraction has 2139 states and 3148 transitions.
[2025-03-03 16:40:23,771 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 212.6) internal successors, (1063), 5 states have internal predecessors, (1063), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26)
[2025-03-03 16:40:23,771 INFO  L276                IsEmpty]: Start isEmpty. Operand 2139 states and 3148 transitions.
[2025-03-03 16:40:23,779 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1192
[2025-03-03 16:40:23,779 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:40:23,779 INFO  L218           NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:40:23,780 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2025-03-03 16:40:23,780 INFO  L396      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:40:23,780 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:40:23,780 INFO  L85        PathProgramCache]: Analyzing trace with hash 2061875649, now seen corresponding path program 1 times
[2025-03-03 16:40:23,781 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:40:23,781 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42895282]
[2025-03-03 16:40:23,781 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:40:23,781 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:40:23,952 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1191 statements into 1 equivalence classes.
[2025-03-03 16:40:24,346 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1191 of 1191 statements.
[2025-03-03 16:40:24,347 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:40:24,347 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:40:25,519 INFO  L134       CoverageAnalysis]: Checked inductivity of 1640 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2025-03-03 16:40:25,520 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:40:25,520 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42895282]
[2025-03-03 16:40:25,520 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42895282] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:40:25,520 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:40:25,520 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 16:40:25,520 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591331655]
[2025-03-03 16:40:25,520 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:40:25,520 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 16:40:25,520 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:40:25,521 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 16:40:25,521 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 16:40:25,521 INFO  L87              Difference]: Start difference. First operand 2139 states and 3148 transitions. Second operand  has 5 states, 5 states have (on average 212.8) internal successors, (1064), 5 states have internal predecessors, (1064), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26)
[2025-03-03 16:40:25,949 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:40:25,949 INFO  L93              Difference]: Finished difference Result 3343 states and 4920 transitions.
[2025-03-03 16:40:25,949 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 16:40:25,950 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 212.8) internal successors, (1064), 5 states have internal predecessors, (1064), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 1191
[2025-03-03 16:40:25,950 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:40:25,952 INFO  L225             Difference]: With dead ends: 3343
[2025-03-03 16:40:25,952 INFO  L226             Difference]: Without dead ends: 2139
[2025-03-03 16:40:25,953 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 16:40:25,953 INFO  L435           NwaCegarLoop]: 1662 mSDtfsCounter, 3306 mSDsluCounter, 1664 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3319 SdHoareTripleChecker+Valid, 3326 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 16:40:25,953 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3319 Valid, 3326 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 16:40:25,955 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2139 states.
[2025-03-03 16:40:25,970 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2139.
[2025-03-03 16:40:25,972 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2139 states, 2107 states have (on average 1.4651162790697674) internal successors, (3087), 2107 states have internal predecessors, (3087), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30)
[2025-03-03 16:40:25,973 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 3147 transitions.
[2025-03-03 16:40:25,974 INFO  L78                 Accepts]: Start accepts. Automaton has 2139 states and 3147 transitions. Word has length 1191
[2025-03-03 16:40:25,974 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:40:25,974 INFO  L471      AbstractCegarLoop]: Abstraction has 2139 states and 3147 transitions.
[2025-03-03 16:40:25,974 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 212.8) internal successors, (1064), 5 states have internal predecessors, (1064), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26)
[2025-03-03 16:40:25,975 INFO  L276                IsEmpty]: Start isEmpty. Operand 2139 states and 3147 transitions.
[2025-03-03 16:40:25,982 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1193
[2025-03-03 16:40:25,982 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:40:25,982 INFO  L218           NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:40:25,983 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2025-03-03 16:40:25,983 INFO  L396      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:40:25,983 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:40:25,983 INFO  L85        PathProgramCache]: Analyzing trace with hash -923556091, now seen corresponding path program 1 times
[2025-03-03 16:40:25,983 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:40:25,983 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106892406]
[2025-03-03 16:40:25,984 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:40:25,984 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:40:26,133 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1192 statements into 1 equivalence classes.
[2025-03-03 16:40:26,543 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1192 of 1192 statements.
[2025-03-03 16:40:26,543 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:40:26,543 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 16:40:28,061 INFO  L134       CoverageAnalysis]: Checked inductivity of 1640 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2025-03-03 16:40:28,061 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 16:40:28,061 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106892406]
[2025-03-03 16:40:28,062 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106892406] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 16:40:28,062 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 16:40:28,062 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 16:40:28,062 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553417388]
[2025-03-03 16:40:28,062 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 16:40:28,062 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 16:40:28,062 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 16:40:28,063 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 16:40:28,063 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 16:40:28,063 INFO  L87              Difference]: Start difference. First operand 2139 states and 3147 transitions. Second operand  has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26)
[2025-03-03 16:40:28,804 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 16:40:28,804 INFO  L93              Difference]: Finished difference Result 3343 states and 4918 transitions.
[2025-03-03 16:40:28,804 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 16:40:28,804 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 1192
[2025-03-03 16:40:28,805 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 16:40:28,807 INFO  L225             Difference]: With dead ends: 3343
[2025-03-03 16:40:28,807 INFO  L226             Difference]: Without dead ends: 2139
[2025-03-03 16:40:28,808 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 16:40:28,808 INFO  L435           NwaCegarLoop]: 1287 mSDtfsCounter, 1666 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1670 SdHoareTripleChecker+Valid, 2593 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 16:40:28,808 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1670 Valid, 2593 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 16:40:28,809 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2139 states.
[2025-03-03 16:40:28,825 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2139.
[2025-03-03 16:40:28,827 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2139 states, 2107 states have (on average 1.4646416706217371) internal successors, (3086), 2107 states have internal predecessors, (3086), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30)
[2025-03-03 16:40:28,828 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 3146 transitions.
[2025-03-03 16:40:28,829 INFO  L78                 Accepts]: Start accepts. Automaton has 2139 states and 3146 transitions. Word has length 1192
[2025-03-03 16:40:28,830 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 16:40:28,830 INFO  L471      AbstractCegarLoop]: Abstraction has 2139 states and 3146 transitions.
[2025-03-03 16:40:28,830 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26)
[2025-03-03 16:40:28,830 INFO  L276                IsEmpty]: Start isEmpty. Operand 2139 states and 3146 transitions.
[2025-03-03 16:40:28,841 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1194
[2025-03-03 16:40:28,841 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 16:40:28,842 INFO  L218           NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 16:40:28,842 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2025-03-03 16:40:28,842 INFO  L396      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 16:40:28,842 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 16:40:28,843 INFO  L85        PathProgramCache]: Analyzing trace with hash -501214256, now seen corresponding path program 1 times
[2025-03-03 16:40:28,843 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 16:40:28,843 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640739089]
[2025-03-03 16:40:28,843 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 16:40:28,843 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 16:40:29,000 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1193 statements into 1 equivalence classes.
[2025-03-03 16:40:29,395 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1193 of 1193 statements.
[2025-03-03 16:40:29,395 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 16:40:29,395 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat