./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_overflow.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_overflow.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 c9bc953af286e9cfd29d104859de67d32500c9606def6c78f8ad113aab301f45
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 16:11:51,126 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 16:11:51,169 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:51,172 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 16:11:51,172 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 16:11:51,185 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 16:11:51,186 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 16:11:51,186 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 16:11:51,186 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 16:11:51,186 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 16:11:51,186 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 16:11:51,186 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 16:11:51,186 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 16:11:51,186 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 16:11:51,186 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 16:11:51,186 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 16:11:51,186 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 16:11:51,186 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 16:11:51,186 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 16:11:51,186 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 16:11:51,187 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 16:11:51,187 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 16:11:51,187 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 16:11:51,187 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 16:11:51,187 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 16:11:51,187 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 16:11:51,187 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 16:11:51,187 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 16:11:51,187 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 16:11:51,187 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 16:11:51,187 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 16:11:51,187 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 16:11:51,187 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 16:11:51,187 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 16:11:51,187 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 16:11:51,187 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 16:11:51,187 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 16:11:51,187 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 16:11:51,187 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 16:11:51,188 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 16:11:51,188 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 16:11:51,188 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 16:11:51,188 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 16:11:51,188 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 -> c9bc953af286e9cfd29d104859de67d32500c9606def6c78f8ad113aab301f45
[2025-02-05 16:11:51,464 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 16:11:51,472 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 16:11:51,474 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 16:11:51,475 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 16:11:51,475 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 16:11:51,476 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_overflow.ufo.UNBOUNDED.pals.c
[2025-02-05 16:11:52,854 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/55936cfd5/f1913065061844eb8710dec6fee0a101/FLAG3191351e1
[2025-02-05 16:11:53,223 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 16:11:53,223 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_overflow.ufo.UNBOUNDED.pals.c
[2025-02-05 16:11:53,234 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/55936cfd5/f1913065061844eb8710dec6fee0a101/FLAG3191351e1
[2025-02-05 16:11:53,257 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/55936cfd5/f1913065061844eb8710dec6fee0a101
[2025-02-05 16:11:53,259 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 16:11:53,262 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 16:11:53,264 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 16:11:53,264 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 16:11:53,268 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 16:11:53,269 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:11:53" (1/1) ...
[2025-02-05 16:11:53,269 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49bb72c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:53, skipping insertion in model container
[2025-02-05 16:11:53,271 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:11:53" (1/1) ...
[2025-02-05 16:11:53,301 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 16:11:53,469 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_overflow.ufo.UNBOUNDED.pals.c[12924,12937]
[2025-02-05 16:11:53,472 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 16:11:53,482 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 16:11:53,519 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_overflow.ufo.UNBOUNDED.pals.c[12924,12937]
[2025-02-05 16:11:53,519 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 16:11:53,530 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 16:11:53,530 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:53 WrapperNode
[2025-02-05 16:11:53,530 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 16:11:53,531 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 16:11:53,532 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 16:11:53,532 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 16:11:53,537 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:53" (1/1) ...
[2025-02-05 16:11:53,545 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:53" (1/1) ...
[2025-02-05 16:11:53,581 INFO  L138                Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 445
[2025-02-05 16:11:53,585 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 16:11:53,585 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 16:11:53,585 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 16:11:53,585 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 16:11:53,593 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:53" (1/1) ...
[2025-02-05 16:11:53,594 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:53" (1/1) ...
[2025-02-05 16:11:53,599 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:53" (1/1) ...
[2025-02-05 16:11:53,623 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:53,626 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:53" (1/1) ...
[2025-02-05 16:11:53,627 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:53" (1/1) ...
[2025-02-05 16:11:53,639 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:53" (1/1) ...
[2025-02-05 16:11:53,641 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:53" (1/1) ...
[2025-02-05 16:11:53,642 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:53" (1/1) ...
[2025-02-05 16:11:53,643 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:53" (1/1) ...
[2025-02-05 16:11:53,644 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 16:11:53,645 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 16:11:53,645 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 16:11:53,645 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 16:11:53,646 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:53" (1/1) ...
[2025-02-05 16:11:53,650 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 16:11:53,659 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 16:11:53,670 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:53,672 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:53,688 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 16:11:53,689 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 16:11:53,689 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 16:11:53,689 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 16:11:53,767 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 16:11:53,769 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 16:11:54,315 INFO  L?                        ?]: Removed 45 outVars from TransFormulas that were not future-live.
[2025-02-05 16:11:54,315 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 16:11:54,328 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 16:11:54,329 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 16:11:54,329 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:11:54 BoogieIcfgContainer
[2025-02-05 16:11:54,329 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 16:11:54,330 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 16:11:54,331 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 16:11:54,334 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 16:11:54,335 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:11:53" (1/3) ...
[2025-02-05 16:11:54,335 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@550a3e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:11:54, skipping insertion in model container
[2025-02-05 16:11:54,336 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:11:53" (2/3) ...
[2025-02-05 16:11:54,336 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@550a3e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:11:54, skipping insertion in model container
[2025-02-05 16:11:54,336 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:11:54" (3/3) ...
[2025-02-05 16:11:54,337 INFO  L128   eAbstractionObserver]: Analyzing ICFG pals_floodmax.3_overflow.ufo.UNBOUNDED.pals.c
[2025-02-05 16:11:54,348 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 16:11:54,350 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.3_overflow.ufo.UNBOUNDED.pals.c that has 1 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 16:11:54,413 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 16:11:54,421 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;@6a0b8038, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 16:11:54,422 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 16:11:54,426 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 118 states, 116 states have (on average 1.7844827586206897) internal successors, (207), 117 states have internal predecessors, (207), 0 states have call successors, (0), 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,431 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2025-02-05 16:11:54,431 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:54,432 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:54,432 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:54,436 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:54,436 INFO  L85        PathProgramCache]: Analyzing trace with hash -287906574, now seen corresponding path program 1 times
[2025-02-05 16:11:54,442 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:54,442 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697226770]
[2025-02-05 16:11:54,442 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:54,443 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:54,527 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes.
[2025-02-05 16:11:54,578 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements.
[2025-02-05 16:11:54,578 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:54,579 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:54,666 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,666 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:54,667 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697226770]
[2025-02-05 16:11:54,670 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697226770] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:54,671 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:54,671 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 16:11:54,672 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725581647]
[2025-02-05 16:11:54,672 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:54,675 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-02-05 16:11:54,675 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:54,686 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-02-05 16:11:54,687 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-05 16:11:54,689 INFO  L87              Difference]: Start difference. First operand  has 118 states, 116 states have (on average 1.7844827586206897) internal successors, (207), 117 states have internal predecessors, (207), 0 states have call successors, (0), 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:54,703 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:11:54,703 INFO  L93              Difference]: Finished difference Result 177 states and 310 transitions.
[2025-02-05 16:11:54,704 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-02-05 16:11:54,705 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:54,705 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:11:54,710 INFO  L225             Difference]: With dead ends: 177
[2025-02-05 16:11:54,710 INFO  L226             Difference]: Without dead ends: 115
[2025-02-05 16:11:54,712 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:54,713 INFO  L435           NwaCegarLoop]: 202 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, 202 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:54,714 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 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:54,722 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 115 states.
[2025-02-05 16:11:54,735 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115.
[2025-02-05 16:11:54,736 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 115 states, 114 states have (on average 1.7719298245614035) internal successors, (202), 114 states have internal predecessors, (202), 0 states have call successors, (0), 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,739 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 202 transitions.
[2025-02-05 16:11:54,740 INFO  L78                 Accepts]: Start accepts. Automaton has 115 states and 202 transitions. Word has length 37
[2025-02-05 16:11:54,740 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:11:54,741 INFO  L471      AbstractCegarLoop]: Abstraction has 115 states and 202 transitions.
[2025-02-05 16:11:54,741 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:54,741 INFO  L276                IsEmpty]: Start isEmpty. Operand 115 states and 202 transitions.
[2025-02-05 16:11:54,742 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2025-02-05 16:11:54,742 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:54,742 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:54,742 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 16:11:54,742 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:54,743 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:54,743 INFO  L85        PathProgramCache]: Analyzing trace with hash -696730799, now seen corresponding path program 1 times
[2025-02-05 16:11:54,743 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:54,743 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144252823]
[2025-02-05 16:11:54,743 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:54,743 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:54,760 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes.
[2025-02-05 16:11:54,789 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements.
[2025-02-05 16:11:54,789 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:54,789 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:54,970 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,970 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:54,970 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144252823]
[2025-02-05 16:11:54,970 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144252823] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:54,971 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:54,971 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:11:54,971 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441890286]
[2025-02-05 16:11:54,971 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:54,972 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:11:54,972 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:54,972 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:11:54,972 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:11:54,972 INFO  L87              Difference]: Start difference. First operand 115 states and 202 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:55,054 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:11:55,059 INFO  L93              Difference]: Finished difference Result 177 states and 306 transitions.
[2025-02-05 16:11:55,059 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:11:55,059 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:55,060 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:11:55,060 INFO  L225             Difference]: With dead ends: 177
[2025-02-05 16:11:55,060 INFO  L226             Difference]: Without dead ends: 115
[2025-02-05 16:11:55,061 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:55,061 INFO  L435           NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 768 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:55,062 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 768 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:55,062 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 115 states.
[2025-02-05 16:11:55,066 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115.
[2025-02-05 16:11:55,070 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 115 states, 114 states have (on average 1.5350877192982457) internal successors, (175), 114 states have internal predecessors, (175), 0 states have call successors, (0), 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,071 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 175 transitions.
[2025-02-05 16:11:55,073 INFO  L78                 Accepts]: Start accepts. Automaton has 115 states and 175 transitions. Word has length 37
[2025-02-05 16:11:55,073 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:11:55,073 INFO  L471      AbstractCegarLoop]: Abstraction has 115 states and 175 transitions.
[2025-02-05 16:11:55,073 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:55,075 INFO  L276                IsEmpty]: Start isEmpty. Operand 115 states and 175 transitions.
[2025-02-05 16:11:55,077 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2025-02-05 16:11:55,077 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:55,077 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:55,077 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 16:11:55,077 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:55,080 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:55,080 INFO  L85        PathProgramCache]: Analyzing trace with hash -327600201, now seen corresponding path program 1 times
[2025-02-05 16:11:55,080 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:55,080 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511937399]
[2025-02-05 16:11:55,080 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:55,080 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:55,105 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes.
[2025-02-05 16:11:55,158 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements.
[2025-02-05 16:11:55,158 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:55,158 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:55,283 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,284 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:55,284 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511937399]
[2025-02-05 16:11:55,284 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511937399] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:55,284 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:55,284 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:11:55,284 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682327284]
[2025-02-05 16:11:55,284 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:55,285 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:11:55,285 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:55,286 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:11:55,287 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:11:55,291 INFO  L87              Difference]: Start difference. First operand 115 states and 175 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:55,340 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:11:55,340 INFO  L93              Difference]: Finished difference Result 222 states and 358 transitions.
[2025-02-05 16:11:55,341 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:11:55,341 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:55,342 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:11:55,343 INFO  L225             Difference]: With dead ends: 222
[2025-02-05 16:11:55,343 INFO  L226             Difference]: Without dead ends: 164
[2025-02-05 16:11:55,344 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,344 INFO  L435           NwaCegarLoop]: 238 mSDtfsCounter, 75 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:11:55,344 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 373 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:11:55,345 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 164 states.
[2025-02-05 16:11:55,351 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162.
[2025-02-05 16:11:55,351 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 162 states, 161 states have (on average 1.565217391304348) internal successors, (252), 161 states have internal predecessors, (252), 0 states have call successors, (0), 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,352 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 252 transitions.
[2025-02-05 16:11:55,353 INFO  L78                 Accepts]: Start accepts. Automaton has 162 states and 252 transitions. Word has length 63
[2025-02-05 16:11:55,353 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:11:55,353 INFO  L471      AbstractCegarLoop]: Abstraction has 162 states and 252 transitions.
[2025-02-05 16:11:55,353 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:55,353 INFO  L276                IsEmpty]: Start isEmpty. Operand 162 states and 252 transitions.
[2025-02-05 16:11:55,354 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-02-05 16:11:55,354 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:55,355 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:55,355 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 16:11:55,355 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:55,355 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:55,356 INFO  L85        PathProgramCache]: Analyzing trace with hash 926887085, now seen corresponding path program 1 times
[2025-02-05 16:11:55,356 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:55,356 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311957702]
[2025-02-05 16:11:55,356 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:55,356 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:55,375 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-02-05 16:11:55,409 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-02-05 16:11:55,409 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:55,409 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:55,512 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,513 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:55,514 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311957702]
[2025-02-05 16:11:55,514 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311957702] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:55,514 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:55,514 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:11:55,514 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690098462]
[2025-02-05 16:11:55,514 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:55,515 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:11:55,515 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:55,515 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:11:55,517 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:11:55,518 INFO  L87              Difference]: Start difference. First operand 162 states and 252 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:55,545 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:11:55,547 INFO  L93              Difference]: Finished difference Result 269 states and 435 transitions.
[2025-02-05 16:11:55,547 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:11:55,547 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:55,547 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:11:55,548 INFO  L225             Difference]: With dead ends: 269
[2025-02-05 16:11:55,550 INFO  L226             Difference]: Without dead ends: 211
[2025-02-05 16:11:55,551 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,551 INFO  L435           NwaCegarLoop]: 243 mSDtfsCounter, 84 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 399 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,552 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 399 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,552 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 211 states.
[2025-02-05 16:11:55,564 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209.
[2025-02-05 16:11:55,565 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 209 states, 208 states have (on average 1.5961538461538463) internal successors, (332), 208 states have internal predecessors, (332), 0 states have call successors, (0), 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,565 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 332 transitions.
[2025-02-05 16:11:55,566 INFO  L78                 Accepts]: Start accepts. Automaton has 209 states and 332 transitions. Word has length 65
[2025-02-05 16:11:55,566 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:11:55,566 INFO  L471      AbstractCegarLoop]: Abstraction has 209 states and 332 transitions.
[2025-02-05 16:11:55,566 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:55,566 INFO  L276                IsEmpty]: Start isEmpty. Operand 209 states and 332 transitions.
[2025-02-05 16:11:55,567 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-02-05 16:11:55,567 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:55,567 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:55,568 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 16:11:55,568 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:55,568 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:55,568 INFO  L85        PathProgramCache]: Analyzing trace with hash 1976340410, now seen corresponding path program 1 times
[2025-02-05 16:11:55,568 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:55,569 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356294496]
[2025-02-05 16:11:55,569 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:55,569 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:55,589 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-02-05 16:11:55,611 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-02-05 16:11:55,612 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:55,612 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:55,743 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,743 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:55,743 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356294496]
[2025-02-05 16:11:55,745 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356294496] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:55,745 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:55,745 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:11:55,745 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641770579]
[2025-02-05 16:11:55,745 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:55,745 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:11:55,745 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:55,746 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:11:55,746 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:11:55,746 INFO  L87              Difference]: Start difference. First operand 209 states and 332 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:55,782 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:11:55,782 INFO  L93              Difference]: Finished difference Result 488 states and 803 transitions.
[2025-02-05 16:11:55,783 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:11:55,783 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:55,783 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:11:55,785 INFO  L225             Difference]: With dead ends: 488
[2025-02-05 16:11:55,785 INFO  L226             Difference]: Without dead ends: 338
[2025-02-05 16:11:55,785 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,786 INFO  L435           NwaCegarLoop]: 182 mSDtfsCounter, 77 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:11:55,786 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 326 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:11:55,789 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 338 states.
[2025-02-05 16:11:55,804 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336.
[2025-02-05 16:11:55,807 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 336 states, 335 states have (on average 1.6238805970149253) internal successors, (544), 335 states have internal predecessors, (544), 0 states have call successors, (0), 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,808 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 544 transitions.
[2025-02-05 16:11:55,810 INFO  L78                 Accepts]: Start accepts. Automaton has 336 states and 544 transitions. Word has length 65
[2025-02-05 16:11:55,810 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:11:55,810 INFO  L471      AbstractCegarLoop]: Abstraction has 336 states and 544 transitions.
[2025-02-05 16:11:55,810 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:55,810 INFO  L276                IsEmpty]: Start isEmpty. Operand 336 states and 544 transitions.
[2025-02-05 16:11:55,814 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2025-02-05 16:11:55,814 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:55,814 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:55,814 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 16:11:55,814 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:55,815 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:55,815 INFO  L85        PathProgramCache]: Analyzing trace with hash 1502635164, now seen corresponding path program 1 times
[2025-02-05 16:11:55,815 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:55,815 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055684942]
[2025-02-05 16:11:55,815 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:55,815 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:55,838 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes.
[2025-02-05 16:11:55,859 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements.
[2025-02-05 16:11:55,859 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:55,859 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:55,957 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,957 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:55,958 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055684942]
[2025-02-05 16:11:55,958 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055684942] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:55,958 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:55,958 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:11:55,958 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380060924]
[2025-02-05 16:11:55,958 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:55,959 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:11:55,961 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:55,962 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:11:55,962 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:11:55,962 INFO  L87              Difference]: Start difference. First operand 336 states and 544 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:55,993 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:11:55,996 INFO  L93              Difference]: Finished difference Result 848 states and 1400 transitions.
[2025-02-05 16:11:55,996 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:11:55,996 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:55,997 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:11:55,999 INFO  L225             Difference]: With dead ends: 848
[2025-02-05 16:11:56,001 INFO  L226             Difference]: Without dead ends: 571
[2025-02-05 16:11:56,002 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:56,004 INFO  L435           NwaCegarLoop]: 220 mSDtfsCounter, 71 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:11:56,004 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 365 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:11:56,005 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 571 states.
[2025-02-05 16:11:56,031 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 569.
[2025-02-05 16:11:56,032 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 569 states, 568 states have (on average 1.630281690140845) internal successors, (926), 568 states have internal predecessors, (926), 0 states have call successors, (0), 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,034 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 926 transitions.
[2025-02-05 16:11:56,034 INFO  L78                 Accepts]: Start accepts. Automaton has 569 states and 926 transitions. Word has length 67
[2025-02-05 16:11:56,035 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:11:56,035 INFO  L471      AbstractCegarLoop]: Abstraction has 569 states and 926 transitions.
[2025-02-05 16:11:56,035 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:56,035 INFO  L276                IsEmpty]: Start isEmpty. Operand 569 states and 926 transitions.
[2025-02-05 16:11:56,036 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 70
[2025-02-05 16:11:56,036 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:56,036 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:56,036 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 16:11:56,036 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:56,037 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:56,037 INFO  L85        PathProgramCache]: Analyzing trace with hash -399372334, now seen corresponding path program 1 times
[2025-02-05 16:11:56,037 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:56,037 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300778206]
[2025-02-05 16:11:56,037 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:56,037 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:56,048 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes.
[2025-02-05 16:11:56,075 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements.
[2025-02-05 16:11:56,075 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:56,075 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:56,136 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,139 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:56,140 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300778206]
[2025-02-05 16:11:56,140 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300778206] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:56,140 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:56,140 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:11:56,140 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473234977]
[2025-02-05 16:11:56,140 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:56,140 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:11:56,140 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:56,140 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:11:56,141 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:11:56,141 INFO  L87              Difference]: Start difference. First operand 569 states and 926 transitions. Second operand  has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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:56,177 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:11:56,177 INFO  L93              Difference]: Finished difference Result 1078 states and 1774 transitions.
[2025-02-05 16:11:56,177 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:11:56,177 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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:56,178 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:11:56,180 INFO  L225             Difference]: With dead ends: 1078
[2025-02-05 16:11:56,181 INFO  L226             Difference]: Without dead ends: 801
[2025-02-05 16:11:56,182 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:56,184 INFO  L435           NwaCegarLoop]: 212 mSDtfsCounter, 72 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 370 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:56,184 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 370 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:56,186 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 801 states.
[2025-02-05 16:11:56,202 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 799.
[2025-02-05 16:11:56,205 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 799 states, 798 states have (on average 1.6265664160401003) internal successors, (1298), 798 states have internal predecessors, (1298), 0 states have call successors, (0), 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,208 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1298 transitions.
[2025-02-05 16:11:56,209 INFO  L78                 Accepts]: Start accepts. Automaton has 799 states and 1298 transitions. Word has length 69
[2025-02-05 16:11:56,210 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:11:56,210 INFO  L471      AbstractCegarLoop]: Abstraction has 799 states and 1298 transitions.
[2025-02-05 16:11:56,210 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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:56,210 INFO  L276                IsEmpty]: Start isEmpty. Operand 799 states and 1298 transitions.
[2025-02-05 16:11:56,210 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 70
[2025-02-05 16:11:56,210 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:56,210 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:11:56,211 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 16:11:56,212 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:56,212 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:56,212 INFO  L85        PathProgramCache]: Analyzing trace with hash -821702689, now seen corresponding path program 1 times
[2025-02-05 16:11:56,212 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:56,212 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051297341]
[2025-02-05 16:11:56,213 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:56,213 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:56,229 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes.
[2025-02-05 16:11:56,241 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements.
[2025-02-05 16:11:56,241 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:56,241 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:56,346 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,347 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:56,347 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051297341]
[2025-02-05 16:11:56,347 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051297341] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:56,347 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:56,348 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:11:56,348 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888631471]
[2025-02-05 16:11:56,348 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:56,348 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:11:56,348 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:56,349 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:11:56,349 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:11:56,349 INFO  L87              Difference]: Start difference. First operand 799 states and 1298 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:56,536 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:11:56,536 INFO  L93              Difference]: Finished difference Result 3751 states and 6256 transitions.
[2025-02-05 16:11:56,537 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-05 16:11:56,537 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:56,538 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:11:56,549 INFO  L225             Difference]: With dead ends: 3751
[2025-02-05 16:11:56,549 INFO  L226             Difference]: Without dead ends: 3032
[2025-02-05 16:11:56,552 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:56,552 INFO  L435           NwaCegarLoop]: 188 mSDtfsCounter, 618 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:11:56,553 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 885 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:11:56,556 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3032 states.
[2025-02-05 16:11:56,604 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3032 to 1466.
[2025-02-05 16:11:56,607 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1466 states, 1465 states have (on average 1.627986348122867) internal successors, (2385), 1465 states have internal predecessors, (2385), 0 states have call successors, (0), 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,613 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 2385 transitions.
[2025-02-05 16:11:56,613 INFO  L78                 Accepts]: Start accepts. Automaton has 1466 states and 2385 transitions. Word has length 69
[2025-02-05 16:11:56,614 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:11:56,614 INFO  L471      AbstractCegarLoop]: Abstraction has 1466 states and 2385 transitions.
[2025-02-05 16:11:56,614 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:56,614 INFO  L276                IsEmpty]: Start isEmpty. Operand 1466 states and 2385 transitions.
[2025-02-05 16:11:56,615 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2025-02-05 16:11:56,615 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:56,615 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:56,615 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 16:11:56,615 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:56,616 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:56,616 INFO  L85        PathProgramCache]: Analyzing trace with hash 347875612, now seen corresponding path program 1 times
[2025-02-05 16:11:56,616 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:56,616 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135507116]
[2025-02-05 16:11:56,616 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:56,618 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:56,637 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes.
[2025-02-05 16:11:56,674 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements.
[2025-02-05 16:11:56,674 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:56,674 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:56,757 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,757 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:56,757 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135507116]
[2025-02-05 16:11:56,757 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135507116] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:56,757 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:56,757 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 16:11:56,757 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605466329]
[2025-02-05 16:11:56,757 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:56,757 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 16:11:56,757 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:56,758 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 16:11:56,758 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 16:11:56,758 INFO  L87              Difference]: Start difference. First operand 1466 states and 2385 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:56,866 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:11:56,867 INFO  L93              Difference]: Finished difference Result 4675 states and 7722 transitions.
[2025-02-05 16:11:56,867 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 16:11:56,867 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:56,868 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:11:56,879 INFO  L225             Difference]: With dead ends: 4675
[2025-02-05 16:11:56,879 INFO  L226             Difference]: Without dead ends: 3292
[2025-02-05 16:11:56,885 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:56,887 INFO  L435           NwaCegarLoop]: 164 mSDtfsCounter, 284 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 549 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:56,888 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 549 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:56,892 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3292 states.
[2025-02-05 16:11:56,958 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3292 to 2366.
[2025-02-05 16:11:56,962 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2366 states, 2365 states have (on average 1.6325581395348838) internal successors, (3861), 2365 states have internal predecessors, (3861), 0 states have call successors, (0), 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,970 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 3861 transitions.
[2025-02-05 16:11:56,971 INFO  L78                 Accepts]: Start accepts. Automaton has 2366 states and 3861 transitions. Word has length 70
[2025-02-05 16:11:56,972 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:11:56,972 INFO  L471      AbstractCegarLoop]: Abstraction has 2366 states and 3861 transitions.
[2025-02-05 16:11:56,972 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:56,973 INFO  L276                IsEmpty]: Start isEmpty. Operand 2366 states and 3861 transitions.
[2025-02-05 16:11:56,973 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2025-02-05 16:11:56,973 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:56,973 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:56,973 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 16:11:56,974 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:56,975 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:56,975 INFO  L85        PathProgramCache]: Analyzing trace with hash -1666033767, now seen corresponding path program 1 times
[2025-02-05 16:11:56,975 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:56,975 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359206347]
[2025-02-05 16:11:56,975 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:56,975 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:56,987 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes.
[2025-02-05 16:11:57,000 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements.
[2025-02-05 16:11:57,000 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:57,000 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:57,043 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,044 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:57,044 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359206347]
[2025-02-05 16:11:57,044 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359206347] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:57,044 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:57,044 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:11:57,044 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669278584]
[2025-02-05 16:11:57,044 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:57,044 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:11:57,045 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:57,045 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:11:57,045 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:11:57,045 INFO  L87              Difference]: Start difference. First operand 2366 states and 3861 transitions. Second operand  has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:57,111 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:11:57,112 INFO  L93              Difference]: Finished difference Result 4632 states and 7591 transitions.
[2025-02-05 16:11:57,112 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:11:57,113 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70
[2025-02-05 16:11:57,113 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:11:57,126 INFO  L225             Difference]: With dead ends: 4632
[2025-02-05 16:11:57,126 INFO  L226             Difference]: Without dead ends: 3322
[2025-02-05 16:11:57,130 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:57,130 INFO  L435           NwaCegarLoop]: 243 mSDtfsCounter, 78 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 400 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:57,131 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 400 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:57,134 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3322 states.
[2025-02-05 16:11:57,260 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 3320.
[2025-02-05 16:11:57,265 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3320 states, 3319 states have (on average 1.619764989454655) internal successors, (5376), 3319 states have internal predecessors, (5376), 0 states have call successors, (0), 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,276 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3320 states to 3320 states and 5376 transitions.
[2025-02-05 16:11:57,277 INFO  L78                 Accepts]: Start accepts. Automaton has 3320 states and 5376 transitions. Word has length 70
[2025-02-05 16:11:57,277 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:11:57,277 INFO  L471      AbstractCegarLoop]: Abstraction has 3320 states and 5376 transitions.
[2025-02-05 16:11:57,277 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:11:57,278 INFO  L276                IsEmpty]: Start isEmpty. Operand 3320 states and 5376 transitions.
[2025-02-05 16:11:57,278 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2025-02-05 16:11:57,278 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:57,278 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:57,279 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 16:11:57,279 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:57,279 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:57,279 INFO  L85        PathProgramCache]: Analyzing trace with hash -2051749763, now seen corresponding path program 1 times
[2025-02-05 16:11:57,280 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:57,280 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158475936]
[2025-02-05 16:11:57,280 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:57,280 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:57,293 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes.
[2025-02-05 16:11:57,306 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements.
[2025-02-05 16:11:57,307 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:57,307 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:57,369 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,369 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:57,370 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158475936]
[2025-02-05 16:11:57,370 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158475936] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:57,370 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:57,370 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 16:11:57,370 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067547284]
[2025-02-05 16:11:57,370 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:57,370 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 16:11:57,371 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:57,371 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 16:11:57,371 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 16:11:57,371 INFO  L87              Difference]: Start difference. First operand 3320 states and 5376 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:57,523 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:11:57,523 INFO  L93              Difference]: Finished difference Result 10675 states and 17375 transitions.
[2025-02-05 16:11:57,524 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 16:11:57,524 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:57,524 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:11:57,551 INFO  L225             Difference]: With dead ends: 10675
[2025-02-05 16:11:57,551 INFO  L226             Difference]: Without dead ends: 7426
[2025-02-05 16:11:57,559 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:57,560 INFO  L435           NwaCegarLoop]: 164 mSDtfsCounter, 282 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 551 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:57,561 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 551 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:57,568 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7426 states.
[2025-02-05 16:11:57,694 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7426 to 5344.
[2025-02-05 16:11:57,702 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5344 states, 5343 states have (on average 1.609208309938237) internal successors, (8598), 5343 states have internal predecessors, (8598), 0 states have call successors, (0), 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,721 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 8598 transitions.
[2025-02-05 16:11:57,721 INFO  L78                 Accepts]: Start accepts. Automaton has 5344 states and 8598 transitions. Word has length 71
[2025-02-05 16:11:57,722 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:11:57,722 INFO  L471      AbstractCegarLoop]: Abstraction has 5344 states and 8598 transitions.
[2025-02-05 16:11:57,722 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:57,722 INFO  L276                IsEmpty]: Start isEmpty. Operand 5344 states and 8598 transitions.
[2025-02-05 16:11:57,722 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2025-02-05 16:11:57,722 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:57,722 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:57,723 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 16:11:57,723 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:57,723 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:57,724 INFO  L85        PathProgramCache]: Analyzing trace with hash 867427898, now seen corresponding path program 1 times
[2025-02-05 16:11:57,724 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:57,724 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697418484]
[2025-02-05 16:11:57,724 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:57,724 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:57,735 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes.
[2025-02-05 16:11:57,743 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements.
[2025-02-05 16:11:57,744 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:57,744 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:57,847 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:11:57,847 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:57,847 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697418484]
[2025-02-05 16:11:57,848 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697418484] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:57,848 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:57,848 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 16:11:57,848 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969983751]
[2025-02-05 16:11:57,848 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:57,849 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 16:11:57,849 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:57,849 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 16:11:57,850 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 16:11:57,850 INFO  L87              Difference]: Start difference. First operand 5344 states and 8598 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:58,021 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:11:58,022 INFO  L93              Difference]: Finished difference Result 16871 states and 27255 transitions.
[2025-02-05 16:11:58,022 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 16:11:58,022 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:58,023 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:11:58,063 INFO  L225             Difference]: With dead ends: 16871
[2025-02-05 16:11:58,064 INFO  L226             Difference]: Without dead ends: 11598
[2025-02-05 16:11:58,073 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:58,074 INFO  L435           NwaCegarLoop]: 164 mSDtfsCounter, 280 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 553 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:58,074 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 553 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:58,084 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11598 states.
[2025-02-05 16:11:58,246 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11598 to 8428.
[2025-02-05 16:11:58,264 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8428 states, 8427 states have (on average 1.5981962738815711) internal successors, (13468), 8427 states have internal predecessors, (13468), 0 states have call successors, (0), 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,289 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8428 states to 8428 states and 13468 transitions.
[2025-02-05 16:11:58,291 INFO  L78                 Accepts]: Start accepts. Automaton has 8428 states and 13468 transitions. Word has length 72
[2025-02-05 16:11:58,291 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:11:58,291 INFO  L471      AbstractCegarLoop]: Abstraction has 8428 states and 13468 transitions.
[2025-02-05 16:11:58,291 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:58,291 INFO  L276                IsEmpty]: Start isEmpty. Operand 8428 states and 13468 transitions.
[2025-02-05 16:11:58,291 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2025-02-05 16:11:58,292 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:58,292 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:58,292 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 16:11:58,292 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:58,292 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:58,292 INFO  L85        PathProgramCache]: Analyzing trace with hash 1822757720, now seen corresponding path program 1 times
[2025-02-05 16:11:58,293 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:58,293 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36528153]
[2025-02-05 16:11:58,293 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:58,293 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:58,338 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes.
[2025-02-05 16:11:58,351 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements.
[2025-02-05 16:11:58,352 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:58,352 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:58,528 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:58,529 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:58,529 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36528153]
[2025-02-05 16:11:58,529 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36528153] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:58,529 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:58,529 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:11:58,529 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359570284]
[2025-02-05 16:11:58,529 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:58,529 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:11:58,530 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:58,530 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:11:58,530 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:11:58,530 INFO  L87              Difference]: Start difference. First operand 8428 states and 13468 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:58,668 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:11:58,669 INFO  L93              Difference]: Finished difference Result 16787 states and 26844 transitions.
[2025-02-05 16:11:58,669 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:11:58,669 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:58,670 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:11:58,685 INFO  L225             Difference]: With dead ends: 16787
[2025-02-05 16:11:58,686 INFO  L226             Difference]: Without dead ends: 8430
[2025-02-05 16:11:58,696 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:58,696 INFO  L435           NwaCegarLoop]: 170 mSDtfsCounter, 141 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:11:58,697 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 460 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:11:58,704 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8430 states.
[2025-02-05 16:11:58,927 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8430 to 8428.
[2025-02-05 16:11:58,940 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8428 states, 8427 states have (on average 1.5833629998813339) internal successors, (13343), 8427 states have internal predecessors, (13343), 0 states have call successors, (0), 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,959 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8428 states to 8428 states and 13343 transitions.
[2025-02-05 16:11:58,960 INFO  L78                 Accepts]: Start accepts. Automaton has 8428 states and 13343 transitions. Word has length 74
[2025-02-05 16:11:58,960 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:11:58,960 INFO  L471      AbstractCegarLoop]: Abstraction has 8428 states and 13343 transitions.
[2025-02-05 16:11:58,960 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:58,961 INFO  L276                IsEmpty]: Start isEmpty. Operand 8428 states and 13343 transitions.
[2025-02-05 16:11:58,961 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-02-05 16:11:58,961 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:58,961 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:58,961 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-05 16:11:58,962 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:58,962 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:58,962 INFO  L85        PathProgramCache]: Analyzing trace with hash -2124876074, now seen corresponding path program 1 times
[2025-02-05 16:11:58,962 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:58,962 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847449177]
[2025-02-05 16:11:58,962 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:58,963 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:58,973 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-02-05 16:11:58,985 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-02-05 16:11:58,986 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:58,986 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:11:59,145 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:59,145 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:11:59,145 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847449177]
[2025-02-05 16:11:59,145 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847449177] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:11:59,145 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:11:59,145 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:11:59,145 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760483115]
[2025-02-05 16:11:59,146 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:11:59,146 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:11:59,146 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:11:59,146 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:11:59,146 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:11:59,147 INFO  L87              Difference]: Start difference. First operand 8428 states and 13343 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:59,405 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:11:59,405 INFO  L93              Difference]: Finished difference Result 24145 states and 38378 transitions.
[2025-02-05 16:11:59,405 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:11:59,406 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:59,406 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:11:59,439 INFO  L225             Difference]: With dead ends: 24145
[2025-02-05 16:11:59,439 INFO  L226             Difference]: Without dead ends: 15788
[2025-02-05 16:11:59,454 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:59,455 INFO  L435           NwaCegarLoop]: 165 mSDtfsCounter, 137 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:11:59,455 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 465 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:11:59,470 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15788 states.
[2025-02-05 16:11:59,792 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15788 to 15786.
[2025-02-05 16:11:59,812 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15786 states, 15785 states have (on average 1.5671840354767184) internal successors, (24738), 15785 states have internal predecessors, (24738), 0 states have call successors, (0), 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,837 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15786 states to 15786 states and 24738 transitions.
[2025-02-05 16:11:59,838 INFO  L78                 Accepts]: Start accepts. Automaton has 15786 states and 24738 transitions. Word has length 77
[2025-02-05 16:11:59,838 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:11:59,838 INFO  L471      AbstractCegarLoop]: Abstraction has 15786 states and 24738 transitions.
[2025-02-05 16:11:59,839 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:59,839 INFO  L276                IsEmpty]: Start isEmpty. Operand 15786 states and 24738 transitions.
[2025-02-05 16:11:59,839 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2025-02-05 16:11:59,839 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:11:59,839 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:59,840 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-05 16:11:59,840 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:11:59,840 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:11:59,840 INFO  L85        PathProgramCache]: Analyzing trace with hash -1414264079, now seen corresponding path program 1 times
[2025-02-05 16:11:59,840 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:11:59,840 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182856883]
[2025-02-05 16:11:59,840 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:11:59,840 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:11:59,849 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes.
[2025-02-05 16:11:59,871 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements.
[2025-02-05 16:11:59,871 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:11:59,871 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:12:00,044 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:12:00,045 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:12:00,045 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182856883]
[2025-02-05 16:12:00,045 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182856883] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:12:00,045 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:12:00,045 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:12:00,045 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044217736]
[2025-02-05 16:12:00,045 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:12:00,046 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:12:00,046 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:12:00,046 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:12:00,046 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:12:00,047 INFO  L87              Difference]: Start difference. First operand 15786 states and 24738 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:12:00,180 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:12:00,180 INFO  L93              Difference]: Finished difference Result 16874 states and 26187 transitions.
[2025-02-05 16:12:00,180 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:12:00,181 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:12:00,181 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:12:00,214 INFO  L225             Difference]: With dead ends: 16874
[2025-02-05 16:12:00,214 INFO  L226             Difference]: Without dead ends: 16872
[2025-02-05 16:12:00,221 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:12:00,222 INFO  L435           NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 674 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:12:00,222 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 674 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:12:00,235 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16872 states.
[2025-02-05 16:12:00,454 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16872 to 16872.
[2025-02-05 16:12:00,477 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 16872 states, 16871 states have (on average 1.5301404777428724) internal successors, (25815), 16871 states have internal predecessors, (25815), 0 states have call successors, (0), 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,503 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16872 states to 16872 states and 25815 transitions.
[2025-02-05 16:12:00,505 INFO  L78                 Accepts]: Start accepts. Automaton has 16872 states and 25815 transitions. Word has length 78
[2025-02-05 16:12:00,505 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:12:00,505 INFO  L471      AbstractCegarLoop]: Abstraction has 16872 states and 25815 transitions.
[2025-02-05 16:12:00,505 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:12:00,505 INFO  L276                IsEmpty]: Start isEmpty. Operand 16872 states and 25815 transitions.
[2025-02-05 16:12:00,507 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-02-05 16:12:00,507 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:12:00,507 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:12:00,507 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-05 16:12:00,508 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:12:00,508 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:12:00,508 INFO  L85        PathProgramCache]: Analyzing trace with hash 324582942, now seen corresponding path program 1 times
[2025-02-05 16:12:00,508 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:12:00,508 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982814439]
[2025-02-05 16:12:00,508 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:12:00,508 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:12:00,517 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-02-05 16:12:00,528 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-02-05 16:12:00,528 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:12:00,528 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:12:00,572 INFO  L134       CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:12:00,572 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:12:00,573 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982814439]
[2025-02-05 16:12:00,573 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982814439] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:12:00,573 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:12:00,573 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:12:00,573 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416934462]
[2025-02-05 16:12:00,573 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:12:00,573 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:12:00,573 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:12:00,574 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:12:00,574 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:12:00,574 INFO  L87              Difference]: Start difference. First operand 16872 states and 25815 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:01,013 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:12:01,013 INFO  L93              Difference]: Finished difference Result 50355 states and 76975 transitions.
[2025-02-05 16:12:01,014 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:12:01,014 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 103
[2025-02-05 16:12:01,014 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:12:01,087 INFO  L225             Difference]: With dead ends: 50355
[2025-02-05 16:12:01,087 INFO  L226             Difference]: Without dead ends: 33550
[2025-02-05 16:12:01,104 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:01,105 INFO  L435           NwaCegarLoop]: 235 mSDtfsCounter, 111 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 400 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:01,106 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 400 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:01,127 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 33550 states.
[2025-02-05 16:12:01,990 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 33550 to 33548.
[2025-02-05 16:12:02,108 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 33548 states, 33547 states have (on average 1.5150982204071899) internal successors, (50827), 33547 states have internal predecessors, (50827), 0 states have call successors, (0), 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,289 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33548 states to 33548 states and 50827 transitions.
[2025-02-05 16:12:02,292 INFO  L78                 Accepts]: Start accepts. Automaton has 33548 states and 50827 transitions. Word has length 103
[2025-02-05 16:12:02,293 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:12:02,296 INFO  L471      AbstractCegarLoop]: Abstraction has 33548 states and 50827 transitions.
[2025-02-05 16:12:02,297 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:02,297 INFO  L276                IsEmpty]: Start isEmpty. Operand 33548 states and 50827 transitions.
[2025-02-05 16:12:02,303 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-02-05 16:12:02,306 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:12:02,307 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]
[2025-02-05 16:12:02,307 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-05 16:12:02,307 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:12:02,308 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:12:02,308 INFO  L85        PathProgramCache]: Analyzing trace with hash 2104417837, now seen corresponding path program 1 times
[2025-02-05 16:12:02,308 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:12:02,308 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868967641]
[2025-02-05 16:12:02,309 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:12:02,309 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:12:02,337 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-02-05 16:12:02,360 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-02-05 16:12:02,361 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:12:02,361 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:12:02,430 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2025-02-05 16:12:02,431 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:12:02,431 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868967641]
[2025-02-05 16:12:02,431 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868967641] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:12:02,431 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:12:02,431 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:12:02,431 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126546777]
[2025-02-05 16:12:02,431 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:12:02,432 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:12:02,432 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:12:02,433 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:12:02,433 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:12:02,434 INFO  L87              Difference]: Start difference. First operand 33548 states and 50827 transitions. Second operand  has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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,246 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:12:03,246 INFO  L93              Difference]: Finished difference Result 100178 states and 151632 transitions.
[2025-02-05 16:12:03,247 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:12:03,247 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 103
[2025-02-05 16:12:03,247 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:12:03,378 INFO  L225             Difference]: With dead ends: 100178
[2025-02-05 16:12:03,379 INFO  L226             Difference]: Without dead ends: 66733
[2025-02-05 16:12:03,416 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:03,417 INFO  L435           NwaCegarLoop]: 236 mSDtfsCounter, 110 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 401 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:03,417 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 401 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:03,472 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 66733 states.
[2025-02-05 16:12:04,405 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 66733 to 66731.
[2025-02-05 16:12:04,476 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 66731 states, 66730 states have (on average 1.4999550427094261) internal successors, (100092), 66730 states have internal predecessors, (100092), 0 states have call successors, (0), 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:04,745 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 66731 states to 66731 states and 100092 transitions.
[2025-02-05 16:12:04,750 INFO  L78                 Accepts]: Start accepts. Automaton has 66731 states and 100092 transitions. Word has length 103
[2025-02-05 16:12:04,750 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:12:04,750 INFO  L471      AbstractCegarLoop]: Abstraction has 66731 states and 100092 transitions.
[2025-02-05 16:12:04,750 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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:04,750 INFO  L276                IsEmpty]: Start isEmpty. Operand 66731 states and 100092 transitions.
[2025-02-05 16:12:04,755 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-02-05 16:12:04,756 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:12:04,756 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]
[2025-02-05 16:12:04,756 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-02-05 16:12:04,756 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:12:04,756 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:12:04,757 INFO  L85        PathProgramCache]: Analyzing trace with hash -1177611716, now seen corresponding path program 1 times
[2025-02-05 16:12:04,757 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:12:04,757 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360178320]
[2025-02-05 16:12:04,757 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:12:04,757 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:12:04,769 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-02-05 16:12:04,785 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-02-05 16:12:04,786 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:12:04,786 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:12:04,837 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:12:04,837 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:12:04,837 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360178320]
[2025-02-05 16:12:04,837 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360178320] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:12:04,837 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:12:04,837 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:12:04,838 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670378436]
[2025-02-05 16:12:04,838 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:12:04,838 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:12:04,838 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:12:04,838 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:12:04,838 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:12:04,839 INFO  L87              Difference]: Start difference. First operand 66731 states and 100092 transitions. Second operand  has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:12:06,233 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:12:06,234 INFO  L93              Difference]: Finished difference Result 199275 states and 298602 transitions.
[2025-02-05 16:12:06,234 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:12:06,235 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103
[2025-02-05 16:12:06,235 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:12:06,698 INFO  L225             Difference]: With dead ends: 199275
[2025-02-05 16:12:06,699 INFO  L226             Difference]: Without dead ends: 132729
[2025-02-05 16:12:06,743 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:06,744 INFO  L435           NwaCegarLoop]: 221 mSDtfsCounter, 96 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 386 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:06,744 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 386 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:06,826 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 132729 states.
[2025-02-05 16:12:08,925 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 132729 to 132727.
[2025-02-05 16:12:09,027 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 132727 states, 132726 states have (on average 1.4846224552838179) internal successors, (197048), 132726 states have internal predecessors, (197048), 0 states have call successors, (0), 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,453 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 132727 states to 132727 states and 197048 transitions.
[2025-02-05 16:12:09,473 INFO  L78                 Accepts]: Start accepts. Automaton has 132727 states and 197048 transitions. Word has length 103
[2025-02-05 16:12:09,478 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:12:09,478 INFO  L471      AbstractCegarLoop]: Abstraction has 132727 states and 197048 transitions.
[2025-02-05 16:12:09,478 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:12:09,478 INFO  L276                IsEmpty]: Start isEmpty. Operand 132727 states and 197048 transitions.
[2025-02-05 16:12:09,489 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-02-05 16:12:09,489 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:12:09,490 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]
[2025-02-05 16:12:09,490 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-02-05 16:12:09,490 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:12:09,490 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:12:09,490 INFO  L85        PathProgramCache]: Analyzing trace with hash -105506772, now seen corresponding path program 1 times
[2025-02-05 16:12:09,491 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:12:09,491 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285547377]
[2025-02-05 16:12:09,491 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:12:09,491 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:12:09,501 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-02-05 16:12:09,512 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-02-05 16:12:09,512 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:12:09,512 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:12:09,559 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:09,559 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:12:09,559 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285547377]
[2025-02-05 16:12:09,559 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285547377] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:12:09,559 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:12:09,559 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:12:09,559 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44376847]
[2025-02-05 16:12:09,559 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:12:09,560 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:12:09,560 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:12:09,560 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:12:09,560 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:12:09,560 INFO  L87              Difference]: Start difference. First operand 132727 states and 197048 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:12,590 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:12:12,591 INFO  L93              Difference]: Finished difference Result 396375 states and 587895 transitions.
[2025-02-05 16:12:12,591 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:12:12,591 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 103
[2025-02-05 16:12:12,591 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:12:13,194 INFO  L225             Difference]: With dead ends: 396375
[2025-02-05 16:12:13,194 INFO  L226             Difference]: Without dead ends: 264057
[2025-02-05 16:12:13,307 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:13,308 INFO  L435           NwaCegarLoop]: 252 mSDtfsCounter, 130 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 417 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:13,308 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 417 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:13,543 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 264057 states.
[2025-02-05 16:12:17,837 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 264057 to 264055.
[2025-02-05 16:12:18,050 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 264055 states, 264054 states have (on average 1.4692184174449165) internal successors, (387953), 264054 states have internal predecessors, (387953), 0 states have call successors, (0), 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:18,661 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 264055 states to 264055 states and 387953 transitions.
[2025-02-05 16:12:18,675 INFO  L78                 Accepts]: Start accepts. Automaton has 264055 states and 387953 transitions. Word has length 103
[2025-02-05 16:12:18,675 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:12:18,675 INFO  L471      AbstractCegarLoop]: Abstraction has 264055 states and 387953 transitions.
[2025-02-05 16:12:18,675 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:18,675 INFO  L276                IsEmpty]: Start isEmpty. Operand 264055 states and 387953 transitions.
[2025-02-05 16:12:18,689 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-02-05 16:12:18,690 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:12:18,690 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]
[2025-02-05 16:12:18,690 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-02-05 16:12:18,691 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:12:18,691 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:12:18,691 INFO  L85        PathProgramCache]: Analyzing trace with hash -554203411, now seen corresponding path program 1 times
[2025-02-05 16:12:18,691 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:12:18,691 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027906421]
[2025-02-05 16:12:18,691 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:12:18,691 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:12:18,700 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-02-05 16:12:18,708 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-02-05 16:12:18,708 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:12:18,708 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:12:18,749 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:18,749 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:12:18,750 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027906421]
[2025-02-05 16:12:18,750 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027906421] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:12:18,750 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:12:18,750 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:12:18,750 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218680087]
[2025-02-05 16:12:18,750 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:12:18,750 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:12:18,750 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:12:18,750 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:12:18,751 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:12:18,751 INFO  L87              Difference]: Start difference. First operand 264055 states and 387953 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:21,915 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:12:21,915 INFO  L93              Difference]: Finished difference Result 396759 states and 581611 transitions.
[2025-02-05 16:12:21,915 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:12:21,916 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 103
[2025-02-05 16:12:21,916 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:12:22,516 INFO  L225             Difference]: With dead ends: 396759
[2025-02-05 16:12:22,516 INFO  L226             Difference]: Without dead ends: 264409
[2025-02-05 16:12:22,615 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:22,616 INFO  L435           NwaCegarLoop]: 281 mSDtfsCounter, 101 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:12:22,616 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 448 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:12:22,807 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 264409 states.
[2025-02-05 16:12:26,525 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 264409 to 264407.
[2025-02-05 16:12:26,718 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 264407 states, 264406 states have (on average 1.4559919215146404) internal successors, (384973), 264406 states have internal predecessors, (384973), 0 states have call successors, (0), 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:27,418 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 264407 states to 264407 states and 384973 transitions.
[2025-02-05 16:12:27,432 INFO  L78                 Accepts]: Start accepts. Automaton has 264407 states and 384973 transitions. Word has length 103
[2025-02-05 16:12:27,433 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:12:27,433 INFO  L471      AbstractCegarLoop]: Abstraction has 264407 states and 384973 transitions.
[2025-02-05 16:12:27,433 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:27,433 INFO  L276                IsEmpty]: Start isEmpty. Operand 264407 states and 384973 transitions.
[2025-02-05 16:12:27,446 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-02-05 16:12:27,446 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:12:27,446 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]
[2025-02-05 16:12:27,446 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-02-05 16:12:27,447 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:12:27,447 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:12:27,447 INFO  L85        PathProgramCache]: Analyzing trace with hash 953348398, now seen corresponding path program 1 times
[2025-02-05 16:12:27,447 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:12:27,447 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059735190]
[2025-02-05 16:12:27,447 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:12:27,447 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:12:27,456 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-02-05 16:12:27,464 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-02-05 16:12:27,464 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:12:27,464 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:12:27,494 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:27,495 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:12:27,495 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059735190]
[2025-02-05 16:12:27,495 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059735190] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:12:27,495 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:12:27,495 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:12:27,495 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003794939]
[2025-02-05 16:12:27,495 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:12:27,496 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:12:27,496 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:12:27,497 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:12:27,497 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:12:27,497 INFO  L87              Difference]: Start difference. First operand 264407 states and 384973 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:30,281 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:12:30,282 INFO  L93              Difference]: Finished difference Result 397315 states and 577182 transitions.
[2025-02-05 16:12:30,282 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:12:30,282 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 103
[2025-02-05 16:12:30,283 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:12:30,750 INFO  L225             Difference]: With dead ends: 397315
[2025-02-05 16:12:30,751 INFO  L226             Difference]: Without dead ends: 264997
[2025-02-05 16:12:30,855 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:30,855 INFO  L435           NwaCegarLoop]: 299 mSDtfsCounter, 115 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:12:30,855 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 466 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:12:31,050 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 264997 states.
[2025-02-05 16:12:34,864 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 264997 to 264995.
[2025-02-05 16:12:35,047 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 264995 states, 264994 states have (on average 1.4425534163037654) internal successors, (382268), 264994 states have internal predecessors, (382268), 0 states have call successors, (0), 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:35,550 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 264995 states to 264995 states and 382268 transitions.
[2025-02-05 16:12:35,572 INFO  L78                 Accepts]: Start accepts. Automaton has 264995 states and 382268 transitions. Word has length 103
[2025-02-05 16:12:35,572 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:12:35,572 INFO  L471      AbstractCegarLoop]: Abstraction has 264995 states and 382268 transitions.
[2025-02-05 16:12:35,573 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:35,573 INFO  L276                IsEmpty]: Start isEmpty. Operand 264995 states and 382268 transitions.
[2025-02-05 16:12:35,588 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-02-05 16:12:35,589 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:12:35,589 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]
[2025-02-05 16:12:35,589 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-02-05 16:12:35,589 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:12:35,590 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:12:35,590 INFO  L85        PathProgramCache]: Analyzing trace with hash -854106065, now seen corresponding path program 1 times
[2025-02-05 16:12:35,590 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:12:35,590 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481316374]
[2025-02-05 16:12:35,590 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:12:35,590 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:12:35,599 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-02-05 16:12:35,606 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-02-05 16:12:35,606 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:12:35,606 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:12:35,683 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-02-05 16:12:35,684 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:12:35,684 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481316374]
[2025-02-05 16:12:35,684 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481316374] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:12:35,684 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:12:35,684 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:12:35,685 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798938265]
[2025-02-05 16:12:35,685 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:12:35,685 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:12:35,685 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:12:35,685 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:12:35,685 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:12:35,686 INFO  L87              Difference]: Start difference. First operand 264995 states and 382268 transitions. Second operand  has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 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)