./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version e2fb8bed
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.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 1f7b08d697525a6b6e4b6c32e081a52208b7f6ea0ef3da259b2ed32d3a516e9b
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 06:04:14,175 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 06:04:14,239 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 06:04:14,243 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 06:04:14,243 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 06:04:14,264 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 06:04:14,265 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 06:04:14,265 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 06:04:14,266 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 06:04:14,266 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 06:04:14,266 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 06:04:14,266 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 06:04:14,266 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 06:04:14,267 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 06:04:14,267 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 06:04:14,267 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 06:04:14,267 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 06:04:14,268 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 06:04:14,268 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 06:04:14,268 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 06:04:14,268 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 06:04:14,268 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 06:04:14,268 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 06:04:14,268 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 06:04:14,269 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 06:04:14,269 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 06:04:14,269 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 06:04:14,269 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 06:04:14,269 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 06:04:14,269 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 06:04:14,269 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 06:04:14,269 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 06:04:14,269 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 06:04:14,269 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 06:04:14,270 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 06:04:14,270 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 06:04:14,270 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 06:04:14,270 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 06:04:14,270 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 06:04:14,270 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 06:04:14,270 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 06:04:14,270 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 06:04:14,270 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 06:04:14,270 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 -> 1f7b08d697525a6b6e4b6c32e081a52208b7f6ea0ef3da259b2ed32d3a516e9b
[2025-03-08 06:04:14,478 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 06:04:14,487 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 06:04:14,488 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 06:04:14,489 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 06:04:14,489 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 06:04:14,490 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c
[2025-03-08 06:04:15,647 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19d9c432e/d9f1a829ad1f48dbbc5aba619584e48c/FLAG8a514dc3f
[2025-03-08 06:04:15,903 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 06:04:15,904 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c
[2025-03-08 06:04:15,915 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19d9c432e/d9f1a829ad1f48dbbc5aba619584e48c/FLAG8a514dc3f
[2025-03-08 06:04:16,204 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19d9c432e/d9f1a829ad1f48dbbc5aba619584e48c
[2025-03-08 06:04:16,206 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 06:04:16,208 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 06:04:16,209 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 06:04:16,209 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 06:04:16,212 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 06:04:16,213 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:04:16" (1/1) ...
[2025-03-08 06:04:16,215 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1640e41e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:04:16, skipping insertion in model container
[2025-03-08 06:04:16,215 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:04:16" (1/1) ...
[2025-03-08 06:04:16,235 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 06:04:16,422 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/seq-mthreaded/pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c[14467,14480]
[2025-03-08 06:04:16,426 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 06:04:16,436 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 06:04:16,491 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/seq-mthreaded/pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c[14467,14480]
[2025-03-08 06:04:16,491 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 06:04:16,511 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 06:04:16,512 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:04:16 WrapperNode
[2025-03-08 06:04:16,512 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 06:04:16,513 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 06:04:16,513 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 06:04:16,513 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 06:04:16,517 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:04:16" (1/1) ...
[2025-03-08 06:04:16,528 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:04:16" (1/1) ...
[2025-03-08 06:04:16,559 INFO  L138                Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 487
[2025-03-08 06:04:16,560 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 06:04:16,560 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 06:04:16,560 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 06:04:16,560 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 06:04:16,566 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:04:16" (1/1) ...
[2025-03-08 06:04:16,566 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:04:16" (1/1) ...
[2025-03-08 06:04:16,569 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:04:16" (1/1) ...
[2025-03-08 06:04:16,579 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-08 06:04:16,579 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:04:16" (1/1) ...
[2025-03-08 06:04:16,579 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:04:16" (1/1) ...
[2025-03-08 06:04:16,585 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:04:16" (1/1) ...
[2025-03-08 06:04:16,586 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:04:16" (1/1) ...
[2025-03-08 06:04:16,587 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:04:16" (1/1) ...
[2025-03-08 06:04:16,590 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:04:16" (1/1) ...
[2025-03-08 06:04:16,592 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 06:04:16,593 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 06:04:16,593 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 06:04:16,593 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 06:04:16,594 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:04:16" (1/1) ...
[2025-03-08 06:04:16,597 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 06:04:16,613 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 06:04:16,624 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 06:04:16,626 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 06:04:16,645 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 06:04:16,645 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 06:04:16,645 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 06:04:16,645 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 06:04:16,724 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 06:04:16,726 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 06:04:17,131 INFO  L?                        ?]: Removed 48 outVars from TransFormulas that were not future-live.
[2025-03-08 06:04:17,132 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 06:04:17,143 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 06:04:17,145 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 06:04:17,145 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:04:17 BoogieIcfgContainer
[2025-03-08 06:04:17,146 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 06:04:17,147 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 06:04:17,148 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 06:04:17,151 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 06:04:17,151 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:04:16" (1/3) ...
[2025-03-08 06:04:17,152 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e39565f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:04:17, skipping insertion in model container
[2025-03-08 06:04:17,153 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:04:16" (2/3) ...
[2025-03-08 06:04:17,153 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e39565f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:04:17, skipping insertion in model container
[2025-03-08 06:04:17,153 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:04:17" (3/3) ...
[2025-03-08 06:04:17,154 INFO  L128   eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c
[2025-03-08 06:04:17,167 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 06:04:17,170 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c that has 1 procedures, 130 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 06:04:17,210 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 06:04:17,218 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;@3ea5fec7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 06:04:17,219 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 06:04:17,222 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 130 states, 128 states have (on average 1.78125) internal successors, (228), 129 states have internal predecessors, (228), 0 states have call successors, (0), 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-08 06:04:17,226 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2025-03-08 06:04:17,226 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:04:17,227 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:04:17,228 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:04:17,231 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:04:17,232 INFO  L85        PathProgramCache]: Analyzing trace with hash -1292662406, now seen corresponding path program 1 times
[2025-03-08 06:04:17,237 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:04:17,239 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351416326]
[2025-03-08 06:04:17,240 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:04:17,240 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:04:17,315 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes.
[2025-03-08 06:04:17,381 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements.
[2025-03-08 06:04:17,382 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:04:17,382 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:04:17,656 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-08 06:04:17,656 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:04:17,656 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351416326]
[2025-03-08 06:04:17,656 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351416326] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:04:17,657 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:04:17,657 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 06:04:17,658 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581003416]
[2025-03-08 06:04:17,658 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:04:17,660 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 06:04:17,661 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:04:17,672 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 06:04:17,673 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 06:04:17,674 INFO  L87              Difference]: Start difference. First operand  has 130 states, 128 states have (on average 1.78125) internal successors, (228), 129 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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-08 06:04:17,780 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:04:17,780 INFO  L93              Difference]: Finished difference Result 201 states and 350 transitions.
[2025-03-08 06:04:17,786 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 06:04:17,787 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37
[2025-03-08 06:04:17,787 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:04:17,794 INFO  L225             Difference]: With dead ends: 201
[2025-03-08 06:04:17,795 INFO  L226             Difference]: Without dead ends: 127
[2025-03-08 06:04:17,799 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 06:04:17,802 INFO  L435           NwaCegarLoop]: 221 mSDtfsCounter, 0 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 06:04:17,806 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 849 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 06:04:17,818 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 127 states.
[2025-03-08 06:04:17,830 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127.
[2025-03-08 06:04:17,831 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 127 states, 126 states have (on average 1.5317460317460319) internal successors, (193), 126 states have internal predecessors, (193), 0 states have call successors, (0), 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-08 06:04:17,834 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 193 transitions.
[2025-03-08 06:04:17,835 INFO  L78                 Accepts]: Start accepts. Automaton has 127 states and 193 transitions. Word has length 37
[2025-03-08 06:04:17,836 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:04:17,836 INFO  L471      AbstractCegarLoop]: Abstraction has 127 states and 193 transitions.
[2025-03-08 06:04:17,836 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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-08 06:04:17,836 INFO  L276                IsEmpty]: Start isEmpty. Operand 127 states and 193 transitions.
[2025-03-08 06:04:17,837 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2025-03-08 06:04:17,837 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:04:17,837 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-08 06:04:17,838 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-08 06:04:17,838 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:04:17,838 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:04:17,838 INFO  L85        PathProgramCache]: Analyzing trace with hash -122888143, now seen corresponding path program 1 times
[2025-03-08 06:04:17,838 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:04:17,839 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729718320]
[2025-03-08 06:04:17,839 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:04:17,839 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:04:17,857 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes.
[2025-03-08 06:04:17,875 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements.
[2025-03-08 06:04:17,875 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:04:17,875 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:04:17,990 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-08 06:04:17,991 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:04:17,991 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729718320]
[2025-03-08 06:04:17,991 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729718320] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:04:17,991 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:04:17,991 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 06:04:17,991 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69435205]
[2025-03-08 06:04:17,991 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:04:17,992 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 06:04:17,992 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:04:17,992 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 06:04:17,992 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 06:04:17,992 INFO  L87              Difference]: Start difference. First operand 127 states and 193 transitions. Second operand  has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-08 06:04:18,036 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:04:18,036 INFO  L93              Difference]: Finished difference Result 251 states and 405 transitions.
[2025-03-08 06:04:18,038 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 06:04:18,038 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66
[2025-03-08 06:04:18,038 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:04:18,039 INFO  L225             Difference]: With dead ends: 251
[2025-03-08 06:04:18,039 INFO  L226             Difference]: Without dead ends: 184
[2025-03-08 06:04:18,040 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-08 06:04:18,040 INFO  L435           NwaCegarLoop]: 192 mSDtfsCounter, 89 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 06:04:18,040 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 342 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 06:04:18,041 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 184 states.
[2025-03-08 06:04:18,053 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182.
[2025-03-08 06:04:18,054 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 182 states, 181 states have (on average 1.569060773480663) internal successors, (284), 181 states have internal predecessors, (284), 0 states have call successors, (0), 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-08 06:04:18,055 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 284 transitions.
[2025-03-08 06:04:18,055 INFO  L78                 Accepts]: Start accepts. Automaton has 182 states and 284 transitions. Word has length 66
[2025-03-08 06:04:18,055 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:04:18,055 INFO  L471      AbstractCegarLoop]: Abstraction has 182 states and 284 transitions.
[2025-03-08 06:04:18,055 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-08 06:04:18,055 INFO  L276                IsEmpty]: Start isEmpty. Operand 182 states and 284 transitions.
[2025-03-08 06:04:18,058 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2025-03-08 06:04:18,058 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:04:18,059 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:04:18,059 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 06:04:18,059 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:04:18,059 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:04:18,059 INFO  L85        PathProgramCache]: Analyzing trace with hash -1175250762, now seen corresponding path program 1 times
[2025-03-08 06:04:18,059 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:04:18,059 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016394176]
[2025-03-08 06:04:18,059 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:04:18,060 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:04:18,073 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes.
[2025-03-08 06:04:18,085 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements.
[2025-03-08 06:04:18,086 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:04:18,086 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:04:18,154 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:04:18,155 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:04:18,155 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016394176]
[2025-03-08 06:04:18,155 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016394176] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:04:18,155 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:04:18,155 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 06:04:18,155 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924416225]
[2025-03-08 06:04:18,155 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:04:18,156 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 06:04:18,156 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:04:18,156 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 06:04:18,156 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 06:04:18,157 INFO  L87              Difference]: Start difference. First operand 182 states and 284 transitions. Second operand  has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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-08 06:04:18,183 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:04:18,184 INFO  L93              Difference]: Finished difference Result 410 states and 668 transitions.
[2025-03-08 06:04:18,184 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 06:04:18,184 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68
[2025-03-08 06:04:18,185 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:04:18,186 INFO  L225             Difference]: With dead ends: 410
[2025-03-08 06:04:18,189 INFO  L226             Difference]: Without dead ends: 288
[2025-03-08 06:04:18,189 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-08 06:04:18,190 INFO  L435           NwaCegarLoop]: 191 mSDtfsCounter, 91 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 06:04:18,190 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 350 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 06:04:18,191 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 288 states.
[2025-03-08 06:04:18,203 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 286.
[2025-03-08 06:04:18,205 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 286 states, 285 states have (on average 1.6105263157894736) internal successors, (459), 285 states have internal predecessors, (459), 0 states have call successors, (0), 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-08 06:04:18,208 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 459 transitions.
[2025-03-08 06:04:18,208 INFO  L78                 Accepts]: Start accepts. Automaton has 286 states and 459 transitions. Word has length 68
[2025-03-08 06:04:18,208 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:04:18,208 INFO  L471      AbstractCegarLoop]: Abstraction has 286 states and 459 transitions.
[2025-03-08 06:04:18,208 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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-08 06:04:18,208 INFO  L276                IsEmpty]: Start isEmpty. Operand 286 states and 459 transitions.
[2025-03-08 06:04:18,210 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2025-03-08 06:04:18,210 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:04:18,210 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:04:18,210 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 06:04:18,210 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:04:18,210 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:04:18,211 INFO  L85        PathProgramCache]: Analyzing trace with hash 270481819, now seen corresponding path program 1 times
[2025-03-08 06:04:18,211 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:04:18,211 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875698041]
[2025-03-08 06:04:18,211 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:04:18,211 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:04:18,225 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes.
[2025-03-08 06:04:18,240 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements.
[2025-03-08 06:04:18,241 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:04:18,241 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:04:18,321 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-08 06:04:18,321 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:04:18,321 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875698041]
[2025-03-08 06:04:18,321 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875698041] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:04:18,321 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:04:18,321 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 06:04:18,321 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627754561]
[2025-03-08 06:04:18,321 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:04:18,321 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 06:04:18,321 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:04:18,322 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 06:04:18,322 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 06:04:18,322 INFO  L87              Difference]: Start difference. First operand 286 states and 459 transitions. Second operand  has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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-08 06:04:18,350 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:04:18,350 INFO  L93              Difference]: Finished difference Result 706 states and 1165 transitions.
[2025-03-08 06:04:18,350 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 06:04:18,351 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70
[2025-03-08 06:04:18,351 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:04:18,353 INFO  L225             Difference]: With dead ends: 706
[2025-03-08 06:04:18,353 INFO  L226             Difference]: Without dead ends: 480
[2025-03-08 06:04:18,354 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-08 06:04:18,354 INFO  L435           NwaCegarLoop]: 191 mSDtfsCounter, 85 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 06:04:18,354 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 351 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 06:04:18,358 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 480 states.
[2025-03-08 06:04:18,375 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 478.
[2025-03-08 06:04:18,379 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 478 states, 477 states have (on average 1.6331236897274632) internal successors, (779), 477 states have internal predecessors, (779), 0 states have call successors, (0), 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-08 06:04:18,381 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 779 transitions.
[2025-03-08 06:04:18,381 INFO  L78                 Accepts]: Start accepts. Automaton has 478 states and 779 transitions. Word has length 70
[2025-03-08 06:04:18,381 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:04:18,381 INFO  L471      AbstractCegarLoop]: Abstraction has 478 states and 779 transitions.
[2025-03-08 06:04:18,381 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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-08 06:04:18,381 INFO  L276                IsEmpty]: Start isEmpty. Operand 478 states and 779 transitions.
[2025-03-08 06:04:18,386 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2025-03-08 06:04:18,386 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:04:18,386 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:04:18,386 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 06:04:18,386 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:04:18,387 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:04:18,387 INFO  L85        PathProgramCache]: Analyzing trace with hash -688620832, now seen corresponding path program 1 times
[2025-03-08 06:04:18,387 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:04:18,387 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057144727]
[2025-03-08 06:04:18,387 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:04:18,387 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:04:18,402 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes.
[2025-03-08 06:04:18,413 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements.
[2025-03-08 06:04:18,413 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:04:18,414 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:04:18,534 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-08 06:04:18,534 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:04:18,534 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057144727]
[2025-03-08 06:04:18,534 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057144727] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:04:18,534 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:04:18,534 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 06:04:18,535 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923608042]
[2025-03-08 06:04:18,535 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:04:18,535 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 06:04:18,535 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:04:18,535 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 06:04:18,535 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 06:04:18,536 INFO  L87              Difference]: Start difference. First operand 478 states and 779 transitions. Second operand  has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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-08 06:04:18,695 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:04:18,695 INFO  L93              Difference]: Finished difference Result 2018 states and 3397 transitions.
[2025-03-08 06:04:18,696 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 06:04:18,696 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72
[2025-03-08 06:04:18,696 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:04:18,702 INFO  L225             Difference]: With dead ends: 2018
[2025-03-08 06:04:18,702 INFO  L226             Difference]: Without dead ends: 1600
[2025-03-08 06:04:18,704 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2025-03-08 06:04:18,704 INFO  L435           NwaCegarLoop]: 189 mSDtfsCounter, 658 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 06:04:18,704 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1281 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 06:04:18,706 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1600 states.
[2025-03-08 06:04:18,733 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 843.
[2025-03-08 06:04:18,734 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 843 states, 842 states have (on average 1.652019002375297) internal successors, (1391), 842 states have internal predecessors, (1391), 0 states have call successors, (0), 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-08 06:04:18,737 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1391 transitions.
[2025-03-08 06:04:18,737 INFO  L78                 Accepts]: Start accepts. Automaton has 843 states and 1391 transitions. Word has length 72
[2025-03-08 06:04:18,737 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:04:18,737 INFO  L471      AbstractCegarLoop]: Abstraction has 843 states and 1391 transitions.
[2025-03-08 06:04:18,738 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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-08 06:04:18,738 INFO  L276                IsEmpty]: Start isEmpty. Operand 843 states and 1391 transitions.
[2025-03-08 06:04:18,740 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2025-03-08 06:04:18,740 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:04:18,740 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:04:18,740 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 06:04:18,740 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:04:18,741 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:04:18,741 INFO  L85        PathProgramCache]: Analyzing trace with hash 178445883, now seen corresponding path program 1 times
[2025-03-08 06:04:18,741 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:04:18,741 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646363958]
[2025-03-08 06:04:18,741 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:04:18,741 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:04:18,758 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes.
[2025-03-08 06:04:18,771 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements.
[2025-03-08 06:04:18,772 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:04:18,773 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:04:18,847 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-08 06:04:18,847 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:04:18,848 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646363958]
[2025-03-08 06:04:18,848 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646363958] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:04:18,848 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:04:18,848 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 06:04:18,848 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139297124]
[2025-03-08 06:04:18,848 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:04:18,848 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 06:04:18,848 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:04:18,849 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 06:04:18,849 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 06:04:18,849 INFO  L87              Difference]: Start difference. First operand 843 states and 1391 transitions. Second operand  has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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-08 06:04:18,935 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:04:18,936 INFO  L93              Difference]: Finished difference Result 2444 states and 4106 transitions.
[2025-03-08 06:04:18,936 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 06:04:18,936 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73
[2025-03-08 06:04:18,936 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:04:18,942 INFO  L225             Difference]: With dead ends: 2444
[2025-03-08 06:04:18,942 INFO  L226             Difference]: Without dead ends: 1661
[2025-03-08 06:04:18,943 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 06:04:18,943 INFO  L435           NwaCegarLoop]: 194 mSDtfsCounter, 331 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 06:04:18,943 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 624 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 06:04:18,945 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1661 states.
[2025-03-08 06:04:18,973 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1243.
[2025-03-08 06:04:18,975 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1243 states, 1242 states have (on average 1.6610305958132046) internal successors, (2063), 1242 states have internal predecessors, (2063), 0 states have call successors, (0), 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-08 06:04:18,978 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 2063 transitions.
[2025-03-08 06:04:18,979 INFO  L78                 Accepts]: Start accepts. Automaton has 1243 states and 2063 transitions. Word has length 73
[2025-03-08 06:04:18,979 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:04:18,979 INFO  L471      AbstractCegarLoop]: Abstraction has 1243 states and 2063 transitions.
[2025-03-08 06:04:18,979 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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-08 06:04:18,979 INFO  L276                IsEmpty]: Start isEmpty. Operand 1243 states and 2063 transitions.
[2025-03-08 06:04:18,980 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2025-03-08 06:04:18,980 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:04:18,980 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:04:18,981 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 06:04:18,981 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:04:18,981 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:04:18,981 INFO  L85        PathProgramCache]: Analyzing trace with hash -1473780398, now seen corresponding path program 1 times
[2025-03-08 06:04:18,981 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:04:18,981 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113374920]
[2025-03-08 06:04:18,981 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:04:18,982 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:04:18,993 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes.
[2025-03-08 06:04:19,002 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements.
[2025-03-08 06:04:19,003 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:04:19,003 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:04:19,062 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:04:19,062 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:04:19,062 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113374920]
[2025-03-08 06:04:19,062 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113374920] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:04:19,062 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:04:19,062 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 06:04:19,062 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975696130]
[2025-03-08 06:04:19,062 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:04:19,062 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 06:04:19,062 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:04:19,063 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 06:04:19,063 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 06:04:19,063 INFO  L87              Difference]: Start difference. First operand 1243 states and 2063 transitions. Second operand  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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-08 06:04:19,099 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:04:19,099 INFO  L93              Difference]: Finished difference Result 2758 states and 4633 transitions.
[2025-03-08 06:04:19,100 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 06:04:19,101 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74
[2025-03-08 06:04:19,101 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:04:19,106 INFO  L225             Difference]: With dead ends: 2758
[2025-03-08 06:04:19,106 INFO  L226             Difference]: Without dead ends: 1900
[2025-03-08 06:04:19,110 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-08 06:04:19,111 INFO  L435           NwaCegarLoop]: 270 mSDtfsCounter, 98 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 06:04:19,111 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 437 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 06:04:19,113 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1900 states.
[2025-03-08 06:04:19,158 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1900 to 1898.
[2025-03-08 06:04:19,161 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1898 states, 1897 states have (on average 1.6615709014233) internal successors, (3152), 1897 states have internal predecessors, (3152), 0 states have call successors, (0), 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-08 06:04:19,169 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 3152 transitions.
[2025-03-08 06:04:19,169 INFO  L78                 Accepts]: Start accepts. Automaton has 1898 states and 3152 transitions. Word has length 74
[2025-03-08 06:04:19,169 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:04:19,169 INFO  L471      AbstractCegarLoop]: Abstraction has 1898 states and 3152 transitions.
[2025-03-08 06:04:19,169 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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-08 06:04:19,169 INFO  L276                IsEmpty]: Start isEmpty. Operand 1898 states and 3152 transitions.
[2025-03-08 06:04:19,170 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2025-03-08 06:04:19,170 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:04:19,170 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:04:19,171 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 06:04:19,171 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:04:19,171 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:04:19,171 INFO  L85        PathProgramCache]: Analyzing trace with hash 843976882, now seen corresponding path program 1 times
[2025-03-08 06:04:19,171 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:04:19,171 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312523812]
[2025-03-08 06:04:19,171 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:04:19,171 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:04:19,185 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes.
[2025-03-08 06:04:19,197 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements.
[2025-03-08 06:04:19,198 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:04:19,198 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:04:19,245 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-08 06:04:19,245 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:04:19,245 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312523812]
[2025-03-08 06:04:19,245 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312523812] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:04:19,245 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:04:19,245 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 06:04:19,245 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213808764]
[2025-03-08 06:04:19,245 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:04:19,245 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 06:04:19,245 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:04:19,246 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 06:04:19,246 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 06:04:19,246 INFO  L87              Difference]: Start difference. First operand 1898 states and 3152 transitions. Second operand  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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-08 06:04:19,304 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:04:19,304 INFO  L93              Difference]: Finished difference Result 3742 states and 6231 transitions.
[2025-03-08 06:04:19,305 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 06:04:19,305 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74
[2025-03-08 06:04:19,305 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:04:19,314 INFO  L225             Difference]: With dead ends: 3742
[2025-03-08 06:04:19,314 INFO  L226             Difference]: Without dead ends: 2684
[2025-03-08 06:04:19,316 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-08 06:04:19,316 INFO  L435           NwaCegarLoop]: 267 mSDtfsCounter, 92 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 06:04:19,316 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 435 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 06:04:19,318 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2684 states.
[2025-03-08 06:04:19,372 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2682.
[2025-03-08 06:04:19,376 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2682 states, 2681 states have (on average 1.6508765386049982) internal successors, (4426), 2681 states have internal predecessors, (4426), 0 states have call successors, (0), 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-08 06:04:19,386 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 4426 transitions.
[2025-03-08 06:04:19,387 INFO  L78                 Accepts]: Start accepts. Automaton has 2682 states and 4426 transitions. Word has length 74
[2025-03-08 06:04:19,387 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:04:19,387 INFO  L471      AbstractCegarLoop]: Abstraction has 2682 states and 4426 transitions.
[2025-03-08 06:04:19,387 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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-08 06:04:19,388 INFO  L276                IsEmpty]: Start isEmpty. Operand 2682 states and 4426 transitions.
[2025-03-08 06:04:19,389 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2025-03-08 06:04:19,389 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:04:19,389 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:04:19,389 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 06:04:19,391 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:04:19,391 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:04:19,391 INFO  L85        PathProgramCache]: Analyzing trace with hash 1285863230, now seen corresponding path program 1 times
[2025-03-08 06:04:19,391 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:04:19,391 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531676930]
[2025-03-08 06:04:19,392 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:04:19,392 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:04:19,404 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes.
[2025-03-08 06:04:19,417 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements.
[2025-03-08 06:04:19,417 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:04:19,417 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:04:19,483 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-08 06:04:19,483 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:04:19,483 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531676930]
[2025-03-08 06:04:19,483 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531676930] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:04:19,483 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:04:19,483 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 06:04:19,483 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693931052]
[2025-03-08 06:04:19,483 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:04:19,484 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 06:04:19,484 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:04:19,484 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 06:04:19,484 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 06:04:19,484 INFO  L87              Difference]: Start difference. First operand 2682 states and 4426 transitions. Second operand  has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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-08 06:04:19,628 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:04:19,628 INFO  L93              Difference]: Finished difference Result 8478 states and 14054 transitions.
[2025-03-08 06:04:19,629 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 06:04:19,629 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74
[2025-03-08 06:04:19,629 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:04:19,647 INFO  L225             Difference]: With dead ends: 8478
[2025-03-08 06:04:19,647 INFO  L226             Difference]: Without dead ends: 5866
[2025-03-08 06:04:19,650 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 06:04:19,650 INFO  L435           NwaCegarLoop]: 182 mSDtfsCounter, 330 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 06:04:19,651 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 614 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 06:04:19,655 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5866 states.
[2025-03-08 06:04:19,738 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5866 to 4255.
[2025-03-08 06:04:19,745 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4255 states, 4254 states have (on average 1.6424541607898449) internal successors, (6987), 4254 states have internal predecessors, (6987), 0 states have call successors, (0), 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-08 06:04:19,760 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4255 states to 4255 states and 6987 transitions.
[2025-03-08 06:04:19,761 INFO  L78                 Accepts]: Start accepts. Automaton has 4255 states and 6987 transitions. Word has length 74
[2025-03-08 06:04:19,761 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:04:19,761 INFO  L471      AbstractCegarLoop]: Abstraction has 4255 states and 6987 transitions.
[2025-03-08 06:04:19,761 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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-08 06:04:19,761 INFO  L276                IsEmpty]: Start isEmpty. Operand 4255 states and 6987 transitions.
[2025-03-08 06:04:19,762 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2025-03-08 06:04:19,762 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:04:19,762 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:04:19,762 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-08 06:04:19,762 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:04:19,763 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:04:19,763 INFO  L85        PathProgramCache]: Analyzing trace with hash 835732498, now seen corresponding path program 1 times
[2025-03-08 06:04:19,763 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:04:19,763 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393833310]
[2025-03-08 06:04:19,763 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:04:19,763 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:04:19,772 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes.
[2025-03-08 06:04:19,780 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements.
[2025-03-08 06:04:19,780 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:04:19,780 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:04:19,815 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-08 06:04:19,816 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:04:19,816 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393833310]
[2025-03-08 06:04:19,816 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393833310] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:04:19,816 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:04:19,816 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 06:04:19,816 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759383386]
[2025-03-08 06:04:19,816 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:04:19,816 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 06:04:19,816 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:04:19,817 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 06:04:19,817 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 06:04:19,817 INFO  L87              Difference]: Start difference. First operand 4255 states and 6987 transitions. Second operand  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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-08 06:04:19,900 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:04:19,900 INFO  L93              Difference]: Finished difference Result 8507 states and 13972 transitions.
[2025-03-08 06:04:19,901 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 06:04:19,901 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74
[2025-03-08 06:04:19,901 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:04:19,919 INFO  L225             Difference]: With dead ends: 8507
[2025-03-08 06:04:19,920 INFO  L226             Difference]: Without dead ends: 6035
[2025-03-08 06:04:19,924 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-08 06:04:19,925 INFO  L435           NwaCegarLoop]: 255 mSDtfsCounter, 86 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 06:04:19,925 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 424 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 06:04:19,929 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6035 states.
[2025-03-08 06:04:20,033 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6035 to 6033.
[2025-03-08 06:04:20,042 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6033 states, 6032 states have (on average 1.626160477453581) internal successors, (9809), 6032 states have internal predecessors, (9809), 0 states have call successors, (0), 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-08 06:04:20,064 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6033 states to 6033 states and 9809 transitions.
[2025-03-08 06:04:20,065 INFO  L78                 Accepts]: Start accepts. Automaton has 6033 states and 9809 transitions. Word has length 74
[2025-03-08 06:04:20,065 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:04:20,065 INFO  L471      AbstractCegarLoop]: Abstraction has 6033 states and 9809 transitions.
[2025-03-08 06:04:20,066 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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-08 06:04:20,066 INFO  L276                IsEmpty]: Start isEmpty. Operand 6033 states and 9809 transitions.
[2025-03-08 06:04:20,066 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2025-03-08 06:04:20,066 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:04:20,066 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:04:20,066 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-08 06:04:20,067 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:04:20,067 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:04:20,067 INFO  L85        PathProgramCache]: Analyzing trace with hash 1254215577, now seen corresponding path program 1 times
[2025-03-08 06:04:20,067 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:04:20,067 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194193526]
[2025-03-08 06:04:20,067 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:04:20,067 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:04:20,077 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes.
[2025-03-08 06:04:20,085 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements.
[2025-03-08 06:04:20,086 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:04:20,086 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:04:20,186 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-08 06:04:20,186 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:04:20,186 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194193526]
[2025-03-08 06:04:20,186 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194193526] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:04:20,186 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:04:20,186 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 06:04:20,187 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469482515]
[2025-03-08 06:04:20,187 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:04:20,187 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 06:04:20,188 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:04:20,188 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 06:04:20,188 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 06:04:20,188 INFO  L87              Difference]: Start difference. First operand 6033 states and 9809 transitions. Second operand  has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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-08 06:04:20,370 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:04:20,370 INFO  L93              Difference]: Finished difference Result 19008 states and 30980 transitions.
[2025-03-08 06:04:20,371 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 06:04:20,371 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75
[2025-03-08 06:04:20,371 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:04:20,402 INFO  L225             Difference]: With dead ends: 19008
[2025-03-08 06:04:20,402 INFO  L226             Difference]: Without dead ends: 13053
[2025-03-08 06:04:20,413 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 06:04:20,414 INFO  L435           NwaCegarLoop]: 182 mSDtfsCounter, 328 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 06:04:20,414 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 616 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 06:04:20,425 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13053 states.
[2025-03-08 06:04:20,614 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13053 to 9500.
[2025-03-08 06:04:20,630 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9500 states, 9499 states have (on average 1.6144857353405622) internal successors, (15336), 9499 states have internal predecessors, (15336), 0 states have call successors, (0), 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-08 06:04:20,723 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9500 states to 9500 states and 15336 transitions.
[2025-03-08 06:04:20,724 INFO  L78                 Accepts]: Start accepts. Automaton has 9500 states and 15336 transitions. Word has length 75
[2025-03-08 06:04:20,724 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:04:20,724 INFO  L471      AbstractCegarLoop]: Abstraction has 9500 states and 15336 transitions.
[2025-03-08 06:04:20,724 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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-08 06:04:20,724 INFO  L276                IsEmpty]: Start isEmpty. Operand 9500 states and 15336 transitions.
[2025-03-08 06:04:20,725 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-03-08 06:04:20,725 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:04:20,725 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:04:20,725 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-08 06:04:20,725 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:04:20,726 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:04:20,726 INFO  L85        PathProgramCache]: Analyzing trace with hash -136437513, now seen corresponding path program 1 times
[2025-03-08 06:04:20,726 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:04:20,726 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382819401]
[2025-03-08 06:04:20,726 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:04:20,726 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:04:20,736 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-03-08 06:04:20,745 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-03-08 06:04:20,746 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:04:20,746 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:04:20,911 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-08 06:04:20,911 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:04:20,912 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382819401]
[2025-03-08 06:04:20,912 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382819401] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:04:20,912 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:04:20,912 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 06:04:20,912 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078518263]
[2025-03-08 06:04:20,912 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:04:20,912 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 06:04:20,913 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:04:20,913 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 06:04:20,913 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 06:04:20,914 INFO  L87              Difference]: Start difference. First operand 9500 states and 15336 transitions. Second operand  has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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-08 06:04:21,071 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:04:21,071 INFO  L93              Difference]: Finished difference Result 18924 states and 30569 transitions.
[2025-03-08 06:04:21,072 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 06:04:21,072 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77
[2025-03-08 06:04:21,073 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:04:21,093 INFO  L225             Difference]: With dead ends: 18924
[2025-03-08 06:04:21,094 INFO  L226             Difference]: Without dead ends: 9502
[2025-03-08 06:04:21,106 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2025-03-08 06:04:21,107 INFO  L435           NwaCegarLoop]: 188 mSDtfsCounter, 86 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 06:04:21,107 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 668 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 06:04:21,114 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9502 states.
[2025-03-08 06:04:21,353 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9502 to 9500.
[2025-03-08 06:04:21,369 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9500 states, 9499 states have (on average 1.6013264554163595) internal successors, (15211), 9499 states have internal predecessors, (15211), 0 states have call successors, (0), 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-08 06:04:21,390 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9500 states to 9500 states and 15211 transitions.
[2025-03-08 06:04:21,392 INFO  L78                 Accepts]: Start accepts. Automaton has 9500 states and 15211 transitions. Word has length 77
[2025-03-08 06:04:21,392 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:04:21,392 INFO  L471      AbstractCegarLoop]: Abstraction has 9500 states and 15211 transitions.
[2025-03-08 06:04:21,392 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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-08 06:04:21,392 INFO  L276                IsEmpty]: Start isEmpty. Operand 9500 states and 15211 transitions.
[2025-03-08 06:04:21,393 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2025-03-08 06:04:21,393 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:04:21,393 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:04:21,393 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-08 06:04:21,393 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:04:21,393 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:04:21,394 INFO  L85        PathProgramCache]: Analyzing trace with hash 95490263, now seen corresponding path program 1 times
[2025-03-08 06:04:21,394 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:04:21,394 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816854700]
[2025-03-08 06:04:21,394 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:04:21,394 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:04:21,405 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes.
[2025-03-08 06:04:21,416 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements.
[2025-03-08 06:04:21,416 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:04:21,416 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:04:21,562 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-08 06:04:21,562 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:04:21,562 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816854700]
[2025-03-08 06:04:21,562 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816854700] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:04:21,562 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:04:21,563 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 06:04:21,563 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654917791]
[2025-03-08 06:04:21,563 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:04:21,563 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 06:04:21,563 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:04:21,563 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 06:04:21,563 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 06:04:21,563 INFO  L87              Difference]: Start difference. First operand 9500 states and 15211 transitions. Second operand  has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:04:21,834 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:04:21,834 INFO  L93              Difference]: Finished difference Result 27212 states and 43717 transitions.
[2025-03-08 06:04:21,834 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 06:04:21,835 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80
[2025-03-08 06:04:21,835 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:04:21,870 INFO  L225             Difference]: With dead ends: 27212
[2025-03-08 06:04:21,870 INFO  L226             Difference]: Without dead ends: 17790
[2025-03-08 06:04:21,885 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2025-03-08 06:04:21,885 INFO  L435           NwaCegarLoop]: 183 mSDtfsCounter, 84 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 06:04:21,886 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 678 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 06:04:21,903 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 17790 states.
[2025-03-08 06:04:22,178 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 17790 to 17788.
[2025-03-08 06:04:22,205 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 17788 states, 17787 states have (on average 1.5865519761623659) internal successors, (28220), 17787 states have internal predecessors, (28220), 0 states have call successors, (0), 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-08 06:04:22,241 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17788 states to 17788 states and 28220 transitions.
[2025-03-08 06:04:22,243 INFO  L78                 Accepts]: Start accepts. Automaton has 17788 states and 28220 transitions. Word has length 80
[2025-03-08 06:04:22,243 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:04:22,243 INFO  L471      AbstractCegarLoop]: Abstraction has 17788 states and 28220 transitions.
[2025-03-08 06:04:22,243 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:04:22,243 INFO  L276                IsEmpty]: Start isEmpty. Operand 17788 states and 28220 transitions.
[2025-03-08 06:04:22,244 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2025-03-08 06:04:22,244 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:04:22,244 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 06:04:22,244 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-08 06:04:22,244 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:04:22,244 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:04:22,244 INFO  L85        PathProgramCache]: Analyzing trace with hash -1302384368, now seen corresponding path program 1 times
[2025-03-08 06:04:22,245 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:04:22,245 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095304004]
[2025-03-08 06:04:22,245 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:04:22,245 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:04:22,256 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes.
[2025-03-08 06:04:22,281 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements.
[2025-03-08 06:04:22,282 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:04:22,282 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:04:22,518 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-08 06:04:22,519 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:04:22,519 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095304004]
[2025-03-08 06:04:22,519 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095304004] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:04:22,519 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:04:22,519 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-08 06:04:22,519 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767912461]
[2025-03-08 06:04:22,519 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:04:22,519 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 06:04:22,520 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:04:22,520 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 06:04:22,520 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-03-08 06:04:22,520 INFO  L87              Difference]: Start difference. First operand 17788 states and 28220 transitions. Second operand  has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:04:22,736 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:04:22,736 INFO  L93              Difference]: Finished difference Result 18876 states and 29669 transitions.
[2025-03-08 06:04:22,737 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 06:04:22,737 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81
[2025-03-08 06:04:22,737 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:04:22,771 INFO  L225             Difference]: With dead ends: 18876
[2025-03-08 06:04:22,772 INFO  L226             Difference]: Without dead ends: 18874
[2025-03-08 06:04:22,775 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-03-08 06:04:22,776 INFO  L435           NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 06:04:22,776 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1291 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 06:04:22,786 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18874 states.
[2025-03-08 06:04:22,993 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18874 to 18874.
[2025-03-08 06:04:23,020 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18874 states, 18873 states have (on average 1.5523234249986753) internal successors, (29297), 18873 states have internal predecessors, (29297), 0 states have call successors, (0), 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-08 06:04:23,051 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18874 states to 18874 states and 29297 transitions.
[2025-03-08 06:04:23,052 INFO  L78                 Accepts]: Start accepts. Automaton has 18874 states and 29297 transitions. Word has length 81
[2025-03-08 06:04:23,052 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:04:23,052 INFO  L471      AbstractCegarLoop]: Abstraction has 18874 states and 29297 transitions.
[2025-03-08 06:04:23,053 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:04:23,053 INFO  L276                IsEmpty]: Start isEmpty. Operand 18874 states and 29297 transitions.
[2025-03-08 06:04:23,054 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 108
[2025-03-08 06:04:23,054 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:04:23,055 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-08 06:04:23,055 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-08 06:04:23,055 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:04:23,055 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:04:23,055 INFO  L85        PathProgramCache]: Analyzing trace with hash -1134624664, now seen corresponding path program 1 times
[2025-03-08 06:04:23,055 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:04:23,055 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848910242]
[2025-03-08 06:04:23,056 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:04:23,056 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:04:23,065 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes.
[2025-03-08 06:04:23,074 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements.
[2025-03-08 06:04:23,074 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:04:23,074 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:04:23,207 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-03-08 06:04:23,207 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:04:23,207 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848910242]
[2025-03-08 06:04:23,207 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848910242] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:04:23,207 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:04:23,208 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 06:04:23,208 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821441543]
[2025-03-08 06:04:23,208 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:04:23,208 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 06:04:23,208 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:04:23,209 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 06:04:23,209 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 06:04:23,209 INFO  L87              Difference]: Start difference. First operand 18874 states and 29297 transitions. Second operand  has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 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-08 06:04:23,510 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:04:23,510 INFO  L93              Difference]: Finished difference Result 46590 states and 72581 transitions.
[2025-03-08 06:04:23,510 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 06:04:23,511 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107
[2025-03-08 06:04:23,511 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:04:23,590 INFO  L225             Difference]: With dead ends: 46590
[2025-03-08 06:04:23,590 INFO  L226             Difference]: Without dead ends: 37348
[2025-03-08 06:04:23,613 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-03-08 06:04:23,614 INFO  L435           NwaCegarLoop]: 290 mSDtfsCounter, 408 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 06:04:23,614 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 890 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 06:04:23,642 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 37348 states.
[2025-03-08 06:04:24,189 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 37348 to 29098.
[2025-03-08 06:04:24,225 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 29098 states, 29097 states have (on average 1.5491975117709729) internal successors, (45077), 29097 states have internal predecessors, (45077), 0 states have call successors, (0), 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-08 06:04:24,279 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29098 states to 29098 states and 45077 transitions.
[2025-03-08 06:04:24,281 INFO  L78                 Accepts]: Start accepts. Automaton has 29098 states and 45077 transitions. Word has length 107
[2025-03-08 06:04:24,283 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:04:24,283 INFO  L471      AbstractCegarLoop]: Abstraction has 29098 states and 45077 transitions.
[2025-03-08 06:04:24,283 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 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-08 06:04:24,283 INFO  L276                IsEmpty]: Start isEmpty. Operand 29098 states and 45077 transitions.
[2025-03-08 06:04:24,285 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 108
[2025-03-08 06:04:24,285 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:04:24,285 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-08 06:04:24,285 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-08 06:04:24,285 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:04:24,286 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:04:24,286 INFO  L85        PathProgramCache]: Analyzing trace with hash 1183132616, now seen corresponding path program 1 times
[2025-03-08 06:04:24,286 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:04:24,286 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812666214]
[2025-03-08 06:04:24,286 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:04:24,286 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:04:24,298 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes.
[2025-03-08 06:04:24,310 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements.
[2025-03-08 06:04:24,311 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:04:24,311 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:04:24,417 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-03-08 06:04:24,417 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:04:24,417 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812666214]
[2025-03-08 06:04:24,417 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812666214] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:04:24,417 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:04:24,417 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 06:04:24,418 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94196882]
[2025-03-08 06:04:24,418 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:04:24,418 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 06:04:24,418 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:04:24,418 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 06:04:24,418 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 06:04:24,418 INFO  L87              Difference]: Start difference. First operand 29098 states and 45077 transitions. Second operand  has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 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-08 06:04:24,906 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:04:24,906 INFO  L93              Difference]: Finished difference Result 52282 states and 81451 transitions.
[2025-03-08 06:04:24,907 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 06:04:24,907 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107
[2025-03-08 06:04:24,907 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:04:25,005 INFO  L225             Difference]: With dead ends: 52282
[2025-03-08 06:04:25,005 INFO  L226             Difference]: Without dead ends: 43300
[2025-03-08 06:04:25,032 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-03-08 06:04:25,034 INFO  L435           NwaCegarLoop]: 294 mSDtfsCounter, 412 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 06:04:25,034 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 873 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 06:04:25,067 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 43300 states.
[2025-03-08 06:04:25,639 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 43300 to 39566.
[2025-03-08 06:04:25,687 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 39566 states, 39565 states have (on average 1.5505876405914318) internal successors, (61349), 39565 states have internal predecessors, (61349), 0 states have call successors, (0), 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-08 06:04:25,758 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39566 states to 39566 states and 61349 transitions.
[2025-03-08 06:04:25,761 INFO  L78                 Accepts]: Start accepts. Automaton has 39566 states and 61349 transitions. Word has length 107
[2025-03-08 06:04:25,761 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:04:25,761 INFO  L471      AbstractCegarLoop]: Abstraction has 39566 states and 61349 transitions.
[2025-03-08 06:04:25,761 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), 0 states have call successors, (0), 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-08 06:04:25,761 INFO  L276                IsEmpty]: Start isEmpty. Operand 39566 states and 61349 transitions.
[2025-03-08 06:04:25,763 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 108
[2025-03-08 06:04:25,763 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:04:25,763 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-08 06:04:25,763 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-08 06:04:25,763 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:04:25,764 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:04:25,764 INFO  L85        PathProgramCache]: Analyzing trace with hash 1174888232, now seen corresponding path program 1 times
[2025-03-08 06:04:25,764 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:04:25,764 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667196272]
[2025-03-08 06:04:25,764 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:04:25,764 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:04:25,774 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes.
[2025-03-08 06:04:25,789 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements.
[2025-03-08 06:04:25,790 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:04:25,790 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:04:25,965 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-03-08 06:04:25,966 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:04:25,966 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667196272]
[2025-03-08 06:04:25,966 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667196272] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:04:25,966 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:04:25,966 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 06:04:25,967 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354199587]
[2025-03-08 06:04:25,967 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:04:25,967 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 06:04:25,967 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:04:25,968 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 06:04:25,968 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 06:04:25,968 INFO  L87              Difference]: Start difference. First operand 39566 states and 61349 transitions. Second operand  has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:04:26,327 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:04:26,327 INFO  L93              Difference]: Finished difference Result 55906 states and 87091 transitions.
[2025-03-08 06:04:26,327 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 06:04:26,328 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107
[2025-03-08 06:04:26,328 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:04:26,426 INFO  L225             Difference]: With dead ends: 55906
[2025-03-08 06:04:26,427 INFO  L226             Difference]: Without dead ends: 46924
[2025-03-08 06:04:26,454 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-03-08 06:04:26,455 INFO  L435           NwaCegarLoop]: 295 mSDtfsCounter, 423 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 06:04:26,455 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 826 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 06:04:26,488 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 46924 states.
[2025-03-08 06:04:27,129 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 46924 to 45414.
[2025-03-08 06:04:27,175 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 45414 states, 45413 states have (on average 1.552440931010944) internal successors, (70501), 45413 states have internal predecessors, (70501), 0 states have call successors, (0), 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-08 06:04:27,259 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 45414 states to 45414 states and 70501 transitions.
[2025-03-08 06:04:27,262 INFO  L78                 Accepts]: Start accepts. Automaton has 45414 states and 70501 transitions. Word has length 107
[2025-03-08 06:04:27,263 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:04:27,263 INFO  L471      AbstractCegarLoop]: Abstraction has 45414 states and 70501 transitions.
[2025-03-08 06:04:27,263 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 06:04:27,263 INFO  L276                IsEmpty]: Start isEmpty. Operand 45414 states and 70501 transitions.
[2025-03-08 06:04:27,265 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 109
[2025-03-08 06:04:27,266 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:04:27,266 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-08 06:04:27,266 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-08 06:04:27,266 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:04:27,266 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:04:27,267 INFO  L85        PathProgramCache]: Analyzing trace with hash -762771021, now seen corresponding path program 1 times
[2025-03-08 06:04:27,267 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:04:27,267 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198571733]
[2025-03-08 06:04:27,267 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:04:27,267 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:04:27,277 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes.
[2025-03-08 06:04:27,287 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements.
[2025-03-08 06:04:27,287 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:04:27,287 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:04:27,355 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-03-08 06:04:27,356 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:04:27,356 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198571733]
[2025-03-08 06:04:27,356 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198571733] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:04:27,356 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:04:27,356 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 06:04:27,356 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092509395]
[2025-03-08 06:04:27,356 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:04:27,357 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 06:04:27,357 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:04:27,357 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 06:04:27,357 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 06:04:27,357 INFO  L87              Difference]: Start difference. First operand 45414 states and 70501 transitions. Second operand  has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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-08 06:04:27,906 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:04:27,906 INFO  L93              Difference]: Finished difference Result 74297 states and 115970 transitions.
[2025-03-08 06:04:27,907 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 06:04:27,907 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108
[2025-03-08 06:04:27,907 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:04:28,017 INFO  L225             Difference]: With dead ends: 74297
[2025-03-08 06:04:28,018 INFO  L226             Difference]: Without dead ends: 59103
[2025-03-08 06:04:28,036 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 06:04:28,037 INFO  L435           NwaCegarLoop]: 288 mSDtfsCounter, 171 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 06:04:28,037 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 639 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 06:04:28,073 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 59103 states.
[2025-03-08 06:04:28,968 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 59103 to 57595.
[2025-03-08 06:04:29,022 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 57595 states, 57594 states have (on average 1.5524360176407264) internal successors, (89411), 57594 states have internal predecessors, (89411), 0 states have call successors, (0), 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-08 06:04:29,122 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 57595 states to 57595 states and 89411 transitions.
[2025-03-08 06:04:29,125 INFO  L78                 Accepts]: Start accepts. Automaton has 57595 states and 89411 transitions. Word has length 108
[2025-03-08 06:04:29,125 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:04:29,125 INFO  L471      AbstractCegarLoop]: Abstraction has 57595 states and 89411 transitions.
[2025-03-08 06:04:29,125 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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-08 06:04:29,125 INFO  L276                IsEmpty]: Start isEmpty. Operand 57595 states and 89411 transitions.
[2025-03-08 06:04:29,127 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 109
[2025-03-08 06:04:29,127 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:04:29,127 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-08 06:04:29,128 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-08 06:04:29,128 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:04:29,128 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:04:29,128 INFO  L85        PathProgramCache]: Analyzing trace with hash -551420108, now seen corresponding path program 1 times
[2025-03-08 06:04:29,128 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:04:29,128 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617716942]
[2025-03-08 06:04:29,128 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:04:29,129 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:04:29,140 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes.
[2025-03-08 06:04:29,151 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements.
[2025-03-08 06:04:29,152 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:04:29,152 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:04:29,193 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-03-08 06:04:29,193 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:04:29,193 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617716942]
[2025-03-08 06:04:29,193 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617716942] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:04:29,193 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:04:29,194 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 06:04:29,194 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925654546]
[2025-03-08 06:04:29,194 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:04:29,195 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 06:04:29,195 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:04:29,195 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 06:04:29,195 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 06:04:29,195 INFO  L87              Difference]: Start difference. First operand 57595 states and 89411 transitions. Second operand  has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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-08 06:04:30,288 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:04:30,288 INFO  L93              Difference]: Finished difference Result 124861 states and 194477 transitions.
[2025-03-08 06:04:30,288 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 06:04:30,288 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108
[2025-03-08 06:04:30,289 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:04:30,433 INFO  L225             Difference]: With dead ends: 124861
[2025-03-08 06:04:30,434 INFO  L226             Difference]: Without dead ends: 97591
[2025-03-08 06:04:30,459 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-08 06:04:30,460 INFO  L435           NwaCegarLoop]: 192 mSDtfsCounter, 74 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 06:04:30,460 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 353 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 06:04:30,524 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 97591 states.
[2025-03-08 06:04:31,999 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 97591 to 97313.
[2025-03-08 06:04:32,074 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 97313 states, 97312 states have (on average 1.5516277540282801) internal successors, (150992), 97312 states have internal predecessors, (150992), 0 states have call successors, (0), 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-08 06:04:32,233 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 97313 states to 97313 states and 150992 transitions.
[2025-03-08 06:04:32,238 INFO  L78                 Accepts]: Start accepts. Automaton has 97313 states and 150992 transitions. Word has length 108
[2025-03-08 06:04:32,238 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:04:32,238 INFO  L471      AbstractCegarLoop]: Abstraction has 97313 states and 150992 transitions.
[2025-03-08 06:04:32,238 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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-08 06:04:32,238 INFO  L276                IsEmpty]: Start isEmpty. Operand 97313 states and 150992 transitions.
[2025-03-08 06:04:32,241 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2025-03-08 06:04:32,241 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:04:32,241 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-08 06:04:32,241 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-03-08 06:04:32,241 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:04:32,241 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:04:32,242 INFO  L85        PathProgramCache]: Analyzing trace with hash -435187069, now seen corresponding path program 1 times
[2025-03-08 06:04:32,242 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:04:32,242 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275349129]
[2025-03-08 06:04:32,242 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:04:32,242 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:04:32,251 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes.
[2025-03-08 06:04:32,259 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements.
[2025-03-08 06:04:32,259 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:04:32,260 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:04:32,295 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-08 06:04:32,296 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:04:32,296 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275349129]
[2025-03-08 06:04:32,296 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275349129] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:04:32,296 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:04:32,296 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 06:04:32,296 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830324195]
[2025-03-08 06:04:32,296 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:04:32,296 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 06:04:32,296 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:04:32,297 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 06:04:32,297 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 06:04:32,297 INFO  L87              Difference]: Start difference. First operand 97313 states and 150992 transitions. Second operand  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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-08 06:04:34,129 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:04:34,129 INFO  L93              Difference]: Finished difference Result 289637 states and 448427 transitions.
[2025-03-08 06:04:34,130 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 06:04:34,130 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109
[2025-03-08 06:04:34,130 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:04:34,494 INFO  L225             Difference]: With dead ends: 289637
[2025-03-08 06:04:34,494 INFO  L226             Difference]: Without dead ends: 192396
[2025-03-08 06:04:34,573 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-08 06:04:34,574 INFO  L435           NwaCegarLoop]: 249 mSDtfsCounter, 125 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 06:04:34,574 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 434 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 06:04:34,713 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 192396 states.
[2025-03-08 06:04:37,578 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 192396 to 192394.
[2025-03-08 06:04:37,733 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 192394 states, 192393 states have (on average 1.5349830815050443) internal successors, (295320), 192393 states have internal predecessors, (295320), 0 states have call successors, (0), 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-08 06:04:38,381 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 192394 states to 192394 states and 295320 transitions.
[2025-03-08 06:04:38,389 INFO  L78                 Accepts]: Start accepts. Automaton has 192394 states and 295320 transitions. Word has length 109
[2025-03-08 06:04:38,389 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:04:38,390 INFO  L471      AbstractCegarLoop]: Abstraction has 192394 states and 295320 transitions.
[2025-03-08 06:04:38,390 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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-08 06:04:38,390 INFO  L276                IsEmpty]: Start isEmpty. Operand 192394 states and 295320 transitions.
[2025-03-08 06:04:38,392 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2025-03-08 06:04:38,393 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:04:38,393 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-08 06:04:38,393 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-03-08 06:04:38,393 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:04:38,393 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:04:38,393 INFO  L85        PathProgramCache]: Analyzing trace with hash -343695613, now seen corresponding path program 1 times
[2025-03-08 06:04:38,393 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:04:38,393 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394659100]
[2025-03-08 06:04:38,393 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:04:38,393 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:04:38,401 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes.
[2025-03-08 06:04:38,408 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements.
[2025-03-08 06:04:38,409 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:04:38,409 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:04:38,438 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-08 06:04:38,438 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:04:38,438 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394659100]
[2025-03-08 06:04:38,438 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394659100] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:04:38,438 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:04:38,438 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 06:04:38,438 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080571441]
[2025-03-08 06:04:38,438 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:04:38,439 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 06:04:38,440 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:04:38,440 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 06:04:38,440 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 06:04:38,440 INFO  L87              Difference]: Start difference. First operand 192394 states and 295320 transitions. Second operand  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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-08 06:04:42,175 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 06:04:42,175 INFO  L93              Difference]: Finished difference Result 572619 states and 876937 transitions.
[2025-03-08 06:04:42,176 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 06:04:42,176 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109
[2025-03-08 06:04:42,176 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 06:04:42,903 INFO  L225             Difference]: With dead ends: 572619
[2025-03-08 06:04:42,904 INFO  L226             Difference]: Without dead ends: 380359
[2025-03-08 06:04:43,042 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-08 06:04:43,043 INFO  L435           NwaCegarLoop]: 275 mSDtfsCounter, 144 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 06:04:43,043 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 460 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 06:04:43,323 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 380359 states.
[2025-03-08 06:04:49,312 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 380359 to 380357.
[2025-03-08 06:04:49,650 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 380357 states, 380356 states have (on average 1.5179700070460305) internal successors, (577369), 380356 states have internal predecessors, (577369), 0 states have call successors, (0), 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-08 06:04:50,970 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 380357 states to 380357 states and 577369 transitions.
[2025-03-08 06:04:51,014 INFO  L78                 Accepts]: Start accepts. Automaton has 380357 states and 577369 transitions. Word has length 109
[2025-03-08 06:04:51,014 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 06:04:51,014 INFO  L471      AbstractCegarLoop]: Abstraction has 380357 states and 577369 transitions.
[2025-03-08 06:04:51,014 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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-08 06:04:51,014 INFO  L276                IsEmpty]: Start isEmpty. Operand 380357 states and 577369 transitions.
[2025-03-08 06:04:51,020 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2025-03-08 06:04:51,020 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 06:04:51,020 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-08 06:04:51,020 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-03-08 06:04:51,020 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 06:04:51,021 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 06:04:51,021 INFO  L85        PathProgramCache]: Analyzing trace with hash 1731023930, now seen corresponding path program 1 times
[2025-03-08 06:04:51,021 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 06:04:51,021 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328659100]
[2025-03-08 06:04:51,021 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 06:04:51,021 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 06:04:51,032 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes.
[2025-03-08 06:04:51,057 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements.
[2025-03-08 06:04:51,061 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 06:04:51,061 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 06:04:51,128 INFO  L134       CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 06:04:51,129 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 06:04:51,129 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328659100]
[2025-03-08 06:04:51,129 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328659100] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 06:04:51,129 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 06:04:51,129 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 06:04:51,129 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838009689]
[2025-03-08 06:04:51,129 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 06:04:51,129 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 06:04:51,129 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 06:04:51,130 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 06:04:51,130 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 06:04:51,130 INFO  L87              Difference]: Start difference. First operand 380357 states and 577369 transitions. Second operand  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)