./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/mem_slave_tlm.4.cil.c --full-output --architecture 32bit


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


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/systemc/mem_slave_tlm.4.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 69030034dd333d91bcd0f7615fd4a158a32a8c2c03a6334daabdaad4c77a89b5
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 14:42:59,168 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 14:42:59,230 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-03 14:42:59,235 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 14:42:59,237 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 14:42:59,258 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 14:42:59,260 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 14:42:59,260 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 14:42:59,260 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 14:42:59,261 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 14:42:59,261 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 14:42:59,261 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 14:42:59,262 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 14:42:59,262 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 14:42:59,262 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 14:42:59,263 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 14:42:59,263 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 14:42:59,263 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 14:42:59,263 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 14:42:59,263 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 14:42:59,263 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 14:42:59,263 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 14:42:59,263 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 14:42:59,263 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 14:42:59,263 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 14:42:59,263 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 14:42:59,263 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 14:42:59,263 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 14:42:59,264 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 14:42:59,264 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 14:42:59,264 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 14:42:59,264 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 14:42:59,264 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 14:42:59,264 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 14:42:59,264 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 14:42:59,264 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 14:42:59,265 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 14:42:59,265 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 14:42:59,265 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 14:42:59,265 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 14:42:59,265 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 14:42:59,265 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 14:42:59,265 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 14:42:59,265 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 -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 69030034dd333d91bcd0f7615fd4a158a32a8c2c03a6334daabdaad4c77a89b5
[2025-03-03 14:42:59,511 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 14:42:59,519 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 14:42:59,520 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 14:42:59,522 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 14:42:59,522 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 14:42:59,523 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/mem_slave_tlm.4.cil.c
[2025-03-03 14:43:00,658 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd4a39e8/06b7c9d95cf04f8b8f8e562a5e38f83e/FLAGce31d331f
[2025-03-03 14:43:00,933 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 14:43:00,934 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.4.cil.c
[2025-03-03 14:43:00,947 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd4a39e8/06b7c9d95cf04f8b8f8e562a5e38f83e/FLAGce31d331f
[2025-03-03 14:43:01,217 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd4a39e8/06b7c9d95cf04f8b8f8e562a5e38f83e
[2025-03-03 14:43:01,219 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 14:43:01,220 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 14:43:01,221 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 14:43:01,221 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 14:43:01,223 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 14:43:01,224 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:43:01" (1/1) ...
[2025-03-03 14:43:01,224 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f3466a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:01, skipping insertion in model container
[2025-03-03 14:43:01,225 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:43:01" (1/1) ...
[2025-03-03 14:43:01,247 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 14:43:01,346 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/systemc/mem_slave_tlm.4.cil.c[646,659]
[2025-03-03 14:43:01,445 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 14:43:01,455 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 14:43:01,463 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/systemc/mem_slave_tlm.4.cil.c[646,659]
[2025-03-03 14:43:01,516 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 14:43:01,530 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 14:43:01,530 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:01 WrapperNode
[2025-03-03 14:43:01,530 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 14:43:01,531 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 14:43:01,531 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 14:43:01,531 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 14:43:01,535 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:01" (1/1) ...
[2025-03-03 14:43:01,543 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:01" (1/1) ...
[2025-03-03 14:43:01,568 INFO  L138                Inliner]: procedures = 19, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 823
[2025-03-03 14:43:01,569 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 14:43:01,569 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 14:43:01,569 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 14:43:01,569 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 14:43:01,579 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:01" (1/1) ...
[2025-03-03 14:43:01,579 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:01" (1/1) ...
[2025-03-03 14:43:01,581 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:01" (1/1) ...
[2025-03-03 14:43:01,598 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 14:43:01,598 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:01" (1/1) ...
[2025-03-03 14:43:01,598 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:01" (1/1) ...
[2025-03-03 14:43:01,603 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:01" (1/1) ...
[2025-03-03 14:43:01,604 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:01" (1/1) ...
[2025-03-03 14:43:01,605 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:01" (1/1) ...
[2025-03-03 14:43:01,606 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:01" (1/1) ...
[2025-03-03 14:43:01,611 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 14:43:01,612 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 14:43:01,612 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 14:43:01,612 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 14:43:01,613 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:01" (1/1) ...
[2025-03-03 14:43:01,617 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 14:43:01,626 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 14:43:01,638 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 14:43:01,640 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 14:43:01,657 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 14:43:01,658 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 14:43:01,658 INFO  L130     BoogieDeclarations]: Found specification of procedure error
[2025-03-03 14:43:01,658 INFO  L138     BoogieDeclarations]: Found implementation of procedure error
[2025-03-03 14:43:01,658 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 14:43:01,658 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 14:43:01,722 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 14:43:01,723 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 14:43:02,286 INFO  L?                        ?]: Removed 93 outVars from TransFormulas that were not future-live.
[2025-03-03 14:43:02,287 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 14:43:02,298 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 14:43:02,298 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 14:43:02,298 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:43:02 BoogieIcfgContainer
[2025-03-03 14:43:02,298 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 14:43:02,300 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 14:43:02,300 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 14:43:02,303 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 14:43:02,303 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:43:01" (1/3) ...
[2025-03-03 14:43:02,303 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674200f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:43:02, skipping insertion in model container
[2025-03-03 14:43:02,303 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:43:01" (2/3) ...
[2025-03-03 14:43:02,304 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674200f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:43:02, skipping insertion in model container
[2025-03-03 14:43:02,304 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:43:02" (3/3) ...
[2025-03-03 14:43:02,305 INFO  L128   eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.4.cil.c
[2025-03-03 14:43:02,314 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 14:43:02,317 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG mem_slave_tlm.4.cil.c that has 2 procedures, 269 locations, 1 initial locations, 13 loop locations, and 1 error locations.
[2025-03-03 14:43:02,356 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 14:43:02,363 INFO  L333      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5ac91320, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 14:43:02,364 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 14:43:02,367 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 269 states, 261 states have (on average 1.8314176245210727) internal successors, (478), 267 states have internal predecessors, (478), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2025-03-03 14:43:02,373 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-03-03 14:43:02,373 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:02,373 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:43:02,374 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:02,377 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:02,377 INFO  L85        PathProgramCache]: Analyzing trace with hash 883278571, now seen corresponding path program 1 times
[2025-03-03 14:43:02,382 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:02,383 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147174071]
[2025-03-03 14:43:02,383 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:02,383 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:02,437 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-03-03 14:43:02,461 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-03-03 14:43:02,462 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:02,462 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:02,589 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:43:02,590 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:02,590 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147174071]
[2025-03-03 14:43:02,590 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147174071] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:43:02,591 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:43:02,591 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:43:02,592 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302611104]
[2025-03-03 14:43:02,592 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:43:02,594 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:43:02,595 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:02,606 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:43:02,607 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:43:02,609 INFO  L87              Difference]: Start difference. First operand  has 269 states, 261 states have (on average 1.8314176245210727) internal successors, (478), 267 states have internal predecessors, (478), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand  has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:02,921 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:02,922 INFO  L93              Difference]: Finished difference Result 706 states and 1278 transitions.
[2025-03-03 14:43:02,922 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:43:02,923 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29
[2025-03-03 14:43:02,923 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:02,930 INFO  L225             Difference]: With dead ends: 706
[2025-03-03 14:43:02,931 INFO  L226             Difference]: Without dead ends: 434
[2025-03-03 14:43:02,934 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:43:02,936 INFO  L435           NwaCegarLoop]: 470 mSDtfsCounter, 259 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:02,936 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 772 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 14:43:02,947 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 434 states.
[2025-03-03 14:43:02,979 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 427.
[2025-03-03 14:43:02,980 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 427 states, 421 states have (on average 1.6152019002375297) internal successors, (680), 425 states have internal predecessors, (680), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:02,983 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 685 transitions.
[2025-03-03 14:43:02,984 INFO  L78                 Accepts]: Start accepts. Automaton has 427 states and 685 transitions. Word has length 29
[2025-03-03 14:43:02,984 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:02,984 INFO  L471      AbstractCegarLoop]: Abstraction has 427 states and 685 transitions.
[2025-03-03 14:43:02,984 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:02,984 INFO  L276                IsEmpty]: Start isEmpty. Operand 427 states and 685 transitions.
[2025-03-03 14:43:02,986 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2025-03-03 14:43:02,986 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:02,986 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:43:02,986 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 14:43:02,986 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:02,987 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:02,987 INFO  L85        PathProgramCache]: Analyzing trace with hash 1749448521, now seen corresponding path program 1 times
[2025-03-03 14:43:02,987 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:02,987 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194276827]
[2025-03-03 14:43:02,987 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:02,987 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:02,996 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes.
[2025-03-03 14:43:03,008 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements.
[2025-03-03 14:43:03,008 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:03,008 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:03,041 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:43:03,042 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:03,042 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194276827]
[2025-03-03 14:43:03,042 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194276827] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:43:03,042 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:43:03,042 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:43:03,042 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145700296]
[2025-03-03 14:43:03,042 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:43:03,047 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:43:03,047 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:03,047 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:43:03,048 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:43:03,048 INFO  L87              Difference]: Start difference. First operand 427 states and 685 transitions. Second operand  has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:03,171 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:03,171 INFO  L93              Difference]: Finished difference Result 1121 states and 1825 transitions.
[2025-03-03 14:43:03,171 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:43:03,172 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42
[2025-03-03 14:43:03,172 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:03,176 INFO  L225             Difference]: With dead ends: 1121
[2025-03-03 14:43:03,176 INFO  L226             Difference]: Without dead ends: 708
[2025-03-03 14:43:03,178 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:43:03,180 INFO  L435           NwaCegarLoop]: 634 mSDtfsCounter, 322 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:03,180 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1008 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:43:03,181 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 708 states.
[2025-03-03 14:43:03,210 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 701.
[2025-03-03 14:43:03,213 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 701 states, 695 states have (on average 1.646043165467626) internal successors, (1144), 699 states have internal predecessors, (1144), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:03,216 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1149 transitions.
[2025-03-03 14:43:03,217 INFO  L78                 Accepts]: Start accepts. Automaton has 701 states and 1149 transitions. Word has length 42
[2025-03-03 14:43:03,217 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:03,217 INFO  L471      AbstractCegarLoop]: Abstraction has 701 states and 1149 transitions.
[2025-03-03 14:43:03,217 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:03,218 INFO  L276                IsEmpty]: Start isEmpty. Operand 701 states and 1149 transitions.
[2025-03-03 14:43:03,219 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2025-03-03 14:43:03,219 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:03,219 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:43:03,219 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 14:43:03,220 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:03,220 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:03,220 INFO  L85        PathProgramCache]: Analyzing trace with hash 81718369, now seen corresponding path program 1 times
[2025-03-03 14:43:03,220 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:03,220 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430686460]
[2025-03-03 14:43:03,220 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:03,220 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:03,230 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes.
[2025-03-03 14:43:03,243 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements.
[2025-03-03 14:43:03,243 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:03,243 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:03,292 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:43:03,293 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:03,293 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430686460]
[2025-03-03 14:43:03,293 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430686460] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:43:03,293 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:43:03,293 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:43:03,293 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001750121]
[2025-03-03 14:43:03,293 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:43:03,294 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:43:03,294 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:03,295 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:43:03,297 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:43:03,297 INFO  L87              Difference]: Start difference. First operand 701 states and 1149 transitions. Second operand  has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:03,336 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:03,337 INFO  L93              Difference]: Finished difference Result 1763 states and 2886 transitions.
[2025-03-03 14:43:03,337 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:43:03,337 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43
[2025-03-03 14:43:03,337 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:03,341 INFO  L225             Difference]: With dead ends: 1763
[2025-03-03 14:43:03,341 INFO  L226             Difference]: Without dead ends: 1087
[2025-03-03 14:43:03,342 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:43:03,343 INFO  L435           NwaCegarLoop]: 443 mSDtfsCounter, 349 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:03,343 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 802 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:43:03,344 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1087 states.
[2025-03-03 14:43:03,362 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1076.
[2025-03-03 14:43:03,367 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1076 states, 1070 states have (on average 1.6336448598130842) internal successors, (1748), 1074 states have internal predecessors, (1748), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:03,374 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1753 transitions.
[2025-03-03 14:43:03,375 INFO  L78                 Accepts]: Start accepts. Automaton has 1076 states and 1753 transitions. Word has length 43
[2025-03-03 14:43:03,375 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:03,375 INFO  L471      AbstractCegarLoop]: Abstraction has 1076 states and 1753 transitions.
[2025-03-03 14:43:03,375 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:03,375 INFO  L276                IsEmpty]: Start isEmpty. Operand 1076 states and 1753 transitions.
[2025-03-03 14:43:03,376 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 47
[2025-03-03 14:43:03,376 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:03,376 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-03 14:43:03,376 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 14:43:03,376 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:03,377 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:03,377 INFO  L85        PathProgramCache]: Analyzing trace with hash 372959812, now seen corresponding path program 1 times
[2025-03-03 14:43:03,377 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:03,377 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533362871]
[2025-03-03 14:43:03,377 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:03,377 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:03,387 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes.
[2025-03-03 14:43:03,397 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements.
[2025-03-03 14:43:03,397 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:03,397 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:03,477 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:43:03,477 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:03,478 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533362871]
[2025-03-03 14:43:03,478 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533362871] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:43:03,478 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:43:03,478 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 14:43:03,478 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044253105]
[2025-03-03 14:43:03,478 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:43:03,478 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 14:43:03,478 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:03,478 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 14:43:03,478 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 14:43:03,478 INFO  L87              Difference]: Start difference. First operand 1076 states and 1753 transitions. Second operand  has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:03,911 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:03,911 INFO  L93              Difference]: Finished difference Result 3861 states and 6283 transitions.
[2025-03-03 14:43:03,912 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 14:43:03,912 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46
[2025-03-03 14:43:03,912 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:03,923 INFO  L225             Difference]: With dead ends: 3861
[2025-03-03 14:43:03,923 INFO  L226             Difference]: Without dead ends: 2810
[2025-03-03 14:43:03,925 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 14:43:03,927 INFO  L435           NwaCegarLoop]: 662 mSDtfsCounter, 1159 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1159 SdHoareTripleChecker+Valid, 1624 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:03,928 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1159 Valid, 1624 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 14:43:03,931 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2810 states.
[2025-03-03 14:43:03,994 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 2290.
[2025-03-03 14:43:03,997 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2290 states, 2284 states have (on average 1.6199649737302977) internal successors, (3700), 2288 states have internal predecessors, (3700), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:04,005 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 3705 transitions.
[2025-03-03 14:43:04,006 INFO  L78                 Accepts]: Start accepts. Automaton has 2290 states and 3705 transitions. Word has length 46
[2025-03-03 14:43:04,007 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:04,007 INFO  L471      AbstractCegarLoop]: Abstraction has 2290 states and 3705 transitions.
[2025-03-03 14:43:04,007 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:04,007 INFO  L276                IsEmpty]: Start isEmpty. Operand 2290 states and 3705 transitions.
[2025-03-03 14:43:04,008 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2025-03-03 14:43:04,008 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:04,008 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:43:04,008 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 14:43:04,008 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:04,009 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:04,009 INFO  L85        PathProgramCache]: Analyzing trace with hash -1640250428, now seen corresponding path program 1 times
[2025-03-03 14:43:04,009 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:04,009 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958026815]
[2025-03-03 14:43:04,009 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:04,009 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:04,015 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes.
[2025-03-03 14:43:04,021 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements.
[2025-03-03 14:43:04,021 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:04,021 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:04,081 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:43:04,081 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:04,081 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958026815]
[2025-03-03 14:43:04,081 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958026815] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:43:04,081 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:43:04,081 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 14:43:04,082 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63283295]
[2025-03-03 14:43:04,082 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:43:04,082 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 14:43:04,082 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:04,082 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 14:43:04,082 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 14:43:04,083 INFO  L87              Difference]: Start difference. First operand 2290 states and 3705 transitions. Second operand  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:04,441 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:04,442 INFO  L93              Difference]: Finished difference Result 6653 states and 10678 transitions.
[2025-03-03 14:43:04,442 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 14:43:04,442 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52
[2025-03-03 14:43:04,443 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:04,456 INFO  L225             Difference]: With dead ends: 6653
[2025-03-03 14:43:04,456 INFO  L226             Difference]: Without dead ends: 4382
[2025-03-03 14:43:04,461 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 14:43:04,461 INFO  L435           NwaCegarLoop]: 385 mSDtfsCounter, 740 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:04,462 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 996 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 14:43:04,465 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4382 states.
[2025-03-03 14:43:04,562 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4382 to 3994.
[2025-03-03 14:43:04,567 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3994 states, 3988 states have (on average 1.5970411233701103) internal successors, (6369), 3992 states have internal predecessors, (6369), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:04,581 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3994 states to 3994 states and 6374 transitions.
[2025-03-03 14:43:04,582 INFO  L78                 Accepts]: Start accepts. Automaton has 3994 states and 6374 transitions. Word has length 52
[2025-03-03 14:43:04,582 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:04,583 INFO  L471      AbstractCegarLoop]: Abstraction has 3994 states and 6374 transitions.
[2025-03-03 14:43:04,583 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:04,583 INFO  L276                IsEmpty]: Start isEmpty. Operand 3994 states and 6374 transitions.
[2025-03-03 14:43:04,584 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2025-03-03 14:43:04,584 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:04,584 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:43:04,584 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 14:43:04,584 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:04,584 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:04,585 INFO  L85        PathProgramCache]: Analyzing trace with hash 1221738382, now seen corresponding path program 1 times
[2025-03-03 14:43:04,585 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:04,585 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820591813]
[2025-03-03 14:43:04,585 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:04,585 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:04,591 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes.
[2025-03-03 14:43:04,595 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements.
[2025-03-03 14:43:04,595 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:04,596 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:04,627 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:43:04,627 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:04,627 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820591813]
[2025-03-03 14:43:04,628 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820591813] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:43:04,628 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:43:04,628 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:43:04,628 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389457866]
[2025-03-03 14:43:04,628 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:43:04,628 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:43:04,628 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:04,629 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:43:04,629 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:43:04,629 INFO  L87              Difference]: Start difference. First operand 3994 states and 6374 transitions. Second operand  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:04,769 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:04,770 INFO  L93              Difference]: Finished difference Result 9535 states and 15155 transitions.
[2025-03-03 14:43:04,771 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:43:04,771 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52
[2025-03-03 14:43:04,772 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:04,788 INFO  L225             Difference]: With dead ends: 9535
[2025-03-03 14:43:04,788 INFO  L226             Difference]: Without dead ends: 5564
[2025-03-03 14:43:04,792 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:43:04,793 INFO  L435           NwaCegarLoop]: 440 mSDtfsCounter, 366 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:04,793 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 708 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:43:04,797 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5564 states.
[2025-03-03 14:43:04,889 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5564 to 5280.
[2025-03-03 14:43:04,897 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5280 states, 5274 states have (on average 1.574706105422829) internal successors, (8305), 5278 states have internal predecessors, (8305), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:04,912 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5280 states to 5280 states and 8310 transitions.
[2025-03-03 14:43:04,913 INFO  L78                 Accepts]: Start accepts. Automaton has 5280 states and 8310 transitions. Word has length 52
[2025-03-03 14:43:04,913 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:04,913 INFO  L471      AbstractCegarLoop]: Abstraction has 5280 states and 8310 transitions.
[2025-03-03 14:43:04,913 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:04,914 INFO  L276                IsEmpty]: Start isEmpty. Operand 5280 states and 8310 transitions.
[2025-03-03 14:43:04,915 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2025-03-03 14:43:04,915 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:04,915 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:43:04,915 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 14:43:04,916 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:04,916 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:04,916 INFO  L85        PathProgramCache]: Analyzing trace with hash -264311399, now seen corresponding path program 1 times
[2025-03-03 14:43:04,916 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:04,916 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317934612]
[2025-03-03 14:43:04,916 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:04,916 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:04,922 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes.
[2025-03-03 14:43:04,927 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements.
[2025-03-03 14:43:04,927 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:04,927 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:04,977 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:43:04,977 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:04,977 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317934612]
[2025-03-03 14:43:04,977 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317934612] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:43:04,977 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:43:04,978 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:43:04,978 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609616978]
[2025-03-03 14:43:04,978 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:43:04,978 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:43:04,978 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:04,978 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:43:04,978 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:43:04,979 INFO  L87              Difference]: Start difference. First operand 5280 states and 8310 transitions. Second operand  has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:05,268 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:05,268 INFO  L93              Difference]: Finished difference Result 12756 states and 20174 transitions.
[2025-03-03 14:43:05,269 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:43:05,269 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61
[2025-03-03 14:43:05,269 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:05,291 INFO  L225             Difference]: With dead ends: 12756
[2025-03-03 14:43:05,291 INFO  L226             Difference]: Without dead ends: 7499
[2025-03-03 14:43:05,299 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:43:05,300 INFO  L435           NwaCegarLoop]: 579 mSDtfsCounter, 246 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:05,300 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 867 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 14:43:05,307 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7499 states.
[2025-03-03 14:43:05,431 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7499 to 6084.
[2025-03-03 14:43:05,439 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6084 states, 6078 states have (on average 1.5268180322474498) internal successors, (9280), 6082 states have internal predecessors, (9280), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:05,455 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6084 states to 6084 states and 9285 transitions.
[2025-03-03 14:43:05,456 INFO  L78                 Accepts]: Start accepts. Automaton has 6084 states and 9285 transitions. Word has length 61
[2025-03-03 14:43:05,456 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:05,457 INFO  L471      AbstractCegarLoop]: Abstraction has 6084 states and 9285 transitions.
[2025-03-03 14:43:05,457 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:05,457 INFO  L276                IsEmpty]: Start isEmpty. Operand 6084 states and 9285 transitions.
[2025-03-03 14:43:05,459 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2025-03-03 14:43:05,459 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:05,460 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:43:05,460 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 14:43:05,460 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:05,460 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:05,460 INFO  L85        PathProgramCache]: Analyzing trace with hash 722319873, now seen corresponding path program 1 times
[2025-03-03 14:43:05,460 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:05,460 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113965579]
[2025-03-03 14:43:05,460 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:05,461 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:05,469 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes.
[2025-03-03 14:43:05,474 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements.
[2025-03-03 14:43:05,476 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:05,478 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:05,545 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:43:05,546 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:05,546 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113965579]
[2025-03-03 14:43:05,546 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113965579] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:43:05,546 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:43:05,547 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:43:05,547 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697323397]
[2025-03-03 14:43:05,547 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:43:05,547 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:43:05,547 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:05,547 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:43:05,548 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:43:05,548 INFO  L87              Difference]: Start difference. First operand 6084 states and 9285 transitions. Second operand  has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:05,658 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:05,659 INFO  L93              Difference]: Finished difference Result 12011 states and 18347 transitions.
[2025-03-03 14:43:05,659 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:43:05,660 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63
[2025-03-03 14:43:05,660 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:05,686 INFO  L225             Difference]: With dead ends: 12011
[2025-03-03 14:43:05,688 INFO  L226             Difference]: Without dead ends: 5950
[2025-03-03 14:43:05,696 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:43:05,696 INFO  L435           NwaCegarLoop]: 411 mSDtfsCounter, 341 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:05,697 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 439 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:43:05,702 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5950 states.
[2025-03-03 14:43:05,839 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5950 to 5950.
[2025-03-03 14:43:05,848 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5950 states, 5944 states have (on average 1.507907133243607) internal successors, (8963), 5948 states have internal predecessors, (8963), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:05,858 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5950 states to 5950 states and 8968 transitions.
[2025-03-03 14:43:05,860 INFO  L78                 Accepts]: Start accepts. Automaton has 5950 states and 8968 transitions. Word has length 63
[2025-03-03 14:43:05,860 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:05,860 INFO  L471      AbstractCegarLoop]: Abstraction has 5950 states and 8968 transitions.
[2025-03-03 14:43:05,860 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:05,860 INFO  L276                IsEmpty]: Start isEmpty. Operand 5950 states and 8968 transitions.
[2025-03-03 14:43:05,862 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2025-03-03 14:43:05,862 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:05,862 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:43:05,863 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 14:43:05,863 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:05,863 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:05,863 INFO  L85        PathProgramCache]: Analyzing trace with hash -988258195, now seen corresponding path program 1 times
[2025-03-03 14:43:05,863 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:05,863 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68323352]
[2025-03-03 14:43:05,863 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:05,863 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:05,869 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes.
[2025-03-03 14:43:05,871 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements.
[2025-03-03 14:43:05,872 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:05,872 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:05,900 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:43:05,901 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:05,901 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68323352]
[2025-03-03 14:43:05,902 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68323352] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:43:05,902 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:43:05,902 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:43:05,902 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28008119]
[2025-03-03 14:43:05,902 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:43:05,902 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:43:05,902 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:05,903 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:43:05,903 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:43:05,903 INFO  L87              Difference]: Start difference. First operand 5950 states and 8968 transitions. Second operand  has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:05,998 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:05,998 INFO  L93              Difference]: Finished difference Result 11402 states and 17313 transitions.
[2025-03-03 14:43:05,998 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:43:05,999 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64
[2025-03-03 14:43:05,999 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:06,010 INFO  L225             Difference]: With dead ends: 11402
[2025-03-03 14:43:06,011 INFO  L226             Difference]: Without dead ends: 5475
[2025-03-03 14:43:06,018 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:43:06,019 INFO  L435           NwaCegarLoop]: 483 mSDtfsCounter, 145 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:06,019 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 888 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:43:06,024 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5475 states.
[2025-03-03 14:43:06,107 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5475 to 4818.
[2025-03-03 14:43:06,116 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4818 states, 4812 states have (on average 1.5278470490440565) internal successors, (7352), 4816 states have internal predecessors, (7352), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:06,124 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4818 states to 4818 states and 7357 transitions.
[2025-03-03 14:43:06,126 INFO  L78                 Accepts]: Start accepts. Automaton has 4818 states and 7357 transitions. Word has length 64
[2025-03-03 14:43:06,126 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:06,126 INFO  L471      AbstractCegarLoop]: Abstraction has 4818 states and 7357 transitions.
[2025-03-03 14:43:06,127 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:06,127 INFO  L276                IsEmpty]: Start isEmpty. Operand 4818 states and 7357 transitions.
[2025-03-03 14:43:06,128 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2025-03-03 14:43:06,128 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:06,128 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:43:06,128 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-03 14:43:06,128 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:06,128 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:06,129 INFO  L85        PathProgramCache]: Analyzing trace with hash 80965712, now seen corresponding path program 1 times
[2025-03-03 14:43:06,129 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:06,129 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178346584]
[2025-03-03 14:43:06,129 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:06,129 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:06,133 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes.
[2025-03-03 14:43:06,136 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements.
[2025-03-03 14:43:06,136 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:06,136 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:06,205 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:43:06,205 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:06,205 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178346584]
[2025-03-03 14:43:06,205 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178346584] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:43:06,205 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:43:06,205 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 14:43:06,205 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646682316]
[2025-03-03 14:43:06,205 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:43:06,206 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 14:43:06,206 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:06,206 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 14:43:06,206 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 14:43:06,207 INFO  L87              Difference]: Start difference. First operand 4818 states and 7357 transitions. Second operand  has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:06,703 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:06,703 INFO  L93              Difference]: Finished difference Result 13931 states and 21284 transitions.
[2025-03-03 14:43:06,704 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-03-03 14:43:06,704 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66
[2025-03-03 14:43:06,704 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:06,720 INFO  L225             Difference]: With dead ends: 13931
[2025-03-03 14:43:06,720 INFO  L226             Difference]: Without dead ends: 9340
[2025-03-03 14:43:06,728 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2025-03-03 14:43:06,729 INFO  L435           NwaCegarLoop]: 550 mSDtfsCounter, 922 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 2382 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:06,729 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 2382 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 14:43:06,735 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9340 states.
[2025-03-03 14:43:06,849 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9340 to 6458.
[2025-03-03 14:43:06,859 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6458 states, 6452 states have (on average 1.52820830750155) internal successors, (9860), 6456 states have internal predecessors, (9860), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:06,871 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6458 states to 6458 states and 9865 transitions.
[2025-03-03 14:43:06,874 INFO  L78                 Accepts]: Start accepts. Automaton has 6458 states and 9865 transitions. Word has length 66
[2025-03-03 14:43:06,874 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:06,874 INFO  L471      AbstractCegarLoop]: Abstraction has 6458 states and 9865 transitions.
[2025-03-03 14:43:06,875 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:06,875 INFO  L276                IsEmpty]: Start isEmpty. Operand 6458 states and 9865 transitions.
[2025-03-03 14:43:06,876 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2025-03-03 14:43:06,876 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:06,876 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:43:06,876 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 14:43:06,876 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:06,877 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:06,877 INFO  L85        PathProgramCache]: Analyzing trace with hash 176235412, now seen corresponding path program 1 times
[2025-03-03 14:43:06,877 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:06,877 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513615809]
[2025-03-03 14:43:06,877 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:06,877 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:06,882 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes.
[2025-03-03 14:43:06,887 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements.
[2025-03-03 14:43:06,887 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:06,887 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:06,962 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:43:06,962 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:06,962 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513615809]
[2025-03-03 14:43:06,962 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513615809] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:43:06,962 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:43:06,962 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-03 14:43:06,963 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355601099]
[2025-03-03 14:43:06,963 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:43:06,963 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 14:43:06,963 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:06,963 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 14:43:06,964 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-03-03 14:43:06,964 INFO  L87              Difference]: Start difference. First operand 6458 states and 9865 transitions. Second operand  has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:07,205 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:07,206 INFO  L93              Difference]: Finished difference Result 15469 states and 23474 transitions.
[2025-03-03 14:43:07,206 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-03-03 14:43:07,206 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67
[2025-03-03 14:43:07,206 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:07,223 INFO  L225             Difference]: With dead ends: 15469
[2025-03-03 14:43:07,223 INFO  L226             Difference]: Without dead ends: 9238
[2025-03-03 14:43:07,232 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156
[2025-03-03 14:43:07,232 INFO  L435           NwaCegarLoop]: 536 mSDtfsCounter, 806 mSDsluCounter, 2379 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 2915 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:07,233 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 2915 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:43:07,240 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9238 states.
[2025-03-03 14:43:07,359 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9238 to 6814.
[2025-03-03 14:43:07,368 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6814 states, 6808 states have (on average 1.518213866039953) internal successors, (10336), 6812 states have internal predecessors, (10336), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:07,379 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6814 states to 6814 states and 10341 transitions.
[2025-03-03 14:43:07,383 INFO  L78                 Accepts]: Start accepts. Automaton has 6814 states and 10341 transitions. Word has length 67
[2025-03-03 14:43:07,383 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:07,383 INFO  L471      AbstractCegarLoop]: Abstraction has 6814 states and 10341 transitions.
[2025-03-03 14:43:07,384 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:07,384 INFO  L276                IsEmpty]: Start isEmpty. Operand 6814 states and 10341 transitions.
[2025-03-03 14:43:07,386 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2025-03-03 14:43:07,386 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:07,386 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-03 14:43:07,386 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 14:43:07,386 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:07,386 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:07,387 INFO  L85        PathProgramCache]: Analyzing trace with hash 2108994101, now seen corresponding path program 1 times
[2025-03-03 14:43:07,387 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:07,387 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467224669]
[2025-03-03 14:43:07,387 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:07,387 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:07,395 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes.
[2025-03-03 14:43:07,398 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements.
[2025-03-03 14:43:07,399 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:07,399 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:07,424 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:43:07,424 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:07,424 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467224669]
[2025-03-03 14:43:07,424 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467224669] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:43:07,425 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:43:07,425 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:43:07,425 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023897968]
[2025-03-03 14:43:07,425 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:43:07,425 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:43:07,425 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:07,425 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:43:07,426 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:43:07,426 INFO  L87              Difference]: Start difference. First operand 6814 states and 10341 transitions. Second operand  has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:07,596 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:07,596 INFO  L93              Difference]: Finished difference Result 14525 states and 21978 transitions.
[2025-03-03 14:43:07,596 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:43:07,597 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78
[2025-03-03 14:43:07,597 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:07,611 INFO  L225             Difference]: With dead ends: 14525
[2025-03-03 14:43:07,611 INFO  L226             Difference]: Without dead ends: 7732
[2025-03-03 14:43:07,620 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:43:07,620 INFO  L435           NwaCegarLoop]: 444 mSDtfsCounter, 138 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:07,620 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 810 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:43:07,626 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7732 states.
[2025-03-03 14:43:07,736 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7732 to 7598.
[2025-03-03 14:43:07,744 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7598 states, 7592 states have (on average 1.5126448893572182) internal successors, (11484), 7596 states have internal predecessors, (11484), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:07,754 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7598 states to 7598 states and 11489 transitions.
[2025-03-03 14:43:07,757 INFO  L78                 Accepts]: Start accepts. Automaton has 7598 states and 11489 transitions. Word has length 78
[2025-03-03 14:43:07,757 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:07,757 INFO  L471      AbstractCegarLoop]: Abstraction has 7598 states and 11489 transitions.
[2025-03-03 14:43:07,757 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:07,757 INFO  L276                IsEmpty]: Start isEmpty. Operand 7598 states and 11489 transitions.
[2025-03-03 14:43:07,759 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-03-03 14:43:07,759 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:07,759 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 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]
[2025-03-03 14:43:07,759 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-03 14:43:07,759 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:07,759 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:07,760 INFO  L85        PathProgramCache]: Analyzing trace with hash -466859253, now seen corresponding path program 1 times
[2025-03-03 14:43:07,760 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:07,760 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202377294]
[2025-03-03 14:43:07,760 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:07,760 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:07,764 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-03-03 14:43:07,768 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-03-03 14:43:07,768 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:07,768 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:07,801 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:43:07,801 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:07,801 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202377294]
[2025-03-03 14:43:07,801 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202377294] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:43:07,801 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:43:07,801 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 14:43:07,801 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995900080]
[2025-03-03 14:43:07,802 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:43:07,802 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 14:43:07,802 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:07,802 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 14:43:07,802 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 14:43:07,802 INFO  L87              Difference]: Start difference. First operand 7598 states and 11489 transitions. Second operand  has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:08,196 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:08,197 INFO  L93              Difference]: Finished difference Result 19654 states and 29489 transitions.
[2025-03-03 14:43:08,198 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 14:43:08,199 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91
[2025-03-03 14:43:08,199 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:08,223 INFO  L225             Difference]: With dead ends: 19654
[2025-03-03 14:43:08,223 INFO  L226             Difference]: Without dead ends: 11940
[2025-03-03 14:43:08,234 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 14:43:08,235 INFO  L435           NwaCegarLoop]: 641 mSDtfsCounter, 635 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:08,235 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 1394 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 14:43:08,241 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11940 states.
[2025-03-03 14:43:08,484 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11940 to 10463.
[2025-03-03 14:43:08,498 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10463 states, 10457 states have (on average 1.477383570813809) internal successors, (15449), 10461 states have internal predecessors, (15449), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:08,514 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10463 states to 10463 states and 15454 transitions.
[2025-03-03 14:43:08,517 INFO  L78                 Accepts]: Start accepts. Automaton has 10463 states and 15454 transitions. Word has length 91
[2025-03-03 14:43:08,517 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:08,517 INFO  L471      AbstractCegarLoop]: Abstraction has 10463 states and 15454 transitions.
[2025-03-03 14:43:08,518 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:08,518 INFO  L276                IsEmpty]: Start isEmpty. Operand 10463 states and 15454 transitions.
[2025-03-03 14:43:08,520 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 99
[2025-03-03 14:43:08,520 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:08,520 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 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]
[2025-03-03 14:43:08,520 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-03 14:43:08,520 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:08,520 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:08,521 INFO  L85        PathProgramCache]: Analyzing trace with hash 1484201491, now seen corresponding path program 1 times
[2025-03-03 14:43:08,521 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:08,521 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399670197]
[2025-03-03 14:43:08,521 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:08,521 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:08,527 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes.
[2025-03-03 14:43:08,531 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements.
[2025-03-03 14:43:08,531 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:08,531 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:08,570 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:43:08,570 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:08,570 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399670197]
[2025-03-03 14:43:08,570 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399670197] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:43:08,570 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:43:08,570 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:43:08,571 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184818790]
[2025-03-03 14:43:08,571 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:43:08,571 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:43:08,571 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:08,571 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:43:08,571 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:43:08,572 INFO  L87              Difference]: Start difference. First operand 10463 states and 15454 transitions. Second operand  has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:08,706 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:08,706 INFO  L93              Difference]: Finished difference Result 14848 states and 21982 transitions.
[2025-03-03 14:43:08,707 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:43:08,707 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98
[2025-03-03 14:43:08,707 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:08,716 INFO  L225             Difference]: With dead ends: 14848
[2025-03-03 14:43:08,716 INFO  L226             Difference]: Without dead ends: 4392
[2025-03-03 14:43:08,725 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:43:08,726 INFO  L435           NwaCegarLoop]: 437 mSDtfsCounter, 337 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:08,726 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 515 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:43:08,728 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4392 states.
[2025-03-03 14:43:08,788 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4392 to 4332.
[2025-03-03 14:43:08,791 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4332 states, 4326 states have (on average 1.383495145631068) internal successors, (5985), 4330 states have internal predecessors, (5985), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:08,794 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4332 states to 4332 states and 5990 transitions.
[2025-03-03 14:43:08,796 INFO  L78                 Accepts]: Start accepts. Automaton has 4332 states and 5990 transitions. Word has length 98
[2025-03-03 14:43:08,796 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:08,796 INFO  L471      AbstractCegarLoop]: Abstraction has 4332 states and 5990 transitions.
[2025-03-03 14:43:08,796 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:08,797 INFO  L276                IsEmpty]: Start isEmpty. Operand 4332 states and 5990 transitions.
[2025-03-03 14:43:08,797 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 102
[2025-03-03 14:43:08,797 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:08,797 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-03 14:43:08,798 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-03 14:43:08,798 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:08,798 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:08,798 INFO  L85        PathProgramCache]: Analyzing trace with hash 1381065065, now seen corresponding path program 1 times
[2025-03-03 14:43:08,798 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:08,798 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099227616]
[2025-03-03 14:43:08,798 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:08,798 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:08,803 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes.
[2025-03-03 14:43:08,806 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements.
[2025-03-03 14:43:08,806 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:08,806 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:08,843 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:43:08,843 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:08,843 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099227616]
[2025-03-03 14:43:08,843 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099227616] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:43:08,843 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:43:08,844 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 14:43:08,844 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155262260]
[2025-03-03 14:43:08,844 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:43:08,844 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 14:43:08,844 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:08,844 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 14:43:08,844 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 14:43:08,844 INFO  L87              Difference]: Start difference. First operand 4332 states and 5990 transitions. Second operand  has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:08,998 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:08,998 INFO  L93              Difference]: Finished difference Result 10181 states and 14061 transitions.
[2025-03-03 14:43:08,999 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-03 14:43:08,999 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101
[2025-03-03 14:43:08,999 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:09,009 INFO  L225             Difference]: With dead ends: 10181
[2025-03-03 14:43:09,009 INFO  L226             Difference]: Without dead ends: 6030
[2025-03-03 14:43:09,013 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-03 14:43:09,013 INFO  L435           NwaCegarLoop]: 700 mSDtfsCounter, 533 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 2338 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:09,013 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 2338 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:43:09,016 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6030 states.
[2025-03-03 14:43:09,085 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 4334.
[2025-03-03 14:43:09,088 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4334 states, 4328 states have (on average 1.3805452865064696) internal successors, (5975), 4332 states have internal predecessors, (5975), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:09,091 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4334 states to 4334 states and 5980 transitions.
[2025-03-03 14:43:09,093 INFO  L78                 Accepts]: Start accepts. Automaton has 4334 states and 5980 transitions. Word has length 101
[2025-03-03 14:43:09,094 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:09,094 INFO  L471      AbstractCegarLoop]: Abstraction has 4334 states and 5980 transitions.
[2025-03-03 14:43:09,094 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:09,094 INFO  L276                IsEmpty]: Start isEmpty. Operand 4334 states and 5980 transitions.
[2025-03-03 14:43:09,095 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-03 14:43:09,095 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:09,095 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-03 14:43:09,095 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-03 14:43:09,095 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:09,095 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:09,095 INFO  L85        PathProgramCache]: Analyzing trace with hash -1884041146, now seen corresponding path program 1 times
[2025-03-03 14:43:09,096 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:09,096 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997322770]
[2025-03-03 14:43:09,096 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:09,096 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:09,100 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-03 14:43:09,104 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-03 14:43:09,104 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:09,104 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:09,150 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:43:09,150 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:09,150 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997322770]
[2025-03-03 14:43:09,150 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997322770] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 14:43:09,150 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118174631]
[2025-03-03 14:43:09,151 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:09,151 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 14:43:09,151 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 14:43:09,153 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 14:43:09,154 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 14:43:09,200 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-03 14:43:09,229 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-03 14:43:09,230 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:09,230 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:09,232 INFO  L256         TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 14:43:09,235 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 14:43:09,320 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 14:43:09,320 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 14:43:09,320 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118174631] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:43:09,320 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 14:43:09,320 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6
[2025-03-03 14:43:09,321 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216770116]
[2025-03-03 14:43:09,321 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:43:09,321 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:43:09,321 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:09,321 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:43:09,321 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 14:43:09,321 INFO  L87              Difference]: Start difference. First operand 4334 states and 5980 transitions. Second operand  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:09,419 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:09,419 INFO  L93              Difference]: Finished difference Result 5552 states and 7652 transitions.
[2025-03-03 14:43:09,419 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:43:09,420 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103
[2025-03-03 14:43:09,420 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:09,429 INFO  L225             Difference]: With dead ends: 5552
[2025-03-03 14:43:09,429 INFO  L226             Difference]: Without dead ends: 5548
[2025-03-03 14:43:09,431 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 14:43:09,431 INFO  L435           NwaCegarLoop]: 430 mSDtfsCounter, 231 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:09,431 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 799 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:43:09,434 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5548 states.
[2025-03-03 14:43:09,539 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 5398.
[2025-03-03 14:43:09,543 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5398 states, 5392 states have (on average 1.385200296735905) internal successors, (7469), 5396 states have internal predecessors, (7469), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:09,547 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5398 states to 5398 states and 7474 transitions.
[2025-03-03 14:43:09,549 INFO  L78                 Accepts]: Start accepts. Automaton has 5398 states and 7474 transitions. Word has length 103
[2025-03-03 14:43:09,550 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:09,550 INFO  L471      AbstractCegarLoop]: Abstraction has 5398 states and 7474 transitions.
[2025-03-03 14:43:09,550 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:09,550 INFO  L276                IsEmpty]: Start isEmpty. Operand 5398 states and 7474 transitions.
[2025-03-03 14:43:09,551 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 158
[2025-03-03 14:43:09,552 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:09,552 INFO  L218           NwaCegarLoop]: trace histogram [3, 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]
[2025-03-03 14:43:09,559 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 14:43:09,753 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,SelfDestructingSolverStorable15
[2025-03-03 14:43:09,753 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:09,753 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:09,754 INFO  L85        PathProgramCache]: Analyzing trace with hash -945149371, now seen corresponding path program 1 times
[2025-03-03 14:43:09,754 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:09,754 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588034144]
[2025-03-03 14:43:09,754 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:09,754 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:09,761 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes.
[2025-03-03 14:43:09,766 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements.
[2025-03-03 14:43:09,767 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:09,767 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:09,826 INFO  L134       CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 14:43:09,826 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:09,826 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588034144]
[2025-03-03 14:43:09,826 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588034144] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 14:43:09,826 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563776761]
[2025-03-03 14:43:09,826 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:09,826 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 14:43:09,826 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 14:43:09,828 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 14:43:09,829 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-03 14:43:09,873 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes.
[2025-03-03 14:43:09,915 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements.
[2025-03-03 14:43:09,915 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:09,915 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:09,917 INFO  L256         TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 14:43:09,920 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 14:43:09,983 INFO  L134       CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 14:43:09,983 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 14:43:09,984 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [563776761] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:43:09,984 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 14:43:09,984 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6
[2025-03-03 14:43:09,984 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816402056]
[2025-03-03 14:43:09,984 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:43:09,984 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:43:09,984 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:09,985 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:43:09,985 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-03 14:43:09,985 INFO  L87              Difference]: Start difference. First operand 5398 states and 7474 transitions. Second operand  has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:10,072 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:10,073 INFO  L93              Difference]: Finished difference Result 9539 states and 13301 transitions.
[2025-03-03 14:43:10,073 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:43:10,073 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157
[2025-03-03 14:43:10,073 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:10,082 INFO  L225             Difference]: With dead ends: 9539
[2025-03-03 14:43:10,082 INFO  L226             Difference]: Without dead ends: 4156
[2025-03-03 14:43:10,086 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-03 14:43:10,087 INFO  L435           NwaCegarLoop]: 370 mSDtfsCounter, 261 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:10,087 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 419 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:43:10,089 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4156 states.
[2025-03-03 14:43:10,154 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4156 to 3805.
[2025-03-03 14:43:10,157 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3805 states, 3799 states have (on average 1.3711503027112397) internal successors, (5209), 3803 states have internal predecessors, (5209), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:10,160 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3805 states to 3805 states and 5214 transitions.
[2025-03-03 14:43:10,163 INFO  L78                 Accepts]: Start accepts. Automaton has 3805 states and 5214 transitions. Word has length 157
[2025-03-03 14:43:10,163 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:10,164 INFO  L471      AbstractCegarLoop]: Abstraction has 3805 states and 5214 transitions.
[2025-03-03 14:43:10,164 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:10,164 INFO  L276                IsEmpty]: Start isEmpty. Operand 3805 states and 5214 transitions.
[2025-03-03 14:43:10,165 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2025-03-03 14:43:10,165 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:10,166 INFO  L218           NwaCegarLoop]: trace histogram [3, 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]
[2025-03-03 14:43:10,172 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-03-03 14:43:10,366 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2025-03-03 14:43:10,366 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:10,367 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:10,367 INFO  L85        PathProgramCache]: Analyzing trace with hash -551686428, now seen corresponding path program 1 times
[2025-03-03 14:43:10,367 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:10,367 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180058702]
[2025-03-03 14:43:10,367 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:10,367 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:10,373 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes.
[2025-03-03 14:43:10,377 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements.
[2025-03-03 14:43:10,377 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:10,378 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:10,496 INFO  L134       CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 14:43:10,496 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:10,496 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180058702]
[2025-03-03 14:43:10,497 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180058702] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 14:43:10,497 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48833852]
[2025-03-03 14:43:10,497 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:10,497 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 14:43:10,497 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 14:43:10,499 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 14:43:10,500 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-03 14:43:10,545 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes.
[2025-03-03 14:43:10,585 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements.
[2025-03-03 14:43:10,585 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:10,585 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:10,587 INFO  L256         TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 14:43:10,589 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 14:43:10,627 INFO  L134       CoverageAnalysis]: Checked inductivity of 27 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2025-03-03 14:43:10,627 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 14:43:10,627 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [48833852] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:43:10,627 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 14:43:10,627 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6
[2025-03-03 14:43:10,627 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164805248]
[2025-03-03 14:43:10,628 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:43:10,628 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:43:10,628 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:10,628 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:43:10,628 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-03 14:43:10,628 INFO  L87              Difference]: Start difference. First operand 3805 states and 5214 transitions. Second operand  has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:10,716 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:10,716 INFO  L93              Difference]: Finished difference Result 7434 states and 10237 transitions.
[2025-03-03 14:43:10,717 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:43:10,717 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160
[2025-03-03 14:43:10,717 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:10,725 INFO  L225             Difference]: With dead ends: 7434
[2025-03-03 14:43:10,725 INFO  L226             Difference]: Without dead ends: 3805
[2025-03-03 14:43:10,728 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-03 14:43:10,729 INFO  L435           NwaCegarLoop]: 349 mSDtfsCounter, 273 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:10,729 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 391 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:43:10,731 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3805 states.
[2025-03-03 14:43:10,794 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3805 to 3805.
[2025-03-03 14:43:10,797 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3805 states, 3799 states have (on average 1.3342984996051592) internal successors, (5069), 3803 states have internal predecessors, (5069), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:10,800 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3805 states to 3805 states and 5074 transitions.
[2025-03-03 14:43:10,802 INFO  L78                 Accepts]: Start accepts. Automaton has 3805 states and 5074 transitions. Word has length 160
[2025-03-03 14:43:10,803 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:10,803 INFO  L471      AbstractCegarLoop]: Abstraction has 3805 states and 5074 transitions.
[2025-03-03 14:43:10,803 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:10,803 INFO  L276                IsEmpty]: Start isEmpty. Operand 3805 states and 5074 transitions.
[2025-03-03 14:43:10,804 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 162
[2025-03-03 14:43:10,805 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:10,805 INFO  L218           NwaCegarLoop]: trace histogram [3, 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]
[2025-03-03 14:43:10,811 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-03-03 14:43:11,005 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2025-03-03 14:43:11,005 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:11,006 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:11,006 INFO  L85        PathProgramCache]: Analyzing trace with hash -909745288, now seen corresponding path program 1 times
[2025-03-03 14:43:11,006 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:11,006 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967173982]
[2025-03-03 14:43:11,006 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:11,006 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:11,012 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes.
[2025-03-03 14:43:11,016 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements.
[2025-03-03 14:43:11,017 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:11,017 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:11,095 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 14:43:11,096 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:11,096 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967173982]
[2025-03-03 14:43:11,096 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967173982] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 14:43:11,096 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368795603]
[2025-03-03 14:43:11,096 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:11,096 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 14:43:11,096 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 14:43:11,098 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 14:43:11,099 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-03-03 14:43:11,164 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes.
[2025-03-03 14:43:11,206 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements.
[2025-03-03 14:43:11,206 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:11,206 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:11,208 INFO  L256         TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 14:43:11,210 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 14:43:11,237 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2025-03-03 14:43:11,237 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 14:43:11,237 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368795603] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:43:11,237 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 14:43:11,237 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6
[2025-03-03 14:43:11,237 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477449475]
[2025-03-03 14:43:11,237 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:43:11,238 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:43:11,238 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:11,238 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:43:11,240 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-03 14:43:11,240 INFO  L87              Difference]: Start difference. First operand 3805 states and 5074 transitions. Second operand  has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:11,516 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:11,516 INFO  L93              Difference]: Finished difference Result 8777 states and 11892 transitions.
[2025-03-03 14:43:11,517 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:43:11,518 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161
[2025-03-03 14:43:11,518 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:11,527 INFO  L225             Difference]: With dead ends: 8777
[2025-03-03 14:43:11,528 INFO  L226             Difference]: Without dead ends: 5148
[2025-03-03 14:43:11,530 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-03 14:43:11,531 INFO  L435           NwaCegarLoop]: 439 mSDtfsCounter, 202 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:11,531 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 655 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 14:43:11,534 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5148 states.
[2025-03-03 14:43:11,675 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5148 to 4804.
[2025-03-03 14:43:11,679 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4804 states, 4798 states have (on average 1.3017924135056274) internal successors, (6246), 4802 states have internal predecessors, (6246), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:11,686 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4804 states to 4804 states and 6251 transitions.
[2025-03-03 14:43:11,689 INFO  L78                 Accepts]: Start accepts. Automaton has 4804 states and 6251 transitions. Word has length 161
[2025-03-03 14:43:11,689 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:11,689 INFO  L471      AbstractCegarLoop]: Abstraction has 4804 states and 6251 transitions.
[2025-03-03 14:43:11,689 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:11,690 INFO  L276                IsEmpty]: Start isEmpty. Operand 4804 states and 6251 transitions.
[2025-03-03 14:43:11,691 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 164
[2025-03-03 14:43:11,691 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:11,692 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 14:43:11,698 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2025-03-03 14:43:11,896 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 14:43:11,896 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:11,897 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:11,897 INFO  L85        PathProgramCache]: Analyzing trace with hash 277337876, now seen corresponding path program 1 times
[2025-03-03 14:43:11,897 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:11,897 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433587916]
[2025-03-03 14:43:11,897 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:11,897 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:11,909 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes.
[2025-03-03 14:43:11,918 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements.
[2025-03-03 14:43:11,918 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:11,918 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:12,127 INFO  L134       CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 42 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 14:43:12,128 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:12,128 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433587916]
[2025-03-03 14:43:12,128 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433587916] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 14:43:12,128 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105376386]
[2025-03-03 14:43:12,128 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:12,128 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 14:43:12,128 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 14:43:12,131 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 14:43:12,132 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-03-03 14:43:12,180 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes.
[2025-03-03 14:43:12,221 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements.
[2025-03-03 14:43:12,221 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:12,222 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:12,224 INFO  L256         TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 19 conjuncts are in the unsatisfiable core
[2025-03-03 14:43:12,227 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 14:43:12,366 INFO  L134       CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 42 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 14:43:12,366 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 14:43:12,504 INFO  L134       CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 42 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 14:43:12,504 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105376386] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 14:43:12,504 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 14:43:12,504 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9
[2025-03-03 14:43:12,504 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235496676]
[2025-03-03 14:43:12,504 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 14:43:12,505 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-03 14:43:12,505 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:12,505 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-03 14:43:12,505 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2025-03-03 14:43:12,505 INFO  L87              Difference]: Start difference. First operand 4804 states and 6251 transitions. Second operand  has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:12,896 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:12,897 INFO  L93              Difference]: Finished difference Result 13410 states and 17479 transitions.
[2025-03-03 14:43:12,897 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-03-03 14:43:12,897 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163
[2025-03-03 14:43:12,897 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:12,913 INFO  L225             Difference]: With dead ends: 13410
[2025-03-03 14:43:12,913 INFO  L226             Difference]: Without dead ends: 8782
[2025-03-03 14:43:12,916 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306
[2025-03-03 14:43:12,917 INFO  L435           NwaCegarLoop]: 543 mSDtfsCounter, 891 mSDsluCounter, 3293 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 3836 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:12,917 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 3836 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:43:12,921 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8782 states.
[2025-03-03 14:43:13,053 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8782 to 7503.
[2025-03-03 14:43:13,060 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7503 states, 7497 states have (on average 1.314392423636121) internal successors, (9854), 7501 states have internal predecessors, (9854), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:13,067 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7503 states to 7503 states and 9859 transitions.
[2025-03-03 14:43:13,070 INFO  L78                 Accepts]: Start accepts. Automaton has 7503 states and 9859 transitions. Word has length 163
[2025-03-03 14:43:13,070 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:13,070 INFO  L471      AbstractCegarLoop]: Abstraction has 7503 states and 9859 transitions.
[2025-03-03 14:43:13,070 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:13,070 INFO  L276                IsEmpty]: Start isEmpty. Operand 7503 states and 9859 transitions.
[2025-03-03 14:43:13,072 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 262
[2025-03-03 14:43:13,072 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:13,072 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 14:43:13,079 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2025-03-03 14:43:13,273 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 14:43:13,273 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:13,274 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:13,274 INFO  L85        PathProgramCache]: Analyzing trace with hash -1796822129, now seen corresponding path program 1 times
[2025-03-03 14:43:13,274 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:13,274 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023895563]
[2025-03-03 14:43:13,274 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:13,274 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:13,283 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes.
[2025-03-03 14:43:13,295 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements.
[2025-03-03 14:43:13,297 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:13,298 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:13,592 INFO  L134       CoverageAnalysis]: Checked inductivity of 211 backedges. 10 proven. 191 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-03-03 14:43:13,593 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:13,593 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023895563]
[2025-03-03 14:43:13,593 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023895563] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 14:43:13,593 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4905667]
[2025-03-03 14:43:13,593 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:13,593 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 14:43:13,596 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 14:43:13,597 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 14:43:13,599 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-03-03 14:43:13,652 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes.
[2025-03-03 14:43:13,711 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements.
[2025-03-03 14:43:13,712 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:13,712 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:13,718 INFO  L256         TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 25 conjuncts are in the unsatisfiable core
[2025-03-03 14:43:13,722 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 14:43:13,918 INFO  L134       CoverageAnalysis]: Checked inductivity of 211 backedges. 10 proven. 191 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-03-03 14:43:13,918 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 14:43:14,120 INFO  L134       CoverageAnalysis]: Checked inductivity of 211 backedges. 10 proven. 191 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-03-03 14:43:14,120 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [4905667] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 14:43:14,120 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 14:43:14,120 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 11
[2025-03-03 14:43:14,120 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32544669]
[2025-03-03 14:43:14,120 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 14:43:14,120 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-03-03 14:43:14,120 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:14,121 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-03-03 14:43:14,121 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110
[2025-03-03 14:43:14,121 INFO  L87              Difference]: Start difference. First operand 7503 states and 9859 transitions. Second operand  has 11 states, 11 states have (on average 23.09090909090909) internal successors, (254), 11 states have internal predecessors, (254), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:14,644 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:14,644 INFO  L93              Difference]: Finished difference Result 19263 states and 25160 transitions.
[2025-03-03 14:43:14,645 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2025-03-03 14:43:14,645 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 23.09090909090909) internal successors, (254), 11 states have internal predecessors, (254), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 261
[2025-03-03 14:43:14,645 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:14,666 INFO  L225             Difference]: With dead ends: 19263
[2025-03-03 14:43:14,666 INFO  L226             Difference]: Without dead ends: 11936
[2025-03-03 14:43:14,674 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420
[2025-03-03 14:43:14,675 INFO  L435           NwaCegarLoop]: 1014 mSDtfsCounter, 1494 mSDsluCounter, 7370 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 8384 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:14,675 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 8384 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 14:43:14,682 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11936 states.
[2025-03-03 14:43:14,902 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11936 to 9836.
[2025-03-03 14:43:14,910 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9836 states, 9830 states have (on average 1.3185147507629704) internal successors, (12961), 9834 states have internal predecessors, (12961), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:14,919 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9836 states to 9836 states and 12966 transitions.
[2025-03-03 14:43:14,922 INFO  L78                 Accepts]: Start accepts. Automaton has 9836 states and 12966 transitions. Word has length 261
[2025-03-03 14:43:14,923 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:14,923 INFO  L471      AbstractCegarLoop]: Abstraction has 9836 states and 12966 transitions.
[2025-03-03 14:43:14,923 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 23.09090909090909) internal successors, (254), 11 states have internal predecessors, (254), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:14,923 INFO  L276                IsEmpty]: Start isEmpty. Operand 9836 states and 12966 transitions.
[2025-03-03 14:43:14,927 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 361
[2025-03-03 14:43:14,927 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:14,927 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-03 14:43:14,934 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-03-03 14:43:15,128 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 14:43:15,128 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:15,129 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:15,129 INFO  L85        PathProgramCache]: Analyzing trace with hash -2142159843, now seen corresponding path program 1 times
[2025-03-03 14:43:15,129 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:15,129 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838055622]
[2025-03-03 14:43:15,129 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:15,129 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:15,139 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes.
[2025-03-03 14:43:15,157 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements.
[2025-03-03 14:43:15,157 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:15,157 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:15,510 INFO  L134       CoverageAnalysis]: Checked inductivity of 476 backedges. 125 proven. 337 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-03-03 14:43:15,511 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:15,511 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838055622]
[2025-03-03 14:43:15,511 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838055622] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 14:43:15,511 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140083844]
[2025-03-03 14:43:15,511 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:15,511 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 14:43:15,511 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 14:43:15,513 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 14:43:15,514 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-03-03 14:43:15,573 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes.
[2025-03-03 14:43:15,646 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements.
[2025-03-03 14:43:15,646 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:15,646 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:15,650 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 31 conjuncts are in the unsatisfiable core
[2025-03-03 14:43:15,653 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 14:43:15,969 INFO  L134       CoverageAnalysis]: Checked inductivity of 476 backedges. 15 proven. 447 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-03-03 14:43:15,969 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 14:43:16,252 INFO  L134       CoverageAnalysis]: Checked inductivity of 476 backedges. 15 proven. 447 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-03-03 14:43:16,253 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140083844] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 14:43:16,253 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 14:43:16,253 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18
[2025-03-03 14:43:16,253 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572710719]
[2025-03-03 14:43:16,253 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 14:43:16,254 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2025-03-03 14:43:16,254 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:16,254 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2025-03-03 14:43:16,255 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306
[2025-03-03 14:43:16,255 INFO  L87              Difference]: Start difference. First operand 9836 states and 12966 transitions. Second operand  has 18 states, 18 states have (on average 30.38888888888889) internal successors, (547), 18 states have internal predecessors, (547), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:17,205 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:17,206 INFO  L93              Difference]: Finished difference Result 24750 states and 32368 transitions.
[2025-03-03 14:43:17,208 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2025-03-03 14:43:17,209 INFO  L78                 Accepts]: Start accepts. Automaton has  has 18 states, 18 states have (on average 30.38888888888889) internal successors, (547), 18 states have internal predecessors, (547), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 360
[2025-03-03 14:43:17,209 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:17,236 INFO  L225             Difference]: With dead ends: 24750
[2025-03-03 14:43:17,236 INFO  L226             Difference]: Without dead ends: 15090
[2025-03-03 14:43:17,248 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 759 GetRequests, 719 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=259, Invalid=1463, Unknown=0, NotChecked=0, Total=1722
[2025-03-03 14:43:17,249 INFO  L435           NwaCegarLoop]: 1521 mSDtfsCounter, 4787 mSDsluCounter, 14065 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4787 SdHoareTripleChecker+Valid, 15586 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:17,250 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4787 Valid, 15586 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 14:43:17,259 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15090 states.
[2025-03-03 14:43:17,533 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15090 to 12018.
[2025-03-03 14:43:17,541 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12018 states, 12012 states have (on average 1.3227605727605727) internal successors, (15889), 12016 states have internal predecessors, (15889), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:17,550 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12018 states to 12018 states and 15894 transitions.
[2025-03-03 14:43:17,554 INFO  L78                 Accepts]: Start accepts. Automaton has 12018 states and 15894 transitions. Word has length 360
[2025-03-03 14:43:17,554 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:17,554 INFO  L471      AbstractCegarLoop]: Abstraction has 12018 states and 15894 transitions.
[2025-03-03 14:43:17,555 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 18 states have (on average 30.38888888888889) internal successors, (547), 18 states have internal predecessors, (547), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:17,555 INFO  L276                IsEmpty]: Start isEmpty. Operand 12018 states and 15894 transitions.
[2025-03-03 14:43:17,559 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 462
[2025-03-03 14:43:17,559 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:17,559 INFO  L218           NwaCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-03 14:43:17,566 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2025-03-03 14:43:17,759 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 14:43:17,760 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:17,760 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:17,760 INFO  L85        PathProgramCache]: Analyzing trace with hash -823061752, now seen corresponding path program 1 times
[2025-03-03 14:43:17,760 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:17,761 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136073013]
[2025-03-03 14:43:17,761 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:17,761 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:17,775 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes.
[2025-03-03 14:43:17,786 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements.
[2025-03-03 14:43:17,787 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:17,787 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:17,834 INFO  L134       CoverageAnalysis]: Checked inductivity of 753 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 665 trivial. 0 not checked.
[2025-03-03 14:43:17,835 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:17,835 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136073013]
[2025-03-03 14:43:17,835 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136073013] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:43:17,835 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:43:17,835 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 14:43:17,835 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444221954]
[2025-03-03 14:43:17,835 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:43:17,835 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 14:43:17,836 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:17,836 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 14:43:17,836 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:43:17,836 INFO  L87              Difference]: Start difference. First operand 12018 states and 15894 transitions. Second operand  has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:17,957 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:17,957 INFO  L93              Difference]: Finished difference Result 13648 states and 17760 transitions.
[2025-03-03 14:43:17,957 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 14:43:17,958 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 461
[2025-03-03 14:43:17,959 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:17,964 INFO  L225             Difference]: With dead ends: 13648
[2025-03-03 14:43:17,965 INFO  L226             Difference]: Without dead ends: 1696
[2025-03-03 14:43:17,972 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 14:43:17,972 INFO  L435           NwaCegarLoop]: 282 mSDtfsCounter, 136 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:17,972 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 396 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:43:17,973 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1696 states.
[2025-03-03 14:43:17,998 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1107.
[2025-03-03 14:43:17,998 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1107 states, 1103 states have (on average 1.0743427017225748) internal successors, (1185), 1105 states have internal predecessors, (1185), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:17,999 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1188 transitions.
[2025-03-03 14:43:18,002 INFO  L78                 Accepts]: Start accepts. Automaton has 1107 states and 1188 transitions. Word has length 461
[2025-03-03 14:43:18,003 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:18,003 INFO  L471      AbstractCegarLoop]: Abstraction has 1107 states and 1188 transitions.
[2025-03-03 14:43:18,003 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:18,003 INFO  L276                IsEmpty]: Start isEmpty. Operand 1107 states and 1188 transitions.
[2025-03-03 14:43:18,007 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 463
[2025-03-03 14:43:18,007 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:18,007 INFO  L218           NwaCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-03 14:43:18,008 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-03-03 14:43:18,008 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:18,008 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:18,008 INFO  L85        PathProgramCache]: Analyzing trace with hash 489731822, now seen corresponding path program 1 times
[2025-03-03 14:43:18,008 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:18,008 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427297851]
[2025-03-03 14:43:18,008 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:18,008 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:18,021 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes.
[2025-03-03 14:43:18,028 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements.
[2025-03-03 14:43:18,029 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:18,029 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:18,145 INFO  L134       CoverageAnalysis]: Checked inductivity of 753 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 665 trivial. 0 not checked.
[2025-03-03 14:43:18,146 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:18,146 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427297851]
[2025-03-03 14:43:18,146 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427297851] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:43:18,146 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:43:18,146 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-03 14:43:18,146 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792361363]
[2025-03-03 14:43:18,146 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:43:18,146 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 14:43:18,146 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:18,147 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 14:43:18,147 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-03-03 14:43:18,147 INFO  L87              Difference]: Start difference. First operand 1107 states and 1188 transitions. Second operand  has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:18,243 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:18,243 INFO  L93              Difference]: Finished difference Result 1509 states and 1642 transitions.
[2025-03-03 14:43:18,244 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-03 14:43:18,244 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 462
[2025-03-03 14:43:18,244 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:18,249 INFO  L225             Difference]: With dead ends: 1509
[2025-03-03 14:43:18,249 INFO  L226             Difference]: Without dead ends: 1304
[2025-03-03 14:43:18,249 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132
[2025-03-03 14:43:18,250 INFO  L435           NwaCegarLoop]: 275 mSDtfsCounter, 226 mSDsluCounter, 1227 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:18,250 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1502 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:43:18,251 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1304 states.
[2025-03-03 14:43:18,277 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1173.
[2025-03-03 14:43:18,278 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1173 states, 1169 states have (on average 1.0761334473909325) internal successors, (1258), 1171 states have internal predecessors, (1258), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:18,279 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1261 transitions.
[2025-03-03 14:43:18,282 INFO  L78                 Accepts]: Start accepts. Automaton has 1173 states and 1261 transitions. Word has length 462
[2025-03-03 14:43:18,283 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:18,283 INFO  L471      AbstractCegarLoop]: Abstraction has 1173 states and 1261 transitions.
[2025-03-03 14:43:18,283 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:18,283 INFO  L276                IsEmpty]: Start isEmpty. Operand 1173 states and 1261 transitions.
[2025-03-03 14:43:18,285 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 464
[2025-03-03 14:43:18,285 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:18,285 INFO  L218           NwaCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-03 14:43:18,285 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-03-03 14:43:18,285 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:18,286 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:18,286 INFO  L85        PathProgramCache]: Analyzing trace with hash -36917066, now seen corresponding path program 1 times
[2025-03-03 14:43:18,286 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:18,286 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425519262]
[2025-03-03 14:43:18,286 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:18,286 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:18,298 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes.
[2025-03-03 14:43:18,305 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements.
[2025-03-03 14:43:18,305 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:18,305 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:18,401 INFO  L134       CoverageAnalysis]: Checked inductivity of 767 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 665 trivial. 0 not checked.
[2025-03-03 14:43:18,401 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:18,401 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425519262]
[2025-03-03 14:43:18,401 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425519262] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:43:18,401 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 14:43:18,401 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 14:43:18,401 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921040247]
[2025-03-03 14:43:18,401 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:43:18,402 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 14:43:18,402 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:18,402 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 14:43:18,402 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 14:43:18,402 INFO  L87              Difference]: Start difference. First operand 1173 states and 1261 transitions. Second operand  has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:18,451 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:18,452 INFO  L93              Difference]: Finished difference Result 1369 states and 1476 transitions.
[2025-03-03 14:43:18,452 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 14:43:18,452 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 463
[2025-03-03 14:43:18,452 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:18,456 INFO  L225             Difference]: With dead ends: 1369
[2025-03-03 14:43:18,456 INFO  L226             Difference]: Without dead ends: 1164
[2025-03-03 14:43:18,456 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-03 14:43:18,456 INFO  L435           NwaCegarLoop]: 265 mSDtfsCounter, 184 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:18,457 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 859 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 14:43:18,458 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1164 states.
[2025-03-03 14:43:18,482 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1160.
[2025-03-03 14:43:18,482 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1160 states, 1157 states have (on average 1.0648228176318064) internal successors, (1232), 1158 states have internal predecessors, (1232), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:18,483 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1234 transitions.
[2025-03-03 14:43:18,485 INFO  L78                 Accepts]: Start accepts. Automaton has 1160 states and 1234 transitions. Word has length 463
[2025-03-03 14:43:18,486 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:18,486 INFO  L471      AbstractCegarLoop]: Abstraction has 1160 states and 1234 transitions.
[2025-03-03 14:43:18,486 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:18,486 INFO  L276                IsEmpty]: Start isEmpty. Operand 1160 states and 1234 transitions.
[2025-03-03 14:43:18,488 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 521
[2025-03-03 14:43:18,488 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:18,488 INFO  L218           NwaCegarLoop]: trace histogram [10, 8, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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]
[2025-03-03 14:43:18,488 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2025-03-03 14:43:18,488 INFO  L396      AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:18,489 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:18,490 INFO  L85        PathProgramCache]: Analyzing trace with hash 1396469989, now seen corresponding path program 1 times
[2025-03-03 14:43:18,490 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:18,490 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023018906]
[2025-03-03 14:43:18,490 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:18,490 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:18,502 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes.
[2025-03-03 14:43:18,516 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements.
[2025-03-03 14:43:18,516 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:18,516 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:18,995 INFO  L134       CoverageAnalysis]: Checked inductivity of 863 backedges. 96 proven. 262 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked.
[2025-03-03 14:43:18,995 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:18,995 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023018906]
[2025-03-03 14:43:18,995 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023018906] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 14:43:18,996 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544646994]
[2025-03-03 14:43:18,996 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:18,996 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 14:43:18,996 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 14:43:18,998 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 14:43:18,999 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2025-03-03 14:43:19,071 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes.
[2025-03-03 14:43:19,154 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements.
[2025-03-03 14:43:19,154 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:19,154 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:19,158 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1455 conjuncts, 33 conjuncts are in the unsatisfiable core
[2025-03-03 14:43:19,163 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 14:43:19,700 INFO  L134       CoverageAnalysis]: Checked inductivity of 863 backedges. 96 proven. 262 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked.
[2025-03-03 14:43:19,700 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 14:43:20,132 INFO  L134       CoverageAnalysis]: Checked inductivity of 863 backedges. 25 proven. 333 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked.
[2025-03-03 14:43:20,132 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [544646994] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 14:43:20,132 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 14:43:20,132 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 28
[2025-03-03 14:43:20,132 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523093920]
[2025-03-03 14:43:20,132 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 14:43:20,133 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2025-03-03 14:43:20,133 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:20,133 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2025-03-03 14:43:20,134 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756
[2025-03-03 14:43:20,134 INFO  L87              Difference]: Start difference. First operand 1160 states and 1234 transitions. Second operand  has 28 states, 28 states have (on average 14.035714285714286) internal successors, (393), 28 states have internal predecessors, (393), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:20,484 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:20,484 INFO  L93              Difference]: Finished difference Result 1290 states and 1368 transitions.
[2025-03-03 14:43:20,484 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2025-03-03 14:43:20,484 INFO  L78                 Accepts]: Start accepts. Automaton has  has 28 states, 28 states have (on average 14.035714285714286) internal successors, (393), 28 states have internal predecessors, (393), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 520
[2025-03-03 14:43:20,485 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:20,489 INFO  L225             Difference]: With dead ends: 1290
[2025-03-03 14:43:20,489 INFO  L226             Difference]: Without dead ends: 1287
[2025-03-03 14:43:20,489 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1072 GetRequests, 1032 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=1541, Unknown=0, NotChecked=0, Total=1722
[2025-03-03 14:43:20,490 INFO  L435           NwaCegarLoop]: 393 mSDtfsCounter, 649 mSDsluCounter, 6689 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 7082 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:20,490 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 7082 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 14:43:20,491 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1287 states.
[2025-03-03 14:43:20,522 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1260.
[2025-03-03 14:43:20,523 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1260 states, 1257 states have (on average 1.0628480509148768) internal successors, (1336), 1258 states have internal predecessors, (1336), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:20,523 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1338 transitions.
[2025-03-03 14:43:20,526 INFO  L78                 Accepts]: Start accepts. Automaton has 1260 states and 1338 transitions. Word has length 520
[2025-03-03 14:43:20,527 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:20,527 INFO  L471      AbstractCegarLoop]: Abstraction has 1260 states and 1338 transitions.
[2025-03-03 14:43:20,527 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 28 states, 28 states have (on average 14.035714285714286) internal successors, (393), 28 states have internal predecessors, (393), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:20,528 INFO  L276                IsEmpty]: Start isEmpty. Operand 1260 states and 1338 transitions.
[2025-03-03 14:43:20,530 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 568
[2025-03-03 14:43:20,530 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:20,530 INFO  L218           NwaCegarLoop]: trace histogram [11, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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]
[2025-03-03 14:43:20,538 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2025-03-03 14:43:20,731 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25
[2025-03-03 14:43:20,731 INFO  L396      AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:20,731 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:20,732 INFO  L85        PathProgramCache]: Analyzing trace with hash 1138193860, now seen corresponding path program 1 times
[2025-03-03 14:43:20,732 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:20,732 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417501503]
[2025-03-03 14:43:20,732 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:20,732 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:20,746 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes.
[2025-03-03 14:43:20,762 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements.
[2025-03-03 14:43:20,762 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:20,762 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:21,022 INFO  L134       CoverageAnalysis]: Checked inductivity of 997 backedges. 282 proven. 46 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked.
[2025-03-03 14:43:21,022 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:21,022 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417501503]
[2025-03-03 14:43:21,022 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417501503] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 14:43:21,022 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342073626]
[2025-03-03 14:43:21,023 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:21,023 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 14:43:21,023 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 14:43:21,024 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 14:43:21,027 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2025-03-03 14:43:21,101 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes.
[2025-03-03 14:43:21,211 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements.
[2025-03-03 14:43:21,211 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:21,211 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:21,216 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1581 conjuncts, 19 conjuncts are in the unsatisfiable core
[2025-03-03 14:43:21,224 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 14:43:21,367 INFO  L134       CoverageAnalysis]: Checked inductivity of 997 backedges. 282 proven. 46 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked.
[2025-03-03 14:43:21,367 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 14:43:21,473 INFO  L134       CoverageAnalysis]: Checked inductivity of 997 backedges. 282 proven. 46 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked.
[2025-03-03 14:43:21,473 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342073626] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 14:43:21,473 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 14:43:21,473 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9
[2025-03-03 14:43:21,474 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832753481]
[2025-03-03 14:43:21,474 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 14:43:21,474 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-03 14:43:21,474 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:21,475 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-03 14:43:21,475 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2025-03-03 14:43:21,475 INFO  L87              Difference]: Start difference. First operand 1260 states and 1338 transitions. Second operand  has 9 states, 9 states have (on average 30.666666666666668) internal successors, (276), 9 states have internal predecessors, (276), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:21,606 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:21,606 INFO  L93              Difference]: Finished difference Result 1654 states and 1762 transitions.
[2025-03-03 14:43:21,606 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-03-03 14:43:21,607 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 30.666666666666668) internal successors, (276), 9 states have internal predecessors, (276), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 567
[2025-03-03 14:43:21,607 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:21,611 INFO  L225             Difference]: With dead ends: 1654
[2025-03-03 14:43:21,611 INFO  L226             Difference]: Without dead ends: 1462
[2025-03-03 14:43:21,611 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1151 GetRequests, 1138 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210
[2025-03-03 14:43:21,611 INFO  L435           NwaCegarLoop]: 362 mSDtfsCounter, 394 mSDsluCounter, 2132 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 2494 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:21,612 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 2494 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:43:21,612 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1462 states.
[2025-03-03 14:43:21,643 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1344.
[2025-03-03 14:43:21,645 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1344 states, 1341 states have (on average 1.0626398210290828) internal successors, (1425), 1342 states have internal predecessors, (1425), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:21,646 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1427 transitions.
[2025-03-03 14:43:21,650 INFO  L78                 Accepts]: Start accepts. Automaton has 1344 states and 1427 transitions. Word has length 567
[2025-03-03 14:43:21,651 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:21,651 INFO  L471      AbstractCegarLoop]: Abstraction has 1344 states and 1427 transitions.
[2025-03-03 14:43:21,651 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 30.666666666666668) internal successors, (276), 9 states have internal predecessors, (276), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:21,651 INFO  L276                IsEmpty]: Start isEmpty. Operand 1344 states and 1427 transitions.
[2025-03-03 14:43:21,654 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 627
[2025-03-03 14:43:21,654 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:21,654 INFO  L218           NwaCegarLoop]: trace histogram [12, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 14:43:21,662 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2025-03-03 14:43:21,855 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26
[2025-03-03 14:43:21,855 INFO  L396      AbstractCegarLoop]: === Iteration 28 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:21,856 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:21,856 INFO  L85        PathProgramCache]: Analyzing trace with hash -1991416711, now seen corresponding path program 1 times
[2025-03-03 14:43:21,856 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:21,856 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822695367]
[2025-03-03 14:43:21,856 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:21,856 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:21,870 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes.
[2025-03-03 14:43:21,884 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements.
[2025-03-03 14:43:21,884 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:21,884 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:23,441 INFO  L134       CoverageAnalysis]: Checked inductivity of 1172 backedges. 180 proven. 785 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked.
[2025-03-03 14:43:23,441 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:23,442 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822695367]
[2025-03-03 14:43:23,442 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822695367] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 14:43:23,442 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430740761]
[2025-03-03 14:43:23,442 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:23,442 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 14:43:23,442 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 14:43:23,444 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 14:43:23,445 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2025-03-03 14:43:23,521 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes.
[2025-03-03 14:43:23,640 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements.
[2025-03-03 14:43:23,640 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:23,640 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:23,645 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1721 conjuncts, 45 conjuncts are in the unsatisfiable core
[2025-03-03 14:43:23,652 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 14:43:24,428 INFO  L134       CoverageAnalysis]: Checked inductivity of 1172 backedges. 244 proven. 685 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked.
[2025-03-03 14:43:24,428 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 14:43:24,855 INFO  L134       CoverageAnalysis]: Checked inductivity of 1172 backedges. 30 proven. 899 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked.
[2025-03-03 14:43:24,855 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430740761] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 14:43:24,855 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 14:43:24,855 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 34
[2025-03-03 14:43:24,855 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791268993]
[2025-03-03 14:43:24,855 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 14:43:24,856 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 34 states
[2025-03-03 14:43:24,856 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:24,857 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants.
[2025-03-03 14:43:24,857 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1034, Unknown=0, NotChecked=0, Total=1122
[2025-03-03 14:43:24,857 INFO  L87              Difference]: Start difference. First operand 1344 states and 1427 transitions. Second operand  has 34 states, 34 states have (on average 20.41176470588235) internal successors, (694), 34 states have internal predecessors, (694), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:25,415 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:25,415 INFO  L93              Difference]: Finished difference Result 1474 states and 1561 transitions.
[2025-03-03 14:43:25,415 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. 
[2025-03-03 14:43:25,415 INFO  L78                 Accepts]: Start accepts. Automaton has  has 34 states, 34 states have (on average 20.41176470588235) internal successors, (694), 34 states have internal predecessors, (694), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 626
[2025-03-03 14:43:25,416 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:25,420 INFO  L225             Difference]: With dead ends: 1474
[2025-03-03 14:43:25,420 INFO  L226             Difference]: Without dead ends: 1471
[2025-03-03 14:43:25,421 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1295 GetRequests, 1244 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=241, Invalid=2515, Unknown=0, NotChecked=0, Total=2756
[2025-03-03 14:43:25,422 INFO  L435           NwaCegarLoop]: 596 mSDtfsCounter, 903 mSDsluCounter, 13544 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 14140 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:25,422 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 14140 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 14:43:25,423 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1471 states.
[2025-03-03 14:43:25,491 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1444.
[2025-03-03 14:43:25,492 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1444 states, 1441 states have (on average 1.0610687022900764) internal successors, (1529), 1442 states have internal predecessors, (1529), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:25,494 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1531 transitions.
[2025-03-03 14:43:25,497 INFO  L78                 Accepts]: Start accepts. Automaton has 1444 states and 1531 transitions. Word has length 626
[2025-03-03 14:43:25,498 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:25,498 INFO  L471      AbstractCegarLoop]: Abstraction has 1444 states and 1531 transitions.
[2025-03-03 14:43:25,498 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 34 states, 34 states have (on average 20.41176470588235) internal successors, (694), 34 states have internal predecessors, (694), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:25,498 INFO  L276                IsEmpty]: Start isEmpty. Operand 1444 states and 1531 transitions.
[2025-03-03 14:43:25,504 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 674
[2025-03-03 14:43:25,504 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:25,504 INFO  L218           NwaCegarLoop]: trace histogram [13, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 14:43:25,512 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2025-03-03 14:43:25,709 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27
[2025-03-03 14:43:25,709 INFO  L396      AbstractCegarLoop]: === Iteration 29 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:25,709 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:25,710 INFO  L85        PathProgramCache]: Analyzing trace with hash 747878320, now seen corresponding path program 1 times
[2025-03-03 14:43:25,710 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:25,710 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827157367]
[2025-03-03 14:43:25,710 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:25,710 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:25,730 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes.
[2025-03-03 14:43:25,750 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements.
[2025-03-03 14:43:25,751 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:25,751 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:26,745 INFO  L134       CoverageAnalysis]: Checked inductivity of 1355 backedges. 30 proven. 959 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked.
[2025-03-03 14:43:26,745 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:26,745 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827157367]
[2025-03-03 14:43:26,745 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827157367] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 14:43:26,745 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265370118]
[2025-03-03 14:43:26,745 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:26,745 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 14:43:26,746 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 14:43:26,747 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 14:43:26,749 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2025-03-03 14:43:26,833 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes.
[2025-03-03 14:43:26,959 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements.
[2025-03-03 14:43:26,959 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:26,959 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:26,965 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1847 conjuncts, 25 conjuncts are in the unsatisfiable core
[2025-03-03 14:43:26,971 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 14:43:27,182 INFO  L134       CoverageAnalysis]: Checked inductivity of 1355 backedges. 476 proven. 206 refuted. 0 times theorem prover too weak. 673 trivial. 0 not checked.
[2025-03-03 14:43:27,183 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 14:43:27,436 INFO  L134       CoverageAnalysis]: Checked inductivity of 1355 backedges. 476 proven. 206 refuted. 0 times theorem prover too weak. 673 trivial. 0 not checked.
[2025-03-03 14:43:27,437 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [265370118] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 14:43:27,437 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 14:43:27,437 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 11, 11] total 24
[2025-03-03 14:43:27,437 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086529546]
[2025-03-03 14:43:27,437 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 14:43:27,438 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2025-03-03 14:43:27,438 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:27,438 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2025-03-03 14:43:27,438 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552
[2025-03-03 14:43:27,439 INFO  L87              Difference]: Start difference. First operand 1444 states and 1531 transitions. Second operand  has 24 states, 24 states have (on average 31.5) internal successors, (756), 24 states have internal predecessors, (756), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:28,505 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:28,506 INFO  L93              Difference]: Finished difference Result 1968 states and 2091 transitions.
[2025-03-03 14:43:28,506 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. 
[2025-03-03 14:43:28,506 INFO  L78                 Accepts]: Start accepts. Automaton has  has 24 states, 24 states have (on average 31.5) internal successors, (756), 24 states have internal predecessors, (756), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 673
[2025-03-03 14:43:28,507 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:28,511 INFO  L225             Difference]: With dead ends: 1968
[2025-03-03 14:43:28,511 INFO  L226             Difference]: Without dead ends: 1776
[2025-03-03 14:43:28,513 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1439 GetRequests, 1364 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1338 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=555, Invalid=5297, Unknown=0, NotChecked=0, Total=5852
[2025-03-03 14:43:28,513 INFO  L435           NwaCegarLoop]: 694 mSDtfsCounter, 1614 mSDsluCounter, 13027 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1614 SdHoareTripleChecker+Valid, 13721 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:28,513 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1614 Valid, 13721 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 14:43:28,514 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1776 states.
[2025-03-03 14:43:28,557 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1630.
[2025-03-03 14:43:28,558 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1630 states, 1627 states have (on average 1.0602335586969884) internal successors, (1725), 1628 states have internal predecessors, (1725), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:28,559 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 1727 transitions.
[2025-03-03 14:43:28,562 INFO  L78                 Accepts]: Start accepts. Automaton has 1630 states and 1727 transitions. Word has length 673
[2025-03-03 14:43:28,562 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:28,563 INFO  L471      AbstractCegarLoop]: Abstraction has 1630 states and 1727 transitions.
[2025-03-03 14:43:28,563 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 24 states have (on average 31.5) internal successors, (756), 24 states have internal predecessors, (756), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:28,563 INFO  L276                IsEmpty]: Start isEmpty. Operand 1630 states and 1727 transitions.
[2025-03-03 14:43:28,566 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 734
[2025-03-03 14:43:28,566 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:28,566 INFO  L218           NwaCegarLoop]: trace histogram [14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-03 14:43:28,576 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2025-03-03 14:43:28,767 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28
[2025-03-03 14:43:28,767 INFO  L396      AbstractCegarLoop]: === Iteration 30 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:28,767 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:28,767 INFO  L85        PathProgramCache]: Analyzing trace with hash -1351406652, now seen corresponding path program 1 times
[2025-03-03 14:43:28,768 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:28,768 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701017252]
[2025-03-03 14:43:28,768 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:28,768 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:28,783 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes.
[2025-03-03 14:43:28,796 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements.
[2025-03-03 14:43:28,797 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:28,797 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:30,084 INFO  L134       CoverageAnalysis]: Checked inductivity of 1595 backedges. 137 proven. 1395 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked.
[2025-03-03 14:43:30,084 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:30,084 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701017252]
[2025-03-03 14:43:30,084 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701017252] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 14:43:30,084 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149912716]
[2025-03-03 14:43:30,084 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:30,084 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 14:43:30,084 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 14:43:30,086 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 14:43:30,087 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2025-03-03 14:43:30,170 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes.
[2025-03-03 14:43:30,293 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements.
[2025-03-03 14:43:30,294 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:30,294 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:30,299 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1988 conjuncts, 57 conjuncts are in the unsatisfiable core
[2025-03-03 14:43:30,306 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 14:43:31,259 INFO  L134       CoverageAnalysis]: Checked inductivity of 1595 backedges. 299 proven. 1215 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked.
[2025-03-03 14:43:31,259 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 14:43:31,851 INFO  L134       CoverageAnalysis]: Checked inductivity of 1595 backedges. 35 proven. 1479 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked.
[2025-03-03 14:43:31,851 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149912716] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 14:43:31,851 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 14:43:31,852 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 40
[2025-03-03 14:43:31,852 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696575566]
[2025-03-03 14:43:31,852 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 14:43:31,852 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 40 states
[2025-03-03 14:43:31,852 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:31,853 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2025-03-03 14:43:31,854 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1454, Unknown=0, NotChecked=0, Total=1560
[2025-03-03 14:43:31,854 INFO  L87              Difference]: Start difference. First operand 1630 states and 1727 transitions. Second operand  has 40 states, 40 states have (on average 25.025) internal successors, (1001), 40 states have internal predecessors, (1001), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:32,653 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:32,653 INFO  L93              Difference]: Finished difference Result 1856 states and 1962 transitions.
[2025-03-03 14:43:32,653 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. 
[2025-03-03 14:43:32,654 INFO  L78                 Accepts]: Start accepts. Automaton has  has 40 states, 40 states have (on average 25.025) internal successors, (1001), 40 states have internal predecessors, (1001), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 733
[2025-03-03 14:43:32,654 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:32,658 INFO  L225             Difference]: With dead ends: 1856
[2025-03-03 14:43:32,658 INFO  L226             Difference]: Without dead ends: 1853
[2025-03-03 14:43:32,659 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1519 GetRequests, 1458 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=287, Invalid=3619, Unknown=0, NotChecked=0, Total=3906
[2025-03-03 14:43:32,660 INFO  L435           NwaCegarLoop]: 836 mSDtfsCounter, 1113 mSDsluCounter, 22083 mSDsCounter, 0 mSdLazyCounter, 1655 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 22919 SdHoareTripleChecker+Invalid, 1658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:32,660 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 22919 Invalid, 1658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1655 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 14:43:32,661 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1853 states.
[2025-03-03 14:43:32,730 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1816.
[2025-03-03 14:43:32,731 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1816 states, 1813 states have (on average 1.0590182018753447) internal successors, (1920), 1814 states have internal predecessors, (1920), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:32,732 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 1922 transitions.
[2025-03-03 14:43:32,735 INFO  L78                 Accepts]: Start accepts. Automaton has 1816 states and 1922 transitions. Word has length 733
[2025-03-03 14:43:32,736 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:32,736 INFO  L471      AbstractCegarLoop]: Abstraction has 1816 states and 1922 transitions.
[2025-03-03 14:43:32,736 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 40 states, 40 states have (on average 25.025) internal successors, (1001), 40 states have internal predecessors, (1001), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:32,736 INFO  L276                IsEmpty]: Start isEmpty. Operand 1816 states and 1922 transitions.
[2025-03-03 14:43:32,739 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 781
[2025-03-03 14:43:32,740 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:32,740 INFO  L218           NwaCegarLoop]: trace histogram [15, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-03 14:43:32,748 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0
[2025-03-03 14:43:32,940 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 14:43:32,941 INFO  L396      AbstractCegarLoop]: === Iteration 31 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:32,941 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:32,942 INFO  L85        PathProgramCache]: Analyzing trace with hash 503348485, now seen corresponding path program 1 times
[2025-03-03 14:43:32,942 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:32,942 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408359560]
[2025-03-03 14:43:32,942 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:32,942 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:32,957 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 780 statements into 1 equivalence classes.
[2025-03-03 14:43:32,971 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 780 of 780 statements.
[2025-03-03 14:43:32,971 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:32,971 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:34,096 INFO  L134       CoverageAnalysis]: Checked inductivity of 1828 backedges. 37 proven. 1448 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked.
[2025-03-03 14:43:34,096 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:34,096 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408359560]
[2025-03-03 14:43:34,096 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408359560] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 14:43:34,096 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199459039]
[2025-03-03 14:43:34,096 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:34,096 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 14:43:34,096 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 14:43:34,098 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 14:43:34,099 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2025-03-03 14:43:34,188 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 780 statements into 1 equivalence classes.
[2025-03-03 14:43:34,308 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 780 of 780 statements.
[2025-03-03 14:43:34,308 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:34,308 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:34,312 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2114 conjuncts, 31 conjuncts are in the unsatisfiable core
[2025-03-03 14:43:34,318 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 14:43:34,720 INFO  L134       CoverageAnalysis]: Checked inductivity of 1828 backedges. 670 proven. 481 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked.
[2025-03-03 14:43:34,720 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 14:43:35,016 INFO  L134       CoverageAnalysis]: Checked inductivity of 1828 backedges. 670 proven. 481 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked.
[2025-03-03 14:43:35,017 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199459039] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 14:43:35,017 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 14:43:35,017 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 13, 13] total 30
[2025-03-03 14:43:35,017 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753990740]
[2025-03-03 14:43:35,017 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 14:43:35,018 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2025-03-03 14:43:35,018 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:35,019 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2025-03-03 14:43:35,019 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=802, Unknown=0, NotChecked=0, Total=870
[2025-03-03 14:43:35,020 INFO  L87              Difference]: Start difference. First operand 1816 states and 1922 transitions. Second operand  has 30 states, 30 states have (on average 32.2) internal successors, (966), 30 states have internal predecessors, (966), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:36,537 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:36,537 INFO  L93              Difference]: Finished difference Result 2554 states and 2708 transitions.
[2025-03-03 14:43:36,537 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. 
[2025-03-03 14:43:36,537 INFO  L78                 Accepts]: Start accepts. Automaton has  has 30 states, 30 states have (on average 32.2) internal successors, (966), 30 states have internal predecessors, (966), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 780
[2025-03-03 14:43:36,538 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:36,541 INFO  L225             Difference]: With dead ends: 2554
[2025-03-03 14:43:36,541 INFO  L226             Difference]: Without dead ends: 2176
[2025-03-03 14:43:36,543 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1674 GetRequests, 1575 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2686 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=895, Invalid=9205, Unknown=0, NotChecked=0, Total=10100
[2025-03-03 14:43:36,543 INFO  L435           NwaCegarLoop]: 926 mSDtfsCounter, 2672 mSDsluCounter, 18502 mSDsCounter, 0 mSdLazyCounter, 1897 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2672 SdHoareTripleChecker+Valid, 19428 SdHoareTripleChecker+Invalid, 1936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:36,543 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2672 Valid, 19428 Invalid, 1936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1897 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 14:43:36,544 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2176 states.
[2025-03-03 14:43:36,607 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2176 to 2004.
[2025-03-03 14:43:36,608 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2004 states, 2001 states have (on average 1.0584707646176912) internal successors, (2118), 2002 states have internal predecessors, (2118), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:36,609 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 2120 transitions.
[2025-03-03 14:43:36,611 INFO  L78                 Accepts]: Start accepts. Automaton has 2004 states and 2120 transitions. Word has length 780
[2025-03-03 14:43:36,612 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:36,612 INFO  L471      AbstractCegarLoop]: Abstraction has 2004 states and 2120 transitions.
[2025-03-03 14:43:36,612 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 30 states, 30 states have (on average 32.2) internal successors, (966), 30 states have internal predecessors, (966), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:36,612 INFO  L276                IsEmpty]: Start isEmpty. Operand 2004 states and 2120 transitions.
[2025-03-03 14:43:36,616 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 842
[2025-03-03 14:43:36,616 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:36,616 INFO  L218           NwaCegarLoop]: trace histogram [16, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-03 14:43:36,624 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0
[2025-03-03 14:43:36,816 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30
[2025-03-03 14:43:36,817 INFO  L396      AbstractCegarLoop]: === Iteration 32 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:36,817 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:36,817 INFO  L85        PathProgramCache]: Analyzing trace with hash -1297083243, now seen corresponding path program 1 times
[2025-03-03 14:43:36,817 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:36,818 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975177987]
[2025-03-03 14:43:36,818 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:36,818 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:36,834 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 841 statements into 1 equivalence classes.
[2025-03-03 14:43:36,850 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 841 of 841 statements.
[2025-03-03 14:43:36,850 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:36,850 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:39,411 INFO  L134       CoverageAnalysis]: Checked inductivity of 2133 backedges. 150 proven. 1799 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked.
[2025-03-03 14:43:39,412 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:39,412 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975177987]
[2025-03-03 14:43:39,412 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975177987] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 14:43:39,412 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24159870]
[2025-03-03 14:43:39,412 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:39,412 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 14:43:39,415 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 14:43:39,417 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 14:43:39,418 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2025-03-03 14:43:39,600 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 841 statements into 1 equivalence classes.
[2025-03-03 14:43:39,803 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 841 of 841 statements.
[2025-03-03 14:43:39,804 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:39,804 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:39,812 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2256 conjuncts, 69 conjuncts are in the unsatisfiable core
[2025-03-03 14:43:39,835 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 14:43:42,197 INFO  L134       CoverageAnalysis]: Checked inductivity of 2133 backedges. 258 proven. 1849 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked.
[2025-03-03 14:43:42,197 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 14:43:43,222 INFO  L134       CoverageAnalysis]: Checked inductivity of 2133 backedges. 40 proven. 2067 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked.
[2025-03-03 14:43:43,222 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [24159870] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 14:43:43,222 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 14:43:43,223 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 29, 29] total 70
[2025-03-03 14:43:43,223 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147992358]
[2025-03-03 14:43:43,223 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 14:43:43,229 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 70 states
[2025-03-03 14:43:43,229 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:43,241 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants.
[2025-03-03 14:43:43,242 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=4627, Unknown=0, NotChecked=0, Total=4830
[2025-03-03 14:43:43,245 INFO  L87              Difference]: Start difference. First operand 2004 states and 2120 transitions. Second operand  has 70 states, 70 states have (on average 24.857142857142858) internal successors, (1740), 70 states have internal predecessors, (1740), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:47,816 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:47,816 INFO  L93              Difference]: Finished difference Result 2356 states and 2493 transitions.
[2025-03-03 14:43:47,819 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. 
[2025-03-03 14:43:47,821 INFO  L78                 Accepts]: Start accepts. Automaton has  has 70 states, 70 states have (on average 24.857142857142858) internal successors, (1740), 70 states have internal predecessors, (1740), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 841
[2025-03-03 14:43:47,826 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:47,849 INFO  L225             Difference]: With dead ends: 2356
[2025-03-03 14:43:47,849 INFO  L226             Difference]: Without dead ends: 2353
[2025-03-03 14:43:47,854 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1813 GetRequests, 1664 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5767 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1370, Invalid=21280, Unknown=0, NotChecked=0, Total=22650
[2025-03-03 14:43:47,856 INFO  L435           NwaCegarLoop]: 1113 mSDtfsCounter, 3821 mSDsluCounter, 54752 mSDsCounter, 0 mSdLazyCounter, 5649 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3821 SdHoareTripleChecker+Valid, 55865 SdHoareTripleChecker+Invalid, 5712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 5649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:47,857 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3821 Valid, 55865 Invalid, 5712 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 5649 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-03-03 14:43:47,871 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2353 states.
[2025-03-03 14:43:48,003 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 2104.
[2025-03-03 14:43:48,008 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2104 states, 2101 states have (on average 1.057591623036649) internal successors, (2222), 2102 states have internal predecessors, (2222), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:48,010 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2104 states to 2104 states and 2224 transitions.
[2025-03-03 14:43:48,017 INFO  L78                 Accepts]: Start accepts. Automaton has 2104 states and 2224 transitions. Word has length 841
[2025-03-03 14:43:48,019 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:48,021 INFO  L471      AbstractCegarLoop]: Abstraction has 2104 states and 2224 transitions.
[2025-03-03 14:43:48,022 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 70 states, 70 states have (on average 24.857142857142858) internal successors, (1740), 70 states have internal predecessors, (1740), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:48,022 INFO  L276                IsEmpty]: Start isEmpty. Operand 2104 states and 2224 transitions.
[2025-03-03 14:43:48,043 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 889
[2025-03-03 14:43:48,043 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 14:43:48,044 INFO  L218           NwaCegarLoop]: trace histogram [17, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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]
[2025-03-03 14:43:48,054 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0
[2025-03-03 14:43:48,249 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 14:43:48,250 INFO  L396      AbstractCegarLoop]: === Iteration 33 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 14:43:48,251 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 14:43:48,252 INFO  L85        PathProgramCache]: Analyzing trace with hash 2086976532, now seen corresponding path program 1 times
[2025-03-03 14:43:48,252 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 14:43:48,252 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630005137]
[2025-03-03 14:43:48,253 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:48,253 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 14:43:48,278 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 888 statements into 1 equivalence classes.
[2025-03-03 14:43:48,299 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 888 of 888 statements.
[2025-03-03 14:43:48,299 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:48,299 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:49,578 INFO  L134       CoverageAnalysis]: Checked inductivity of 2417 backedges. 423 proven. 1549 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked.
[2025-03-03 14:43:49,578 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 14:43:49,579 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630005137]
[2025-03-03 14:43:49,580 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630005137] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 14:43:49,580 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481610973]
[2025-03-03 14:43:49,580 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 14:43:49,580 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 14:43:49,580 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 14:43:49,583 INFO  L229       MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 14:43:49,585 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2025-03-03 14:43:49,700 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 888 statements into 1 equivalence classes.
[2025-03-03 14:43:49,874 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 888 of 888 statements.
[2025-03-03 14:43:49,875 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 14:43:49,875 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 14:43:49,886 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2382 conjuncts, 14 conjuncts are in the unsatisfiable core
[2025-03-03 14:43:49,894 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 14:43:50,302 INFO  L134       CoverageAnalysis]: Checked inductivity of 2417 backedges. 1736 proven. 0 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked.
[2025-03-03 14:43:50,302 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 14:43:50,302 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [481610973] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 14:43:50,302 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 14:43:50,303 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [23] total 26
[2025-03-03 14:43:50,303 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536225095]
[2025-03-03 14:43:50,303 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 14:43:50,304 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-03-03 14:43:50,304 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 14:43:50,304 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-03-03 14:43:50,305 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650
[2025-03-03 14:43:50,305 INFO  L87              Difference]: Start difference. First operand 2104 states and 2224 transitions. Second operand  has 11 states, 11 states have (on average 53.72727272727273) internal successors, (591), 11 states have internal predecessors, (591), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:50,561 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 14:43:50,562 INFO  L93              Difference]: Finished difference Result 3041 states and 3207 transitions.
[2025-03-03 14:43:50,562 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-03-03 14:43:50,563 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 53.72727272727273) internal successors, (591), 11 states have internal predecessors, (591), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 888
[2025-03-03 14:43:50,564 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 14:43:50,568 INFO  L225             Difference]: With dead ends: 3041
[2025-03-03 14:43:50,569 INFO  L226             Difference]: Without dead ends: 0
[2025-03-03 14:43:50,575 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 931 GetRequests, 898 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=1025, Unknown=0, NotChecked=0, Total=1190
[2025-03-03 14:43:50,576 INFO  L435           NwaCegarLoop]: 757 mSDtfsCounter, 722 mSDsluCounter, 2860 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 3617 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 14:43:50,576 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 3617 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 14:43:50,576 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-03-03 14:43:50,581 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-03-03 14:43:50,581 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:50,581 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-03-03 14:43:50,583 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 888
[2025-03-03 14:43:50,583 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 14:43:50,583 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-03-03 14:43:50,584 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 53.72727272727273) internal successors, (591), 11 states have internal predecessors, (591), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 14:43:50,584 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-03-03 14:43:50,584 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-03-03 14:43:50,588 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-03 14:43:50,618 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0
[2025-03-03 14:43:50,792 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 14:43:50,799 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 14:43:50,801 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.