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


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


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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0490559c2bf039cbe49bd5644a18ada08843fe5179dc7b178541a9c54e014b6c
[2025-02-05 16:11:48,808 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 16:11:48,814 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 16:11:48,815 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 16:11:48,816 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 16:11:48,816 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 16:11:48,817 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.UNBOUNDED.pals.c
[2025-02-05 16:11:50,247 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a01f333e/c651b67461ff48cbbff3a1b0f43dd4dc/FLAGc347481cb
[2025-02-05 16:11:50,545 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 16:11:50,545 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.UNBOUNDED.pals.c
[2025-02-05 16:11:50,555 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a01f333e/c651b67461ff48cbbff3a1b0f43dd4dc/FLAGc347481cb
[2025-02-05 16:11:50,844 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a01f333e/c651b67461ff48cbbff3a1b0f43dd4dc
[2025-02-05 16:11:50,846 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 16:11:50,847 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 16:11:50,848 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 16:11:50,848 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 16:11:50,853 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 16:11:50,854 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:11:50" (1/1) ...
[2025-02-05 16:11:50,855 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad736ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:50, skipping insertion in model container
[2025-02-05 16:11:50,856 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:11:50" (1/1) ...
[2025-02-05 16:11:50,879 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 16:11:51,069 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.UNBOUNDED.pals.c[12966,12979]
[2025-02-05 16:11:51,072 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 16:11:51,082 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 16:11:51,142 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.UNBOUNDED.pals.c[12966,12979]
[2025-02-05 16:11:51,142 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 16:11:51,155 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 16:11:51,156 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:51 WrapperNode
[2025-02-05 16:11:51,156 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 16:11:51,157 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 16:11:51,157 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 16:11:51,157 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 16:11:51,162 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:51" (1/1) ...
[2025-02-05 16:11:51,170 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:51" (1/1) ...
[2025-02-05 16:11:51,206 INFO  L138                Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 451
[2025-02-05 16:11:51,206 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 16:11:51,207 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 16:11:51,207 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 16:11:51,207 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 16:11:51,219 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:51" (1/1) ...
[2025-02-05 16:11:51,220 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:51" (1/1) ...
[2025-02-05 16:11:51,224 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:51" (1/1) ...
[2025-02-05 16:11:51,244 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-02-05 16:11:51,245 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:51" (1/1) ...
[2025-02-05 16:11:51,245 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:51" (1/1) ...
[2025-02-05 16:11:51,255 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:51" (1/1) ...
[2025-02-05 16:11:51,256 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:51" (1/1) ...
[2025-02-05 16:11:51,257 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:51" (1/1) ...
[2025-02-05 16:11:51,262 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:51" (1/1) ...
[2025-02-05 16:11:51,264 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 16:11:51,267 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 16:11:51,268 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 16:11:51,268 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 16:11:51,269 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:51" (1/1) ...
[2025-02-05 16:11:51,273 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 16:11:51,285 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 16:11:51,302 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-05 16:11:51,313 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-05 16:11:51,332 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 16:11:51,332 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 16:11:51,332 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 16:11:51,332 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 16:11:51,417 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 16:11:51,419 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 16:11:51,805 INFO  L?                        ?]: Removed 45 outVars from TransFormulas that were not future-live.
[2025-02-05 16:11:51,806 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 16:11:51,815 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 16:11:51,816 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 16:11:51,816 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:11:51 BoogieIcfgContainer
[2025-02-05 16:11:51,816 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 16:11:51,818 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 16:11:51,818 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 16:11:51,821 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 16:11:51,821 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:11:50" (1/3) ...
[2025-02-05 16:11:51,821 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f150ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:11:51, skipping insertion in model container
[2025-02-05 16:11:51,821 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:51" (2/3) ...
[2025-02-05 16:11:51,822 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f150ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:11:51, skipping insertion in model container
[2025-02-05 16:11:51,822 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:11:51" (3/3) ...
[2025-02-05 16:11:51,823 INFO  L128   eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.UNBOUNDED.pals.c
[2025-02-05 16:11:51,832 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 16:11:51,834 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.3.ufo.UNBOUNDED.pals.c that has 1 procedures, 124 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 16:11:51,867 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 16:11:51,874 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;@12ab237a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 16:11:51,875 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 16:11:51,878 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 124 states, 122 states have (on average 1.7704918032786885) internal successors, (216), 123 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:51,881 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2025-02-05 16:11:51,882 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:51,882 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-02-05 16:11:51,882 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:51,885 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:51,886 INFO  L85        PathProgramCache]: Analyzing trace with hash 2048131771, now seen corresponding path program 1 times
[2025-02-05 16:11:51,890 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:51,891 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569548551]
[2025-02-05 16:11:51,891 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:51,891 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:51,970 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes.
[2025-02-05 16:11:52,011 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements.
[2025-02-05 16:11:52,012 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:52,012 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:52,103 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:11:52,103 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:52,103 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569548551]
[2025-02-05 16:11:52,104 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569548551] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:52,104 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:52,104 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 16:11:52,105 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753661785]
[2025-02-05 16:11:52,106 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:52,108 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-02-05 16:11:52,108 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:52,120 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-02-05 16:11:52,120 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-05 16:11:52,122 INFO  L87              Difference]: Start difference. First operand  has 124 states, 122 states have (on average 1.7704918032786885) internal successors, (216), 123 states have internal predecessors, (216), 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 2 states, 2 states have (on average 18.5) internal successors, (37), 2 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-02-05 16:11:52,136 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:11:52,137 INFO  L93              Difference]: Finished difference Result 189 states and 328 transitions.
[2025-02-05 16:11:52,137 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-02-05 16:11:52,138 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 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-02-05 16:11:52,139 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:11:52,143 INFO  L225             Difference]: With dead ends: 189
[2025-02-05 16:11:52,144 INFO  L226             Difference]: Without dead ends: 121
[2025-02-05 16:11:52,146 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-05 16:11:52,147 INFO  L435           NwaCegarLoop]: 211 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:11:52,148 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:11:52,156 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 121 states.
[2025-02-05 16:11:52,167 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121.
[2025-02-05 16:11:52,168 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 121 states, 120 states have (on average 1.7583333333333333) internal successors, (211), 120 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:52,171 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 211 transitions.
[2025-02-05 16:11:52,172 INFO  L78                 Accepts]: Start accepts. Automaton has 121 states and 211 transitions. Word has length 37
[2025-02-05 16:11:52,172 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:11:52,172 INFO  L471      AbstractCegarLoop]: Abstraction has 121 states and 211 transitions.
[2025-02-05 16:11:52,173 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 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-02-05 16:11:52,173 INFO  L276                IsEmpty]: Start isEmpty. Operand 121 states and 211 transitions.
[2025-02-05 16:11:52,174 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2025-02-05 16:11:52,174 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:52,174 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-02-05 16:11:52,174 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 16:11:52,174 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:52,175 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:52,175 INFO  L85        PathProgramCache]: Analyzing trace with hash 1639307546, now seen corresponding path program 1 times
[2025-02-05 16:11:52,175 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:52,175 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729117551]
[2025-02-05 16:11:52,175 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:52,175 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:52,188 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes.
[2025-02-05 16:11:52,217 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements.
[2025-02-05 16:11:52,217 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:52,218 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:52,398 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:11:52,399 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:52,399 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729117551]
[2025-02-05 16:11:52,399 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729117551] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:52,400 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:52,400 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:11:52,400 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512785147]
[2025-02-05 16:11:52,400 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:52,401 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:11:52,402 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:52,403 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:11:52,403 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:11:52,403 INFO  L87              Difference]: Start difference. First operand 121 states and 211 transitions. 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-02-05 16:11:52,493 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:11:52,493 INFO  L93              Difference]: Finished difference Result 189 states and 324 transitions.
[2025-02-05 16:11:52,493 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:11:52,493 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-02-05 16:11:52,494 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:11:52,494 INFO  L225             Difference]: With dead ends: 189
[2025-02-05 16:11:52,494 INFO  L226             Difference]: Without dead ends: 121
[2025-02-05 16:11:52,495 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-02-05 16:11:52,495 INFO  L435           NwaCegarLoop]: 209 mSDtfsCounter, 0 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:11:52,495 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 804 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:11:52,496 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 121 states.
[2025-02-05 16:11:52,502 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121.
[2025-02-05 16:11:52,506 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 121 states, 120 states have (on average 1.5333333333333334) internal successors, (184), 120 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:52,506 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 184 transitions.
[2025-02-05 16:11:52,506 INFO  L78                 Accepts]: Start accepts. Automaton has 121 states and 184 transitions. Word has length 37
[2025-02-05 16:11:52,507 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:11:52,507 INFO  L471      AbstractCegarLoop]: Abstraction has 121 states and 184 transitions.
[2025-02-05 16:11:52,507 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-02-05 16:11:52,507 INFO  L276                IsEmpty]: Start isEmpty. Operand 121 states and 184 transitions.
[2025-02-05 16:11:52,508 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2025-02-05 16:11:52,508 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:52,508 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:11:52,508 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 16:11:52,508 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:52,511 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:52,511 INFO  L85        PathProgramCache]: Analyzing trace with hash -2140284192, now seen corresponding path program 1 times
[2025-02-05 16:11:52,511 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:52,511 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433580529]
[2025-02-05 16:11:52,511 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:52,511 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:52,530 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes.
[2025-02-05 16:11:52,585 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements.
[2025-02-05 16:11:52,587 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:52,591 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:52,687 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:11:52,687 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:52,687 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433580529]
[2025-02-05 16:11:52,687 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433580529] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:52,687 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:52,687 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:11:52,687 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646164436]
[2025-02-05 16:11:52,688 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:52,688 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:11:52,688 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:52,688 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:11:52,688 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:11:52,688 INFO  L87              Difference]: Start difference. First operand 121 states and 184 transitions. Second operand  has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:52,748 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:11:52,748 INFO  L93              Difference]: Finished difference Result 240 states and 385 transitions.
[2025-02-05 16:11:52,749 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:11:52,749 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 63
[2025-02-05 16:11:52,750 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:11:52,750 INFO  L225             Difference]: With dead ends: 240
[2025-02-05 16:11:52,752 INFO  L226             Difference]: Without dead ends: 176
[2025-02-05 16:11:52,753 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-02-05 16:11:52,754 INFO  L435           NwaCegarLoop]: 178 mSDtfsCounter, 83 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:11:52,754 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 320 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:11:52,756 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 176 states.
[2025-02-05 16:11:52,767 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 173.
[2025-02-05 16:11:52,772 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 173 states, 172 states have (on average 1.558139534883721) internal successors, (268), 172 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:52,773 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 268 transitions.
[2025-02-05 16:11:52,776 INFO  L78                 Accepts]: Start accepts. Automaton has 173 states and 268 transitions. Word has length 63
[2025-02-05 16:11:52,776 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:11:52,776 INFO  L471      AbstractCegarLoop]: Abstraction has 173 states and 268 transitions.
[2025-02-05 16:11:52,776 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:52,776 INFO  L276                IsEmpty]: Start isEmpty. Operand 173 states and 268 transitions.
[2025-02-05 16:11:52,777 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-02-05 16:11:52,777 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:52,777 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]
[2025-02-05 16:11:52,778 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 16:11:52,778 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:52,778 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:52,779 INFO  L85        PathProgramCache]: Analyzing trace with hash 54242178, now seen corresponding path program 1 times
[2025-02-05 16:11:52,779 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:52,779 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881460839]
[2025-02-05 16:11:52,779 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:52,780 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:52,793 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-02-05 16:11:52,817 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-02-05 16:11:52,818 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:52,818 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:52,927 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:11:52,927 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:52,927 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881460839]
[2025-02-05 16:11:52,927 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881460839] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:52,928 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:52,928 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:11:52,928 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996709155]
[2025-02-05 16:11:52,928 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:52,928 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:11:52,928 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:52,929 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:11:52,929 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:11:52,929 INFO  L87              Difference]: Start difference. First operand 173 states and 268 transitions. Second operand  has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:52,953 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:11:52,953 INFO  L93              Difference]: Finished difference Result 391 states and 628 transitions.
[2025-02-05 16:11:52,954 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:11:52,954 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 65
[2025-02-05 16:11:52,954 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:11:52,955 INFO  L225             Difference]: With dead ends: 391
[2025-02-05 16:11:52,955 INFO  L226             Difference]: Without dead ends: 275
[2025-02-05 16:11:52,956 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-02-05 16:11:52,956 INFO  L435           NwaCegarLoop]: 181 mSDtfsCounter, 85 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:11:52,957 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 332 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:11:52,957 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 275 states.
[2025-02-05 16:11:52,964 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 271.
[2025-02-05 16:11:52,965 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 271 states, 270 states have (on average 1.5851851851851853) internal successors, (428), 270 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:52,966 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 428 transitions.
[2025-02-05 16:11:52,966 INFO  L78                 Accepts]: Start accepts. Automaton has 271 states and 428 transitions. Word has length 65
[2025-02-05 16:11:52,966 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:11:52,966 INFO  L471      AbstractCegarLoop]: Abstraction has 271 states and 428 transitions.
[2025-02-05 16:11:52,966 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:52,966 INFO  L276                IsEmpty]: Start isEmpty. Operand 271 states and 428 transitions.
[2025-02-05 16:11:52,968 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2025-02-05 16:11:52,968 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:52,968 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:11:52,968 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 16:11:52,968 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:52,968 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:52,969 INFO  L85        PathProgramCache]: Analyzing trace with hash 994011557, now seen corresponding path program 1 times
[2025-02-05 16:11:52,969 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:52,969 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974581313]
[2025-02-05 16:11:52,969 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:52,969 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:52,997 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes.
[2025-02-05 16:11:53,009 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements.
[2025-02-05 16:11:53,009 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:53,009 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:53,070 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:11:53,071 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:53,071 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974581313]
[2025-02-05 16:11:53,071 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974581313] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:53,071 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:53,071 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:11:53,071 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915426156]
[2025-02-05 16:11:53,071 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:53,071 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:11:53,072 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:53,072 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:11:53,072 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:11:53,072 INFO  L87              Difference]: Start difference. First operand 271 states and 428 transitions. Second operand  has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:53,097 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:11:53,097 INFO  L93              Difference]: Finished difference Result 671 states and 1082 transitions.
[2025-02-05 16:11:53,098 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:11:53,098 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 67
[2025-02-05 16:11:53,098 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:11:53,100 INFO  L225             Difference]: With dead ends: 671
[2025-02-05 16:11:53,100 INFO  L226             Difference]: Without dead ends: 457
[2025-02-05 16:11:53,100 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-02-05 16:11:53,101 INFO  L435           NwaCegarLoop]: 181 mSDtfsCounter, 79 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:11:53,101 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 333 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:11:53,102 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 457 states.
[2025-02-05 16:11:53,111 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 451.
[2025-02-05 16:11:53,112 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 451 states, 450 states have (on average 1.5911111111111111) internal successors, (716), 450 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:53,113 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 716 transitions.
[2025-02-05 16:11:53,113 INFO  L78                 Accepts]: Start accepts. Automaton has 451 states and 716 transitions. Word has length 67
[2025-02-05 16:11:53,114 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:11:53,114 INFO  L471      AbstractCegarLoop]: Abstraction has 451 states and 716 transitions.
[2025-02-05 16:11:53,114 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:53,114 INFO  L276                IsEmpty]: Start isEmpty. Operand 451 states and 716 transitions.
[2025-02-05 16:11:53,115 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 70
[2025-02-05 16:11:53,115 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:53,115 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]
[2025-02-05 16:11:53,115 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 16:11:53,115 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:53,116 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:53,116 INFO  L85        PathProgramCache]: Analyzing trace with hash 982943464, now seen corresponding path program 1 times
[2025-02-05 16:11:53,116 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:53,116 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944079691]
[2025-02-05 16:11:53,116 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:53,116 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:53,126 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes.
[2025-02-05 16:11:53,136 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements.
[2025-02-05 16:11:53,136 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:53,136 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:53,223 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:11:53,224 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:53,224 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944079691]
[2025-02-05 16:11:53,224 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944079691] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:53,224 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:53,225 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:11:53,225 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942678817]
[2025-02-05 16:11:53,225 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:53,225 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:11:53,227 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:53,228 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:11:53,228 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:11:53,228 INFO  L87              Difference]: Start difference. First operand 451 states and 716 transitions. Second operand  has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:53,394 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:11:53,395 INFO  L93              Difference]: Finished difference Result 1907 states and 3134 transitions.
[2025-02-05 16:11:53,395 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-05 16:11:53,395 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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 69
[2025-02-05 16:11:53,397 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:11:53,402 INFO  L225             Difference]: With dead ends: 1907
[2025-02-05 16:11:53,404 INFO  L226             Difference]: Without dead ends: 1513
[2025-02-05 16:11:53,405 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-02-05 16:11:53,406 INFO  L435           NwaCegarLoop]: 186 mSDtfsCounter, 617 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 1220 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-02-05 16:11:53,406 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 1220 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:11:53,408 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1513 states.
[2025-02-05 16:11:53,441 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 795.
[2025-02-05 16:11:53,442 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 795 states, 794 states have (on average 1.6083123425692696) internal successors, (1277), 794 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:53,449 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1277 transitions.
[2025-02-05 16:11:53,449 INFO  L78                 Accepts]: Start accepts. Automaton has 795 states and 1277 transitions. Word has length 69
[2025-02-05 16:11:53,449 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:11:53,449 INFO  L471      AbstractCegarLoop]: Abstraction has 795 states and 1277 transitions.
[2025-02-05 16:11:53,449 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:53,449 INFO  L276                IsEmpty]: Start isEmpty. Operand 795 states and 1277 transitions.
[2025-02-05 16:11:53,453 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2025-02-05 16:11:53,453 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:53,453 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-02-05 16:11:53,453 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 16:11:53,453 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:53,454 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:53,454 INFO  L85        PathProgramCache]: Analyzing trace with hash 457331507, now seen corresponding path program 1 times
[2025-02-05 16:11:53,454 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:53,454 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935287004]
[2025-02-05 16:11:53,454 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:53,454 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:53,478 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes.
[2025-02-05 16:11:53,494 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements.
[2025-02-05 16:11:53,494 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:53,494 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:53,593 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:11:53,594 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:53,595 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935287004]
[2025-02-05 16:11:53,595 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935287004] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:53,595 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:53,595 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 16:11:53,595 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050676476]
[2025-02-05 16:11:53,595 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:53,595 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 16:11:53,595 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:53,596 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 16:11:53,596 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 16:11:53,596 INFO  L87              Difference]: Start difference. First operand 795 states and 1277 transitions. Second operand  has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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-02-05 16:11:53,713 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:11:53,713 INFO  L93              Difference]: Finished difference Result 2309 states and 3785 transitions.
[2025-02-05 16:11:53,714 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 16:11:53,714 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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-02-05 16:11:53,714 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:11:53,720 INFO  L225             Difference]: With dead ends: 2309
[2025-02-05 16:11:53,721 INFO  L226             Difference]: Without dead ends: 1571
[2025-02-05 16:11:53,722 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:11:53,723 INFO  L435           NwaCegarLoop]: 182 mSDtfsCounter, 309 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:11:53,724 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 532 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:11:53,727 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1571 states.
[2025-02-05 16:11:53,783 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1174.
[2025-02-05 16:11:53,786 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1174 states, 1173 states have (on average 1.6206308610400681) internal successors, (1901), 1173 states have internal predecessors, (1901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:53,792 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1901 transitions.
[2025-02-05 16:11:53,795 INFO  L78                 Accepts]: Start accepts. Automaton has 1174 states and 1901 transitions. Word has length 70
[2025-02-05 16:11:53,795 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:11:53,795 INFO  L471      AbstractCegarLoop]: Abstraction has 1174 states and 1901 transitions.
[2025-02-05 16:11:53,795 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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-02-05 16:11:53,795 INFO  L276                IsEmpty]: Start isEmpty. Operand 1174 states and 1901 transitions.
[2025-02-05 16:11:53,796 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2025-02-05 16:11:53,796 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:53,796 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]
[2025-02-05 16:11:53,796 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 16:11:53,796 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:53,797 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:53,797 INFO  L85        PathProgramCache]: Analyzing trace with hash 1341382982, now seen corresponding path program 1 times
[2025-02-05 16:11:53,797 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:53,797 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064988847]
[2025-02-05 16:11:53,797 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:53,797 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:53,809 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes.
[2025-02-05 16:11:53,823 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements.
[2025-02-05 16:11:53,823 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:53,823 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:53,917 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:11:53,917 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:53,917 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064988847]
[2025-02-05 16:11:53,917 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064988847] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:53,917 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:53,917 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 16:11:53,917 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773664553]
[2025-02-05 16:11:53,918 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:53,918 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 16:11:53,918 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:53,918 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 16:11:53,918 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 16:11:53,918 INFO  L87              Difference]: Start difference. First operand 1174 states and 1901 transitions. Second operand  has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:54,014 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:11:54,015 INFO  L93              Difference]: Finished difference Result 3397 states and 5563 transitions.
[2025-02-05 16:11:54,015 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 16:11:54,016 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 71
[2025-02-05 16:11:54,016 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:11:54,024 INFO  L225             Difference]: With dead ends: 3397
[2025-02-05 16:11:54,024 INFO  L226             Difference]: Without dead ends: 2280
[2025-02-05 16:11:54,029 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:11:54,030 INFO  L435           NwaCegarLoop]: 173 mSDtfsCounter, 309 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 587 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-02-05 16:11:54,030 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 587 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:11:54,033 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2280 states.
[2025-02-05 16:11:54,078 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2280 to 1715.
[2025-02-05 16:11:54,081 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1715 states, 1714 states have (on average 1.6207701283547258) internal successors, (2778), 1714 states have internal predecessors, (2778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:54,088 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2778 transitions.
[2025-02-05 16:11:54,088 INFO  L78                 Accepts]: Start accepts. Automaton has 1715 states and 2778 transitions. Word has length 71
[2025-02-05 16:11:54,088 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:11:54,089 INFO  L471      AbstractCegarLoop]: Abstraction has 1715 states and 2778 transitions.
[2025-02-05 16:11:54,089 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:54,089 INFO  L276                IsEmpty]: Start isEmpty. Operand 1715 states and 2778 transitions.
[2025-02-05 16:11:54,090 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2025-02-05 16:11:54,090 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:54,091 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-02-05 16:11:54,091 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 16:11:54,091 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:54,091 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:54,091 INFO  L85        PathProgramCache]: Analyzing trace with hash -724802495, now seen corresponding path program 1 times
[2025-02-05 16:11:54,092 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:54,092 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646934620]
[2025-02-05 16:11:54,092 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:54,092 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:54,104 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes.
[2025-02-05 16:11:54,114 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements.
[2025-02-05 16:11:54,114 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:54,114 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:54,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-02-05 16:11:54,155 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:54,155 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646934620]
[2025-02-05 16:11:54,155 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646934620] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:54,155 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:54,155 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:11:54,155 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996404932]
[2025-02-05 16:11:54,155 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:54,155 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:11:54,155 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:54,156 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:11:54,156 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:11:54,156 INFO  L87              Difference]: Start difference. First operand 1715 states and 2778 transitions. Second operand  has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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-02-05 16:11:54,205 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:11:54,205 INFO  L93              Difference]: Finished difference Result 3868 states and 6342 transitions.
[2025-02-05 16:11:54,205 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:11:54,206 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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-02-05 16:11:54,206 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:11:54,214 INFO  L225             Difference]: With dead ends: 3868
[2025-02-05 16:11:54,215 INFO  L226             Difference]: Without dead ends: 2654
[2025-02-05 16:11:54,217 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-02-05 16:11:54,218 INFO  L435           NwaCegarLoop]: 257 mSDtfsCounter, 90 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 422 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-02-05 16:11:54,218 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 422 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:11:54,220 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2654 states.
[2025-02-05 16:11:54,270 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 2652.
[2025-02-05 16:11:54,275 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2652 states, 2651 states have (on average 1.6197661259901923) internal successors, (4294), 2651 states have internal predecessors, (4294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:54,284 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2652 states and 4294 transitions.
[2025-02-05 16:11:54,284 INFO  L78                 Accepts]: Start accepts. Automaton has 2652 states and 4294 transitions. Word has length 72
[2025-02-05 16:11:54,285 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:11:54,285 INFO  L471      AbstractCegarLoop]: Abstraction has 2652 states and 4294 transitions.
[2025-02-05 16:11:54,285 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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-02-05 16:11:54,285 INFO  L276                IsEmpty]: Start isEmpty. Operand 2652 states and 4294 transitions.
[2025-02-05 16:11:54,286 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2025-02-05 16:11:54,286 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:54,286 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-02-05 16:11:54,286 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 16:11:54,286 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:54,287 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:54,287 INFO  L85        PathProgramCache]: Analyzing trace with hash 1225576143, now seen corresponding path program 1 times
[2025-02-05 16:11:54,287 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:54,287 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711031557]
[2025-02-05 16:11:54,287 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:54,287 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:54,299 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes.
[2025-02-05 16:11:54,307 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements.
[2025-02-05 16:11:54,309 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:54,309 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:54,348 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:11:54,349 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:54,349 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711031557]
[2025-02-05 16:11:54,349 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711031557] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:54,349 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:54,349 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:11:54,349 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969138177]
[2025-02-05 16:11:54,349 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:54,350 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:11:54,350 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:54,350 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:11:54,350 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:11:54,350 INFO  L87              Difference]: Start difference. First operand 2652 states and 4294 transitions. Second operand  has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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-02-05 16:11:54,424 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:11:54,425 INFO  L93              Difference]: Finished difference Result 5913 states and 9607 transitions.
[2025-02-05 16:11:54,425 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:11:54,426 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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-02-05 16:11:54,426 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:11:54,440 INFO  L225             Difference]: With dead ends: 5913
[2025-02-05 16:11:54,441 INFO  L226             Difference]: Without dead ends: 4053
[2025-02-05 16:11:54,445 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-02-05 16:11:54,445 INFO  L435           NwaCegarLoop]: 257 mSDtfsCounter, 84 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 423 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-02-05 16:11:54,446 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 423 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:11:54,450 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4053 states.
[2025-02-05 16:11:54,573 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4053 to 4051.
[2025-02-05 16:11:54,580 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4051 states, 4050 states have (on average 1.6066666666666667) internal successors, (6507), 4050 states have internal predecessors, (6507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:54,594 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4051 states to 4051 states and 6507 transitions.
[2025-02-05 16:11:54,595 INFO  L78                 Accepts]: Start accepts. Automaton has 4051 states and 6507 transitions. Word has length 72
[2025-02-05 16:11:54,595 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:11:54,595 INFO  L471      AbstractCegarLoop]: Abstraction has 4051 states and 6507 transitions.
[2025-02-05 16:11:54,595 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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-02-05 16:11:54,595 INFO  L276                IsEmpty]: Start isEmpty. Operand 4051 states and 6507 transitions.
[2025-02-05 16:11:54,596 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2025-02-05 16:11:54,596 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:54,597 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-02-05 16:11:54,597 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 16:11:54,597 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:54,598 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:54,598 INFO  L85        PathProgramCache]: Analyzing trace with hash -1319639407, now seen corresponding path program 1 times
[2025-02-05 16:11:54,598 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:54,598 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975512763]
[2025-02-05 16:11:54,598 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:54,598 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:54,608 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes.
[2025-02-05 16:11:54,624 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements.
[2025-02-05 16:11:54,624 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:54,624 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:54,695 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:11:54,696 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:54,696 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975512763]
[2025-02-05 16:11:54,696 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975512763] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:54,696 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:54,697 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 16:11:54,697 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438812897]
[2025-02-05 16:11:54,697 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:54,697 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 16:11:54,697 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:54,698 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 16:11:54,698 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 16:11:54,699 INFO  L87              Difference]: Start difference. First operand 4051 states and 6507 transitions. Second operand  has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 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-02-05 16:11:54,845 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:11:54,845 INFO  L93              Difference]: Finished difference Result 11945 states and 19345 transitions.
[2025-02-05 16:11:54,846 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 16:11:54,846 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 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-02-05 16:11:54,846 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:11:54,872 INFO  L225             Difference]: With dead ends: 11945
[2025-02-05 16:11:54,872 INFO  L226             Difference]: Without dead ends: 7959
[2025-02-05 16:11:54,882 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:11:54,882 INFO  L435           NwaCegarLoop]: 242 mSDtfsCounter, 290 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:11:54,882 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 658 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:11:54,891 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7959 states.
[2025-02-05 16:11:55,014 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7959 to 5962.
[2025-02-05 16:11:55,023 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5962 states, 5961 states have (on average 1.6020801878879383) internal successors, (9550), 5961 states have internal predecessors, (9550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:55,041 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5962 states to 5962 states and 9550 transitions.
[2025-02-05 16:11:55,042 INFO  L78                 Accepts]: Start accepts. Automaton has 5962 states and 9550 transitions. Word has length 72
[2025-02-05 16:11:55,042 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:11:55,042 INFO  L471      AbstractCegarLoop]: Abstraction has 5962 states and 9550 transitions.
[2025-02-05 16:11:55,043 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 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-02-05 16:11:55,043 INFO  L276                IsEmpty]: Start isEmpty. Operand 5962 states and 9550 transitions.
[2025-02-05 16:11:55,043 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2025-02-05 16:11:55,043 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:55,043 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-02-05 16:11:55,044 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 16:11:55,044 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:55,044 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:55,044 INFO  L85        PathProgramCache]: Analyzing trace with hash 363978204, now seen corresponding path program 1 times
[2025-02-05 16:11:55,044 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:55,044 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527519213]
[2025-02-05 16:11:55,044 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:55,044 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:55,055 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes.
[2025-02-05 16:11:55,062 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements.
[2025-02-05 16:11:55,063 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:55,063 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:55,146 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:11:55,146 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:55,146 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527519213]
[2025-02-05 16:11:55,147 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527519213] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:55,147 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:55,147 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:11:55,147 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374899405]
[2025-02-05 16:11:55,148 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:55,148 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:11:55,148 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:55,148 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:11:55,148 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:11:55,149 INFO  L87              Difference]: Start difference. First operand 5962 states and 9550 transitions. Second operand  has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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-02-05 16:11:55,275 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:11:55,276 INFO  L93              Difference]: Finished difference Result 13373 states and 21459 transitions.
[2025-02-05 16:11:55,276 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:11:55,276 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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-02-05 16:11:55,276 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:11:55,314 INFO  L225             Difference]: With dead ends: 13373
[2025-02-05 16:11:55,314 INFO  L226             Difference]: Without dead ends: 9099
[2025-02-05 16:11:55,322 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-02-05 16:11:55,323 INFO  L435           NwaCegarLoop]: 249 mSDtfsCounter, 78 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 416 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-02-05 16:11:55,323 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 416 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:11:55,332 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9099 states.
[2025-02-05 16:11:55,501 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9099 to 9097.
[2025-02-05 16:11:55,519 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9097 states, 9096 states have (on average 1.584212840809147) internal successors, (14410), 9096 states have internal predecessors, (14410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:55,549 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9097 states to 9097 states and 14410 transitions.
[2025-02-05 16:11:55,550 INFO  L78                 Accepts]: Start accepts. Automaton has 9097 states and 14410 transitions. Word has length 72
[2025-02-05 16:11:55,551 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:11:55,552 INFO  L471      AbstractCegarLoop]: Abstraction has 9097 states and 14410 transitions.
[2025-02-05 16:11:55,552 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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-02-05 16:11:55,552 INFO  L276                IsEmpty]: Start isEmpty. Operand 9097 states and 14410 transitions.
[2025-02-05 16:11:55,552 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2025-02-05 16:11:55,552 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:55,552 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-02-05 16:11:55,552 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 16:11:55,553 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:55,553 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:55,553 INFO  L85        PathProgramCache]: Analyzing trace with hash 290085359, now seen corresponding path program 1 times
[2025-02-05 16:11:55,553 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:55,553 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8682869]
[2025-02-05 16:11:55,553 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:55,553 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:55,563 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes.
[2025-02-05 16:11:55,575 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements.
[2025-02-05 16:11:55,576 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:55,576 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:55,816 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:11:55,817 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:55,817 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8682869]
[2025-02-05 16:11:55,817 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8682869] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:55,817 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:55,817 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:11:55,817 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865467876]
[2025-02-05 16:11:55,817 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:55,817 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:11:55,817 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:55,818 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:11:55,818 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:11:55,818 INFO  L87              Difference]: Start difference. First operand 9097 states and 14410 transitions. Second operand  has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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-02-05 16:11:55,991 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:11:55,991 INFO  L93              Difference]: Finished difference Result 18125 states and 28728 transitions.
[2025-02-05 16:11:55,991 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:11:55,992 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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-02-05 16:11:55,992 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:11:56,009 INFO  L225             Difference]: With dead ends: 18125
[2025-02-05 16:11:56,010 INFO  L226             Difference]: Without dead ends: 9099
[2025-02-05 16:11:56,021 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-02-05 16:11:56,022 INFO  L435           NwaCegarLoop]: 181 mSDtfsCounter, 238 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:11:56,023 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 489 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:11:56,031 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9099 states.
[2025-02-05 16:11:56,251 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9099 to 9097.
[2025-02-05 16:11:56,267 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9097 states, 9096 states have (on average 1.5704705364995601) internal successors, (14285), 9096 states have internal predecessors, (14285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:56,290 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9097 states to 9097 states and 14285 transitions.
[2025-02-05 16:11:56,292 INFO  L78                 Accepts]: Start accepts. Automaton has 9097 states and 14285 transitions. Word has length 74
[2025-02-05 16:11:56,292 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:11:56,292 INFO  L471      AbstractCegarLoop]: Abstraction has 9097 states and 14285 transitions.
[2025-02-05 16:11:56,293 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 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-02-05 16:11:56,293 INFO  L276                IsEmpty]: Start isEmpty. Operand 9097 states and 14285 transitions.
[2025-02-05 16:11:56,293 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-02-05 16:11:56,293 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:56,293 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-02-05 16:11:56,294 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-05 16:11:56,294 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:56,294 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:56,294 INFO  L85        PathProgramCache]: Analyzing trace with hash 2125108447, now seen corresponding path program 1 times
[2025-02-05 16:11:56,294 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:56,294 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213189678]
[2025-02-05 16:11:56,294 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:56,294 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:56,307 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-02-05 16:11:56,322 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-02-05 16:11:56,322 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:56,322 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:56,499 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:11:56,499 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:56,500 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213189678]
[2025-02-05 16:11:56,500 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213189678] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:56,500 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:56,500 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:11:56,500 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245034340]
[2025-02-05 16:11:56,500 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:56,500 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:11:56,500 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:56,501 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:11:56,501 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:11:56,501 INFO  L87              Difference]: Start difference. First operand 9097 states and 14285 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-02-05 16:11:56,759 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:11:56,759 INFO  L93              Difference]: Finished difference Result 26071 states and 41096 transitions.
[2025-02-05 16:11:56,759 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:11:56,760 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-02-05 16:11:56,760 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:11:56,795 INFO  L225             Difference]: With dead ends: 26071
[2025-02-05 16:11:56,795 INFO  L226             Difference]: Without dead ends: 17045
[2025-02-05 16:11:56,811 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-02-05 16:11:56,813 INFO  L435           NwaCegarLoop]: 175 mSDtfsCounter, 232 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:11:56,813 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 493 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:11:56,830 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 17045 states.
[2025-02-05 16:11:57,221 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 17045 to 17043.
[2025-02-05 16:11:57,250 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 17043 states, 17042 states have (on average 1.5558033094707193) internal successors, (26514), 17042 states have internal predecessors, (26514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:57,282 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17043 states to 17043 states and 26514 transitions.
[2025-02-05 16:11:57,283 INFO  L78                 Accepts]: Start accepts. Automaton has 17043 states and 26514 transitions. Word has length 77
[2025-02-05 16:11:57,283 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:11:57,283 INFO  L471      AbstractCegarLoop]: Abstraction has 17043 states and 26514 transitions.
[2025-02-05 16:11:57,284 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-02-05 16:11:57,284 INFO  L276                IsEmpty]: Start isEmpty. Operand 17043 states and 26514 transitions.
[2025-02-05 16:11:57,285 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2025-02-05 16:11:57,285 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:57,285 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]
[2025-02-05 16:11:57,285 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-05 16:11:57,286 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:57,286 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:57,286 INFO  L85        PathProgramCache]: Analyzing trace with hash 1486237192, now seen corresponding path program 1 times
[2025-02-05 16:11:57,286 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:57,286 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802022035]
[2025-02-05 16:11:57,286 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:57,286 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:57,295 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes.
[2025-02-05 16:11:57,319 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements.
[2025-02-05 16:11:57,319 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:57,319 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:57,489 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:11:57,489 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:57,492 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802022035]
[2025-02-05 16:11:57,493 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802022035] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:57,493 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:57,493 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:11:57,493 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571233400]
[2025-02-05 16:11:57,493 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:57,493 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:11:57,493 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:57,493 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:11:57,494 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:11:57,494 INFO  L87              Difference]: Start difference. First operand 17043 states and 26514 transitions. Second operand  has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:57,637 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:11:57,637 INFO  L93              Difference]: Finished difference Result 18131 states and 27963 transitions.
[2025-02-05 16:11:57,637 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:11:57,638 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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 78
[2025-02-05 16:11:57,638 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:11:57,672 INFO  L225             Difference]: With dead ends: 18131
[2025-02-05 16:11:57,672 INFO  L226             Difference]: Without dead ends: 18129
[2025-02-05 16:11:57,681 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-02-05 16:11:57,681 INFO  L435           NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:11:57,682 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 710 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:11:57,697 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18129 states.
[2025-02-05 16:11:57,991 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18129 to 18129.
[2025-02-05 16:11:58,016 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18129 states, 18128 states have (on average 1.5220101500441305) internal successors, (27591), 18128 states have internal predecessors, (27591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:58,044 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18129 states to 18129 states and 27591 transitions.
[2025-02-05 16:11:58,046 INFO  L78                 Accepts]: Start accepts. Automaton has 18129 states and 27591 transitions. Word has length 78
[2025-02-05 16:11:58,046 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:11:58,046 INFO  L471      AbstractCegarLoop]: Abstraction has 18129 states and 27591 transitions.
[2025-02-05 16:11:58,046 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:58,046 INFO  L276                IsEmpty]: Start isEmpty. Operand 18129 states and 27591 transitions.
[2025-02-05 16:11:58,049 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2025-02-05 16:11:58,049 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:58,049 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]
[2025-02-05 16:11:58,049 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-05 16:11:58,049 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:58,049 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:58,050 INFO  L85        PathProgramCache]: Analyzing trace with hash 60908950, now seen corresponding path program 1 times
[2025-02-05 16:11:58,050 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:58,050 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851542939]
[2025-02-05 16:11:58,050 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:58,050 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:58,061 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-02-05 16:11:58,074 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-02-05 16:11:58,076 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:58,076 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:58,124 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:11:58,124 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:58,124 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851542939]
[2025-02-05 16:11:58,124 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851542939] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:58,124 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:58,124 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:11:58,124 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389441760]
[2025-02-05 16:11:58,125 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:58,126 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:11:58,126 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:58,127 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:11:58,127 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:11:58,127 INFO  L87              Difference]: Start difference. First operand 18129 states and 27591 transitions. Second operand  has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:58,482 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:11:58,483 INFO  L93              Difference]: Finished difference Result 54126 states and 82303 transitions.
[2025-02-05 16:11:58,483 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:11:58,483 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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 105
[2025-02-05 16:11:58,484 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:11:58,556 INFO  L225             Difference]: With dead ends: 54126
[2025-02-05 16:11:58,557 INFO  L226             Difference]: Without dead ends: 36064
[2025-02-05 16:11:58,583 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-02-05 16:11:58,584 INFO  L435           NwaCegarLoop]: 245 mSDtfsCounter, 118 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:11:58,584 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 419 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:11:58,609 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 36064 states.
[2025-02-05 16:11:59,245 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 36064 to 36062.
[2025-02-05 16:11:59,290 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 36062 states, 36061 states have (on average 1.5079726019799784) internal successors, (54379), 36061 states have internal predecessors, (54379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:59,358 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36062 states to 36062 states and 54379 transitions.
[2025-02-05 16:11:59,361 INFO  L78                 Accepts]: Start accepts. Automaton has 36062 states and 54379 transitions. Word has length 105
[2025-02-05 16:11:59,361 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:11:59,361 INFO  L471      AbstractCegarLoop]: Abstraction has 36062 states and 54379 transitions.
[2025-02-05 16:11:59,362 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:59,362 INFO  L276                IsEmpty]: Start isEmpty. Operand 36062 states and 54379 transitions.
[2025-02-05 16:11:59,364 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2025-02-05 16:11:59,364 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:59,364 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]
[2025-02-05 16:11:59,365 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-05 16:11:59,365 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:59,366 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:59,366 INFO  L85        PathProgramCache]: Analyzing trace with hash 2011287588, now seen corresponding path program 1 times
[2025-02-05 16:11:59,366 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:59,366 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770376093]
[2025-02-05 16:11:59,366 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:59,366 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:59,379 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-02-05 16:11:59,395 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-02-05 16:11:59,396 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:59,396 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:59,451 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-02-05 16:11:59,452 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:59,452 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770376093]
[2025-02-05 16:11:59,452 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770376093] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:59,452 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:59,452 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:11:59,452 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188252816]
[2025-02-05 16:11:59,452 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:59,453 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:11:59,453 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:59,454 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:11:59,454 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:11:59,454 INFO  L87              Difference]: Start difference. First operand 36062 states and 54379 transitions. Second operand  has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:12:00,225 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:12:00,226 INFO  L93              Difference]: Finished difference Result 107710 states and 162271 transitions.
[2025-02-05 16:12:00,226 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:12:00,226 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 105
[2025-02-05 16:12:00,227 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:12:00,360 INFO  L225             Difference]: With dead ends: 107710
[2025-02-05 16:12:00,360 INFO  L226             Difference]: Without dead ends: 71749
[2025-02-05 16:12:00,392 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-02-05 16:12:00,392 INFO  L435           NwaCegarLoop]: 230 mSDtfsCounter, 103 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:12:00,392 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 404 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:12:00,443 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 71749 states.
[2025-02-05 16:12:01,847 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 71749 to 71747.
[2025-02-05 16:12:01,913 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 71747 states, 71746 states have (on average 1.4938115016865052) internal successors, (107175), 71746 states have internal predecessors, (107175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:12:02,169 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 71747 states to 71747 states and 107175 transitions.
[2025-02-05 16:12:02,173 INFO  L78                 Accepts]: Start accepts. Automaton has 71747 states and 107175 transitions. Word has length 105
[2025-02-05 16:12:02,173 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:12:02,173 INFO  L471      AbstractCegarLoop]: Abstraction has 71747 states and 107175 transitions.
[2025-02-05 16:12:02,173 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:12:02,173 INFO  L276                IsEmpty]: Start isEmpty. Operand 71747 states and 107175 transitions.
[2025-02-05 16:12:02,177 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2025-02-05 16:12:02,177 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:12:02,177 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]
[2025-02-05 16:12:02,177 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-02-05 16:12:02,178 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:12:02,178 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:12:02,178 INFO  L85        PathProgramCache]: Analyzing trace with hash 1149689649, now seen corresponding path program 1 times
[2025-02-05 16:12:02,178 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:12:02,178 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779918099]
[2025-02-05 16:12:02,178 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:12:02,178 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:12:02,188 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-02-05 16:12:02,201 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-02-05 16:12:02,205 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:12:02,206 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:12:02,254 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-02-05 16:12:02,255 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:12:02,255 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779918099]
[2025-02-05 16:12:02,255 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779918099] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:12:02,255 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:12:02,255 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:12:02,255 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923407527]
[2025-02-05 16:12:02,255 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:12:02,255 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:12:02,255 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:12:02,256 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:12:02,256 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:12:02,256 INFO  L87              Difference]: Start difference. First operand 71747 states and 107175 transitions. Second operand  has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:12:03,769 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:12:03,770 INFO  L93              Difference]: Finished difference Result 214339 states and 319892 transitions.
[2025-02-05 16:12:03,770 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:12:03,770 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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 105
[2025-02-05 16:12:03,770 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:12:04,002 INFO  L225             Difference]: With dead ends: 214339
[2025-02-05 16:12:04,002 INFO  L226             Difference]: Without dead ends: 142793
[2025-02-05 16:12:04,061 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-02-05 16:12:04,062 INFO  L435           NwaCegarLoop]: 267 mSDtfsCounter, 130 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:12:04,062 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 441 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:12:04,176 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 142793 states.
[2025-02-05 16:12:06,275 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 142793 to 142791.
[2025-02-05 16:12:06,409 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 142791 states, 142790 states have (on average 1.479585405140416) internal successors, (211270), 142790 states have internal predecessors, (211270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:12:06,939 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 142791 states to 142791 states and 211270 transitions.
[2025-02-05 16:12:06,948 INFO  L78                 Accepts]: Start accepts. Automaton has 142791 states and 211270 transitions. Word has length 105
[2025-02-05 16:12:06,948 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:12:06,949 INFO  L471      AbstractCegarLoop]: Abstraction has 142791 states and 211270 transitions.
[2025-02-05 16:12:06,949 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:12:06,949 INFO  L276                IsEmpty]: Start isEmpty. Operand 142791 states and 211270 transitions.
[2025-02-05 16:12:06,956 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2025-02-05 16:12:06,957 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:12:06,957 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]
[2025-02-05 16:12:06,957 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-02-05 16:12:06,958 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:12:06,958 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:12:06,958 INFO  L85        PathProgramCache]: Analyzing trace with hash -2032508079, now seen corresponding path program 1 times
[2025-02-05 16:12:06,958 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:12:06,958 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474755448]
[2025-02-05 16:12:06,958 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:12:06,958 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:12:06,971 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-02-05 16:12:06,994 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-02-05 16:12:06,994 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:12:06,994 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:12:07,097 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-02-05 16:12:07,102 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:12:07,103 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474755448]
[2025-02-05 16:12:07,103 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474755448] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:12:07,103 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:12:07,103 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:12:07,103 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95443970]
[2025-02-05 16:12:07,104 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:12:07,107 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:12:07,108 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:12:07,108 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:12:07,108 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:12:07,109 INFO  L87              Difference]: Start difference. First operand 142791 states and 211270 transitions. Second operand  has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:12:09,871 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:12:09,872 INFO  L93              Difference]: Finished difference Result 351063 states and 521994 transitions.
[2025-02-05 16:12:09,872 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:12:09,872 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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 105
[2025-02-05 16:12:09,873 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:12:10,446 INFO  L225             Difference]: With dead ends: 351063
[2025-02-05 16:12:10,446 INFO  L226             Difference]: Without dead ends: 282981
[2025-02-05 16:12:10,572 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-02-05 16:12:10,572 INFO  L435           NwaCegarLoop]: 287 mSDtfsCounter, 387 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:12:10,572 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 862 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:12:10,807 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 282981 states.
[2025-02-05 16:12:14,716 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 282981 to 220183.
[2025-02-05 16:12:14,861 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 220183 states, 220182 states have (on average 1.4786222307000572) internal successors, (325566), 220182 states have internal predecessors, (325566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:12:15,275 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 220183 states to 220183 states and 325566 transitions.
[2025-02-05 16:12:15,287 INFO  L78                 Accepts]: Start accepts. Automaton has 220183 states and 325566 transitions. Word has length 105
[2025-02-05 16:12:15,288 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:12:15,288 INFO  L471      AbstractCegarLoop]: Abstraction has 220183 states and 325566 transitions.
[2025-02-05 16:12:15,288 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:12:15,288 INFO  L276                IsEmpty]: Start isEmpty. Operand 220183 states and 325566 transitions.
[2025-02-05 16:12:15,294 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2025-02-05 16:12:15,295 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:12:15,295 INFO  L218           NwaCegarLoop]: trace histogram [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-02-05 16:12:15,296 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-02-05 16:12:15,296 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:12:15,296 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:12:15,297 INFO  L85        PathProgramCache]: Analyzing trace with hash 1194099543, now seen corresponding path program 1 times
[2025-02-05 16:12:15,297 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:12:15,297 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691614319]
[2025-02-05 16:12:15,297 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:12:15,297 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:12:15,307 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-02-05 16:12:15,318 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-02-05 16:12:15,318 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:12:15,318 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:12:15,356 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:12:15,356 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:12:15,356 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691614319]
[2025-02-05 16:12:15,356 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691614319] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:12:15,356 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:12:15,357 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:12:15,357 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811508131]
[2025-02-05 16:12:15,357 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:12:15,357 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:12:15,357 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:12:15,357 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:12:15,357 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:12:15,358 INFO  L87              Difference]: Start difference. First operand 220183 states and 325566 transitions. Second operand  has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:12:19,862 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:12:19,862 INFO  L93              Difference]: Finished difference Result 657947 states and 971860 transitions.
[2025-02-05 16:12:19,863 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:12:19,863 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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 105
[2025-02-05 16:12:19,863 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:12:20,776 INFO  L225             Difference]: With dead ends: 657947
[2025-02-05 16:12:20,776 INFO  L226             Difference]: Without dead ends: 438181
[2025-02-05 16:12:20,927 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-02-05 16:12:20,927 INFO  L435           NwaCegarLoop]: 262 mSDtfsCounter, 137 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:12:20,927 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 436 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:12:21,249 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 438181 states.
[2025-02-05 16:12:27,938 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 438181 to 438179.
[2025-02-05 16:12:28,226 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 438179 states, 438178 states have (on average 1.4642588171930129) internal successors, (641606), 438178 states have internal predecessors, (641606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:12:29,324 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 438179 states to 438179 states and 641606 transitions.
[2025-02-05 16:12:29,365 INFO  L78                 Accepts]: Start accepts. Automaton has 438179 states and 641606 transitions. Word has length 105
[2025-02-05 16:12:29,366 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:12:29,366 INFO  L471      AbstractCegarLoop]: Abstraction has 438179 states and 641606 transitions.
[2025-02-05 16:12:29,366 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:12:29,366 INFO  L276                IsEmpty]: Start isEmpty. Operand 438179 states and 641606 transitions.
[2025-02-05 16:12:29,384 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2025-02-05 16:12:29,391 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:12:29,392 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:12:29,392 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-02-05 16:12:29,392 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:12:29,392 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:12:29,392 INFO  L85        PathProgramCache]: Analyzing trace with hash -506640936, now seen corresponding path program 1 times
[2025-02-05 16:12:29,392 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:12:29,392 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538968748]
[2025-02-05 16:12:29,392 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:12:29,392 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:12:29,410 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-02-05 16:12:29,428 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-02-05 16:12:29,429 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:12:29,429 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:12:29,498 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:12:29,498 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:12:29,498 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538968748]
[2025-02-05 16:12:29,498 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538968748] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:12:29,499 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:12:29,499 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:12:29,499 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503099165]
[2025-02-05 16:12:29,502 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:12:29,503 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:12:29,503 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:12:29,503 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:12:29,503 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:12:29,503 INFO  L87              Difference]: Start difference. First operand 438179 states and 641606 transitions. Second operand  has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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)