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


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


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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c13079d4927c37ef7c4e12e861d352aca7538cf90caea314288bdceb904b4d72
[2025-03-08 09:40:39,761 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 09:40:39,769 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 09:40:39,772 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 09:40:39,774 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 09:40:39,774 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 09:40:39,775 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vMiim_p1.c
[2025-03-08 09:40:40,920 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa368c80/9de6fc379464417ca36be466190c6f99/FLAG6a827eae4
[2025-03-08 09:40:41,185 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 09:40:41,187 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vMiim_p1.c
[2025-03-08 09:40:41,197 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa368c80/9de6fc379464417ca36be466190c6f99/FLAG6a827eae4
[2025-03-08 09:40:41,207 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa368c80/9de6fc379464417ca36be466190c6f99
[2025-03-08 09:40:41,209 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 09:40:41,210 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 09:40:41,211 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 09:40:41,211 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 09:40:41,214 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 09:40:41,215 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:40:41" (1/1) ...
[2025-03-08 09:40:41,215 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a25cf7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:41, skipping insertion in model container
[2025-03-08 09:40:41,215 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:40:41" (1/1) ...
[2025-03-08 09:40:41,245 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 09:40:41,341 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vMiim_p1.c[1258,1271]
[2025-03-08 09:40:41,471 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 09:40:41,478 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 09:40:41,485 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vMiim_p1.c[1258,1271]
[2025-03-08 09:40:41,569 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 09:40:41,579 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 09:40:41,580 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:41 WrapperNode
[2025-03-08 09:40:41,580 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 09:40:41,581 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 09:40:41,581 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 09:40:41,581 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 09:40:41,585 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:41" (1/1) ...
[2025-03-08 09:40:41,601 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:41" (1/1) ...
[2025-03-08 09:40:41,696 INFO  L138                Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1475
[2025-03-08 09:40:41,696 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 09:40:41,697 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 09:40:41,697 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 09:40:41,697 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 09:40:41,703 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:41" (1/1) ...
[2025-03-08 09:40:41,703 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:41" (1/1) ...
[2025-03-08 09:40:41,725 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:41" (1/1) ...
[2025-03-08 09:40:41,780 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-08 09:40:41,780 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:41" (1/1) ...
[2025-03-08 09:40:41,781 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:41" (1/1) ...
[2025-03-08 09:40:41,848 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:41" (1/1) ...
[2025-03-08 09:40:41,855 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:41" (1/1) ...
[2025-03-08 09:40:41,864 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:41" (1/1) ...
[2025-03-08 09:40:41,872 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:41" (1/1) ...
[2025-03-08 09:40:41,888 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 09:40:41,889 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 09:40:41,889 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 09:40:41,889 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 09:40:41,891 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:41" (1/1) ...
[2025-03-08 09:40:41,895 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 09:40:41,903 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 09:40:41,915 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 09:40:41,920 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 09:40:41,934 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 09:40:41,935 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 09:40:41,935 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 09:40:41,935 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 09:40:42,106 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 09:40:42,107 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 09:40:43,235 INFO  L?                        ?]: Removed 723 outVars from TransFormulas that were not future-live.
[2025-03-08 09:40:43,235 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 09:40:43,297 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 09:40:43,300 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 09:40:43,300 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:40:43 BoogieIcfgContainer
[2025-03-08 09:40:43,300 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 09:40:43,302 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 09:40:43,302 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 09:40:43,306 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 09:40:43,306 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:40:41" (1/3) ...
[2025-03-08 09:40:43,306 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac621e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:40:43, skipping insertion in model container
[2025-03-08 09:40:43,307 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:41" (2/3) ...
[2025-03-08 09:40:43,307 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac621e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:40:43, skipping insertion in model container
[2025-03-08 09:40:43,307 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:40:43" (3/3) ...
[2025-03-08 09:40:43,308 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_vMiim_p1.c
[2025-03-08 09:40:43,318 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 09:40:43,319 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_QF_BV_vMiim_p1.c that has 1 procedures, 346 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 09:40:43,359 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 09:40:43,368 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;@931f5a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 09:40:43,368 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 09:40:43,373 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 346 states, 344 states have (on average 1.497093023255814) internal successors, (515), 345 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:43,380 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2025-03-08 09:40:43,380 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:40:43,380 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:40:43,382 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:40:43,386 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:40:43,387 INFO  L85        PathProgramCache]: Analyzing trace with hash 1950612816, now seen corresponding path program 1 times
[2025-03-08 09:40:43,393 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:40:43,393 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854823343]
[2025-03-08 09:40:43,394 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:40:43,395 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:40:43,480 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes.
[2025-03-08 09:40:43,593 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements.
[2025-03-08 09:40:43,593 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:40:43,593 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:40:44,446 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:40:44,447 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:40:44,447 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854823343]
[2025-03-08 09:40:44,447 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854823343] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:40:44,447 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:40:44,448 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-08 09:40:44,448 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140189506]
[2025-03-08 09:40:44,449 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:40:44,451 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 09:40:44,452 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:40:44,468 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 09:40:44,468 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-03-08 09:40:44,470 INFO  L87              Difference]: Start difference. First operand  has 346 states, 344 states have (on average 1.497093023255814) internal successors, (515), 345 states have internal predecessors, (515), 0 states have call successors, (0), 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 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:44,977 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:40:44,978 INFO  L93              Difference]: Finished difference Result 590 states and 882 transitions.
[2025-03-08 09:40:44,979 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 09:40:44,980 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 85
[2025-03-08 09:40:44,980 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:40:44,989 INFO  L225             Difference]: With dead ends: 590
[2025-03-08 09:40:44,989 INFO  L226             Difference]: Without dead ends: 370
[2025-03-08 09:40:44,993 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156
[2025-03-08 09:40:44,994 INFO  L435           NwaCegarLoop]: 409 mSDtfsCounter, 512 mSDsluCounter, 2041 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 2450 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 09:40:44,998 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 2450 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 09:40:45,011 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 370 states.
[2025-03-08 09:40:45,035 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 369.
[2025-03-08 09:40:45,038 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 369 states, 368 states have (on average 1.4891304347826086) internal successors, (548), 368 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:45,041 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 548 transitions.
[2025-03-08 09:40:45,043 INFO  L78                 Accepts]: Start accepts. Automaton has 369 states and 548 transitions. Word has length 85
[2025-03-08 09:40:45,044 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:40:45,044 INFO  L471      AbstractCegarLoop]: Abstraction has 369 states and 548 transitions.
[2025-03-08 09:40:45,044 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:45,045 INFO  L276                IsEmpty]: Start isEmpty. Operand 369 states and 548 transitions.
[2025-03-08 09:40:45,046 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2025-03-08 09:40:45,047 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:40:45,047 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:40:45,048 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-08 09:40:45,048 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:40:45,048 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:40:45,049 INFO  L85        PathProgramCache]: Analyzing trace with hash 147027927, now seen corresponding path program 1 times
[2025-03-08 09:40:45,049 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:40:45,049 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209118057]
[2025-03-08 09:40:45,049 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:40:45,050 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:40:45,073 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes.
[2025-03-08 09:40:45,098 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements.
[2025-03-08 09:40:45,102 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:40:45,103 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:40:45,312 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:40:45,312 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:40:45,312 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209118057]
[2025-03-08 09:40:45,312 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209118057] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:40:45,312 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:40:45,312 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 09:40:45,313 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38774821]
[2025-03-08 09:40:45,313 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:40:45,314 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 09:40:45,314 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:40:45,315 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 09:40:45,315 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:40:45,315 INFO  L87              Difference]: Start difference. First operand 369 states and 548 transitions. Second operand  has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:45,475 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:40:45,475 INFO  L93              Difference]: Finished difference Result 373 states and 552 transitions.
[2025-03-08 09:40:45,476 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 09:40:45,476 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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 86
[2025-03-08 09:40:45,476 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:40:45,477 INFO  L225             Difference]: With dead ends: 373
[2025-03-08 09:40:45,477 INFO  L226             Difference]: Without dead ends: 371
[2025-03-08 09:40:45,478 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:40:45,478 INFO  L435           NwaCegarLoop]: 425 mSDtfsCounter, 0 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 09:40:45,478 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1270 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 09:40:45,479 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 371 states.
[2025-03-08 09:40:45,492 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371.
[2025-03-08 09:40:45,493 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 371 states, 370 states have (on average 1.4864864864864864) internal successors, (550), 370 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:45,498 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 550 transitions.
[2025-03-08 09:40:45,498 INFO  L78                 Accepts]: Start accepts. Automaton has 371 states and 550 transitions. Word has length 86
[2025-03-08 09:40:45,499 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:40:45,499 INFO  L471      AbstractCegarLoop]: Abstraction has 371 states and 550 transitions.
[2025-03-08 09:40:45,499 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:45,500 INFO  L276                IsEmpty]: Start isEmpty. Operand 371 states and 550 transitions.
[2025-03-08 09:40:45,501 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2025-03-08 09:40:45,503 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:40:45,503 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:40:45,503 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 09:40:45,503 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:40:45,504 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:40:45,507 INFO  L85        PathProgramCache]: Analyzing trace with hash 267577894, now seen corresponding path program 1 times
[2025-03-08 09:40:45,507 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:40:45,507 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082876820]
[2025-03-08 09:40:45,507 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:40:45,507 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:40:45,536 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes.
[2025-03-08 09:40:45,551 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements.
[2025-03-08 09:40:45,552 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:40:45,552 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:40:45,689 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:40:45,689 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:40:45,689 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082876820]
[2025-03-08 09:40:45,689 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082876820] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:40:45,689 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:40:45,689 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 09:40:45,689 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320501269]
[2025-03-08 09:40:45,689 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:40:45,690 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 09:40:45,690 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:40:45,690 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 09:40:45,690 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:40:45,691 INFO  L87              Difference]: Start difference. First operand 371 states and 550 transitions. Second operand  has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:45,848 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:40:45,849 INFO  L93              Difference]: Finished difference Result 592 states and 878 transitions.
[2025-03-08 09:40:45,849 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 09:40:45,849 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 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 87
[2025-03-08 09:40:45,850 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:40:45,854 INFO  L225             Difference]: With dead ends: 592
[2025-03-08 09:40:45,854 INFO  L226             Difference]: Without dead ends: 373
[2025-03-08 09:40:45,855 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:40:45,855 INFO  L435           NwaCegarLoop]: 425 mSDtfsCounter, 0 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 09:40:45,856 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1267 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 09:40:45,857 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 373 states.
[2025-03-08 09:40:45,870 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373.
[2025-03-08 09:40:45,872 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 373 states, 372 states have (on average 1.4838709677419355) internal successors, (552), 372 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:45,875 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 552 transitions.
[2025-03-08 09:40:45,875 INFO  L78                 Accepts]: Start accepts. Automaton has 373 states and 552 transitions. Word has length 87
[2025-03-08 09:40:45,875 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:40:45,875 INFO  L471      AbstractCegarLoop]: Abstraction has 373 states and 552 transitions.
[2025-03-08 09:40:45,876 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:45,876 INFO  L276                IsEmpty]: Start isEmpty. Operand 373 states and 552 transitions.
[2025-03-08 09:40:45,877 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2025-03-08 09:40:45,877 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:40:45,877 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:40:45,878 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 09:40:45,878 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:40:45,878 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:40:45,878 INFO  L85        PathProgramCache]: Analyzing trace with hash 1636489650, now seen corresponding path program 1 times
[2025-03-08 09:40:45,878 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:40:45,878 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425127984]
[2025-03-08 09:40:45,878 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:40:45,879 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:40:45,898 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes.
[2025-03-08 09:40:45,913 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements.
[2025-03-08 09:40:45,913 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:40:45,913 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:40:46,184 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:40:46,184 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:40:46,184 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425127984]
[2025-03-08 09:40:46,184 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425127984] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:40:46,184 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:40:46,184 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-08 09:40:46,184 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242008633]
[2025-03-08 09:40:46,184 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:40:46,184 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 09:40:46,184 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:40:46,185 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 09:40:46,185 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-03-08 09:40:46,187 INFO  L87              Difference]: Start difference. First operand 373 states and 552 transitions. Second operand  has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:46,563 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:40:46,563 INFO  L93              Difference]: Finished difference Result 600 states and 888 transitions.
[2025-03-08 09:40:46,564 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 09:40:46,564 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 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 88
[2025-03-08 09:40:46,564 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:40:46,565 INFO  L225             Difference]: With dead ends: 600
[2025-03-08 09:40:46,565 INFO  L226             Difference]: Without dead ends: 379
[2025-03-08 09:40:46,566 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156
[2025-03-08 09:40:46,566 INFO  L435           NwaCegarLoop]: 410 mSDtfsCounter, 513 mSDsluCounter, 2043 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 2453 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 09:40:46,566 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 2453 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 09:40:46,567 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 379 states.
[2025-03-08 09:40:46,576 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 378.
[2025-03-08 09:40:46,577 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 378 states, 377 states have (on average 1.4827586206896552) internal successors, (559), 377 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:46,578 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 559 transitions.
[2025-03-08 09:40:46,580 INFO  L78                 Accepts]: Start accepts. Automaton has 378 states and 559 transitions. Word has length 88
[2025-03-08 09:40:46,581 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:40:46,581 INFO  L471      AbstractCegarLoop]: Abstraction has 378 states and 559 transitions.
[2025-03-08 09:40:46,581 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:46,581 INFO  L276                IsEmpty]: Start isEmpty. Operand 378 states and 559 transitions.
[2025-03-08 09:40:46,582 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2025-03-08 09:40:46,582 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:40:46,582 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:40:46,582 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 09:40:46,582 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:40:46,583 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:40:46,583 INFO  L85        PathProgramCache]: Analyzing trace with hash -386890942, now seen corresponding path program 1 times
[2025-03-08 09:40:46,584 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:40:46,584 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373102122]
[2025-03-08 09:40:46,584 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:40:46,584 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:40:46,605 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-03-08 09:40:46,622 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-03-08 09:40:46,623 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:40:46,623 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:40:46,966 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:40:46,968 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:40:46,968 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373102122]
[2025-03-08 09:40:46,968 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373102122] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:40:46,968 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:40:46,968 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 09:40:46,968 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106210104]
[2025-03-08 09:40:46,968 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:40:46,968 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 09:40:46,968 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:40:46,969 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 09:40:46,969 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:40:46,969 INFO  L87              Difference]: Start difference. First operand 378 states and 559 transitions. Second operand  has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:47,305 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:40:47,305 INFO  L93              Difference]: Finished difference Result 802 states and 1183 transitions.
[2025-03-08 09:40:47,306 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 09:40:47,306 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 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 90
[2025-03-08 09:40:47,306 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:40:47,308 INFO  L225             Difference]: With dead ends: 802
[2025-03-08 09:40:47,308 INFO  L226             Difference]: Without dead ends: 569
[2025-03-08 09:40:47,308 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2025-03-08 09:40:47,309 INFO  L435           NwaCegarLoop]: 408 mSDtfsCounter, 1070 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1070 SdHoareTripleChecker+Valid, 2039 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 09:40:47,309 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1070 Valid, 2039 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 09:40:47,310 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 569 states.
[2025-03-08 09:40:47,314 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 379.
[2025-03-08 09:40:47,315 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 379 states, 378 states have (on average 1.4788359788359788) internal successors, (559), 378 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:47,316 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 559 transitions.
[2025-03-08 09:40:47,316 INFO  L78                 Accepts]: Start accepts. Automaton has 379 states and 559 transitions. Word has length 90
[2025-03-08 09:40:47,316 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:40:47,316 INFO  L471      AbstractCegarLoop]: Abstraction has 379 states and 559 transitions.
[2025-03-08 09:40:47,316 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:47,316 INFO  L276                IsEmpty]: Start isEmpty. Operand 379 states and 559 transitions.
[2025-03-08 09:40:47,317 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-03-08 09:40:47,317 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:40:47,317 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:40:47,317 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 09:40:47,317 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:40:47,317 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:40:47,317 INFO  L85        PathProgramCache]: Analyzing trace with hash 1882852433, now seen corresponding path program 1 times
[2025-03-08 09:40:47,317 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:40:47,317 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943434721]
[2025-03-08 09:40:47,318 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:40:47,318 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:40:47,335 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-03-08 09:40:47,347 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-03-08 09:40:47,347 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:40:47,347 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:40:47,537 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:40:47,537 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:40:47,538 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943434721]
[2025-03-08 09:40:47,538 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943434721] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:40:47,538 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:40:47,538 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 09:40:47,538 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637287664]
[2025-03-08 09:40:47,538 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:40:47,538 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 09:40:47,538 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:40:47,539 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 09:40:47,539 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:40:47,539 INFO  L87              Difference]: Start difference. First operand 379 states and 559 transitions. Second operand  has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:47,840 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:40:47,841 INFO  L93              Difference]: Finished difference Result 652 states and 955 transitions.
[2025-03-08 09:40:47,841 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 09:40:47,841 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 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 91
[2025-03-08 09:40:47,841 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:40:47,843 INFO  L225             Difference]: With dead ends: 652
[2025-03-08 09:40:47,843 INFO  L226             Difference]: Without dead ends: 414
[2025-03-08 09:40:47,843 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2025-03-08 09:40:47,844 INFO  L435           NwaCegarLoop]: 411 mSDtfsCounter, 600 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 2054 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 09:40:47,845 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 2054 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 09:40:47,845 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 414 states.
[2025-03-08 09:40:47,849 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 380.
[2025-03-08 09:40:47,856 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 380 states, 379 states have (on average 1.474934036939314) internal successors, (559), 379 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:47,857 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 559 transitions.
[2025-03-08 09:40:47,857 INFO  L78                 Accepts]: Start accepts. Automaton has 380 states and 559 transitions. Word has length 91
[2025-03-08 09:40:47,857 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:40:47,857 INFO  L471      AbstractCegarLoop]: Abstraction has 380 states and 559 transitions.
[2025-03-08 09:40:47,857 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:47,857 INFO  L276                IsEmpty]: Start isEmpty. Operand 380 states and 559 transitions.
[2025-03-08 09:40:47,858 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2025-03-08 09:40:47,858 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:40:47,858 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:40:47,858 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 09:40:47,858 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:40:47,858 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:40:47,858 INFO  L85        PathProgramCache]: Analyzing trace with hash -377840377, now seen corresponding path program 1 times
[2025-03-08 09:40:47,858 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:40:47,858 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964493323]
[2025-03-08 09:40:47,859 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:40:47,859 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:40:47,876 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes.
[2025-03-08 09:40:47,888 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements.
[2025-03-08 09:40:47,888 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:40:47,888 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:40:48,032 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:40:48,032 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:40:48,032 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964493323]
[2025-03-08 09:40:48,032 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964493323] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:40:48,032 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:40:48,032 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 09:40:48,032 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337211507]
[2025-03-08 09:40:48,033 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:40:48,033 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 09:40:48,033 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:40:48,033 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 09:40:48,033 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:40:48,034 INFO  L87              Difference]: Start difference. First operand 380 states and 559 transitions. Second operand  has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:48,330 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:40:48,331 INFO  L93              Difference]: Finished difference Result 682 states and 997 transitions.
[2025-03-08 09:40:48,331 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 09:40:48,331 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92
[2025-03-08 09:40:48,331 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:40:48,333 INFO  L225             Difference]: With dead ends: 682
[2025-03-08 09:40:48,333 INFO  L226             Difference]: Without dead ends: 439
[2025-03-08 09:40:48,333 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2025-03-08 09:40:48,334 INFO  L435           NwaCegarLoop]: 410 mSDtfsCounter, 670 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 2049 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 09:40:48,334 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 2049 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 09:40:48,336 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 439 states.
[2025-03-08 09:40:48,345 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 381.
[2025-03-08 09:40:48,345 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 381 states, 380 states have (on average 1.4710526315789474) internal successors, (559), 380 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:48,349 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 559 transitions.
[2025-03-08 09:40:48,349 INFO  L78                 Accepts]: Start accepts. Automaton has 381 states and 559 transitions. Word has length 92
[2025-03-08 09:40:48,350 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:40:48,350 INFO  L471      AbstractCegarLoop]: Abstraction has 381 states and 559 transitions.
[2025-03-08 09:40:48,350 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:48,350 INFO  L276                IsEmpty]: Start isEmpty. Operand 381 states and 559 transitions.
[2025-03-08 09:40:48,350 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2025-03-08 09:40:48,351 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:40:48,351 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:40:48,351 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 09:40:48,351 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:40:48,351 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:40:48,351 INFO  L85        PathProgramCache]: Analyzing trace with hash -1834752756, now seen corresponding path program 1 times
[2025-03-08 09:40:48,351 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:40:48,351 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830700994]
[2025-03-08 09:40:48,352 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:40:48,352 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:40:48,370 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes.
[2025-03-08 09:40:48,383 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements.
[2025-03-08 09:40:48,383 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:40:48,383 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:40:48,522 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:40:48,522 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:40:48,522 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830700994]
[2025-03-08 09:40:48,522 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830700994] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:40:48,522 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:40:48,523 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 09:40:48,523 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677122113]
[2025-03-08 09:40:48,523 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:40:48,523 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 09:40:48,523 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:40:48,523 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 09:40:48,524 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:40:48,524 INFO  L87              Difference]: Start difference. First operand 381 states and 559 transitions. Second operand  has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:48,840 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:40:48,841 INFO  L93              Difference]: Finished difference Result 824 states and 1207 transitions.
[2025-03-08 09:40:48,841 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 09:40:48,841 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 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 93
[2025-03-08 09:40:48,841 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:40:48,843 INFO  L225             Difference]: With dead ends: 824
[2025-03-08 09:40:48,843 INFO  L226             Difference]: Without dead ends: 576
[2025-03-08 09:40:48,844 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2025-03-08 09:40:48,844 INFO  L435           NwaCegarLoop]: 411 mSDtfsCounter, 1076 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 2054 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 09:40:48,845 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 2054 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 09:40:48,845 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 576 states.
[2025-03-08 09:40:48,851 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 382.
[2025-03-08 09:40:48,852 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 382 states, 381 states have (on average 1.4671916010498687) internal successors, (559), 381 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:48,853 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 559 transitions.
[2025-03-08 09:40:48,853 INFO  L78                 Accepts]: Start accepts. Automaton has 382 states and 559 transitions. Word has length 93
[2025-03-08 09:40:48,853 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:40:48,853 INFO  L471      AbstractCegarLoop]: Abstraction has 382 states and 559 transitions.
[2025-03-08 09:40:48,853 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:48,854 INFO  L276                IsEmpty]: Start isEmpty. Operand 382 states and 559 transitions.
[2025-03-08 09:40:48,854 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 95
[2025-03-08 09:40:48,854 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:40:48,854 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:40:48,854 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 09:40:48,854 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:40:48,855 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:40:48,855 INFO  L85        PathProgramCache]: Analyzing trace with hash -1189456436, now seen corresponding path program 1 times
[2025-03-08 09:40:48,855 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:40:48,855 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412220456]
[2025-03-08 09:40:48,855 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:40:48,855 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:40:48,872 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes.
[2025-03-08 09:40:48,880 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements.
[2025-03-08 09:40:48,881 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:40:48,881 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:40:48,983 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:40:48,984 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:40:48,984 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412220456]
[2025-03-08 09:40:48,984 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412220456] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:40:48,984 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:40:48,984 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:40:48,984 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428873221]
[2025-03-08 09:40:48,984 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:40:48,985 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:40:48,985 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:40:48,985 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:40:48,985 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:40:48,985 INFO  L87              Difference]: Start difference. First operand 382 states and 559 transitions. Second operand  has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:49,217 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:40:49,217 INFO  L93              Difference]: Finished difference Result 795 states and 1166 transitions.
[2025-03-08 09:40:49,218 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:40:49,218 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94
[2025-03-08 09:40:49,218 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:40:49,220 INFO  L225             Difference]: With dead ends: 795
[2025-03-08 09:40:49,220 INFO  L226             Difference]: Without dead ends: 547
[2025-03-08 09:40:49,220 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:40:49,220 INFO  L435           NwaCegarLoop]: 415 mSDtfsCounter, 1025 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 09:40:49,221 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 1243 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 09:40:49,221 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 547 states.
[2025-03-08 09:40:49,226 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 366.
[2025-03-08 09:40:49,227 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 366 states, 365 states have (on average 1.4684931506849315) internal successors, (536), 365 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:49,228 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 536 transitions.
[2025-03-08 09:40:49,228 INFO  L78                 Accepts]: Start accepts. Automaton has 366 states and 536 transitions. Word has length 94
[2025-03-08 09:40:49,228 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:40:49,228 INFO  L471      AbstractCegarLoop]: Abstraction has 366 states and 536 transitions.
[2025-03-08 09:40:49,228 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:49,229 INFO  L276                IsEmpty]: Start isEmpty. Operand 366 states and 536 transitions.
[2025-03-08 09:40:49,230 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 198
[2025-03-08 09:40:49,230 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:40:49,230 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:40:49,230 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-08 09:40:49,230 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:40:49,230 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:40:49,230 INFO  L85        PathProgramCache]: Analyzing trace with hash 1011876068, now seen corresponding path program 1 times
[2025-03-08 09:40:49,231 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:40:49,231 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413214595]
[2025-03-08 09:40:49,231 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:40:49,231 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:40:49,288 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes.
[2025-03-08 09:40:49,374 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements.
[2025-03-08 09:40:49,374 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:40:49,375 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:40:49,750 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:40:49,750 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:40:49,751 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413214595]
[2025-03-08 09:40:49,751 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413214595] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 09:40:49,751 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716623261]
[2025-03-08 09:40:49,751 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:40:49,751 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 09:40:49,751 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 09:40:49,753 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 09:40:49,755 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-08 09:40:50,023 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes.
[2025-03-08 09:40:50,170 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements.
[2025-03-08 09:40:50,170 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:40:50,170 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:40:50,177 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1425 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-03-08 09:40:50,185 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 09:40:50,534 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:40:50,537 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 09:40:50,537 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [716623261] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:40:50,537 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 09:40:50,537 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7
[2025-03-08 09:40:50,537 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359886204]
[2025-03-08 09:40:50,537 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:40:50,538 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 09:40:50,538 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:40:50,538 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 09:40:50,538 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:40:50,539 INFO  L87              Difference]: Start difference. First operand 366 states and 536 transitions. Second operand  has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:50,875 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:40:50,875 INFO  L93              Difference]: Finished difference Result 586 states and 862 transitions.
[2025-03-08 09:40:50,876 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 09:40:50,876 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 0 states have call successors, (0), 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 197
[2025-03-08 09:40:50,876 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:40:50,877 INFO  L225             Difference]: With dead ends: 586
[2025-03-08 09:40:50,877 INFO  L226             Difference]: Without dead ends: 365
[2025-03-08 09:40:50,878 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2025-03-08 09:40:50,879 INFO  L435           NwaCegarLoop]: 258 mSDtfsCounter, 388 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 09:40:50,879 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 515 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 09:40:50,880 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 365 states.
[2025-03-08 09:40:50,884 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365.
[2025-03-08 09:40:50,884 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 365 states, 364 states have (on average 1.4642857142857142) internal successors, (533), 364 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:50,888 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 533 transitions.
[2025-03-08 09:40:50,889 INFO  L78                 Accepts]: Start accepts. Automaton has 365 states and 533 transitions. Word has length 197
[2025-03-08 09:40:50,889 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:40:50,889 INFO  L471      AbstractCegarLoop]: Abstraction has 365 states and 533 transitions.
[2025-03-08 09:40:50,889 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:50,889 INFO  L276                IsEmpty]: Start isEmpty. Operand 365 states and 533 transitions.
[2025-03-08 09:40:50,890 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 199
[2025-03-08 09:40:50,890 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:40:50,890 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:40:50,900 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-03-08 09:40:51,095 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2025-03-08 09:40:51,095 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:40:51,095 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:40:51,096 INFO  L85        PathProgramCache]: Analyzing trace with hash 2087344945, now seen corresponding path program 1 times
[2025-03-08 09:40:51,096 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:40:51,096 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426925982]
[2025-03-08 09:40:51,096 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:40:51,096 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:40:51,149 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes.
[2025-03-08 09:40:51,600 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements.
[2025-03-08 09:40:51,600 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:40:51,600 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:40:51,925 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:40:51,925 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:40:51,925 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426925982]
[2025-03-08 09:40:51,925 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426925982] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:40:51,925 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:40:51,925 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 09:40:51,925 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741204351]
[2025-03-08 09:40:51,926 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:40:51,926 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 09:40:51,926 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:40:51,926 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 09:40:51,927 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:40:51,927 INFO  L87              Difference]: Start difference. First operand 365 states and 533 transitions. Second operand  has 6 states, 6 states have (on average 33.0) internal successors, (198), 6 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:52,315 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:40:52,316 INFO  L93              Difference]: Finished difference Result 705 states and 1032 transitions.
[2025-03-08 09:40:52,316 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 09:40:52,316 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 33.0) internal successors, (198), 6 states have internal predecessors, (198), 0 states have call successors, (0), 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 198
[2025-03-08 09:40:52,316 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:40:52,318 INFO  L225             Difference]: With dead ends: 705
[2025-03-08 09:40:52,318 INFO  L226             Difference]: Without dead ends: 477
[2025-03-08 09:40:52,319 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2025-03-08 09:40:52,319 INFO  L435           NwaCegarLoop]: 409 mSDtfsCounter, 787 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 1480 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 09:40:52,319 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 1480 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 09:40:52,320 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 477 states.
[2025-03-08 09:40:52,325 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 431.
[2025-03-08 09:40:52,326 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 431 states, 430 states have (on average 1.4627906976744185) internal successors, (629), 430 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:52,327 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 629 transitions.
[2025-03-08 09:40:52,327 INFO  L78                 Accepts]: Start accepts. Automaton has 431 states and 629 transitions. Word has length 198
[2025-03-08 09:40:52,327 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:40:52,327 INFO  L471      AbstractCegarLoop]: Abstraction has 431 states and 629 transitions.
[2025-03-08 09:40:52,328 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 33.0) internal successors, (198), 6 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:52,328 INFO  L276                IsEmpty]: Start isEmpty. Operand 431 states and 629 transitions.
[2025-03-08 09:40:52,329 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 200
[2025-03-08 09:40:52,329 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:40:52,329 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:40:52,332 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-08 09:40:52,332 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:40:52,333 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:40:52,333 INFO  L85        PathProgramCache]: Analyzing trace with hash 98744755, now seen corresponding path program 1 times
[2025-03-08 09:40:52,333 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:40:52,333 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221008512]
[2025-03-08 09:40:52,333 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:40:52,333 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:40:52,387 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes.
[2025-03-08 09:40:52,578 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements.
[2025-03-08 09:40:52,578 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:40:52,578 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:40:53,095 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:40:53,095 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:40:53,095 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221008512]
[2025-03-08 09:40:53,095 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221008512] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:40:53,095 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:40:53,096 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:40:53,096 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593046801]
[2025-03-08 09:40:53,096 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:40:53,096 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:40:53,096 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:40:53,096 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:40:53,096 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:40:53,097 INFO  L87              Difference]: Start difference. First operand 431 states and 629 transitions. Second operand  has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:53,567 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:40:53,567 INFO  L93              Difference]: Finished difference Result 697 states and 1020 transitions.
[2025-03-08 09:40:53,568 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:40:53,568 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 0 states have call successors, (0), 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 199
[2025-03-08 09:40:53,568 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:40:53,570 INFO  L225             Difference]: With dead ends: 697
[2025-03-08 09:40:53,570 INFO  L226             Difference]: Without dead ends: 477
[2025-03-08 09:40:53,570 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:40:53,571 INFO  L435           NwaCegarLoop]: 252 mSDtfsCounter, 760 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 09:40:53,571 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 753 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 09:40:53,571 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 477 states.
[2025-03-08 09:40:53,577 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 432.
[2025-03-08 09:40:53,578 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 432 states, 431 states have (on average 1.4617169373549883) internal successors, (630), 431 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:53,579 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 630 transitions.
[2025-03-08 09:40:53,579 INFO  L78                 Accepts]: Start accepts. Automaton has 432 states and 630 transitions. Word has length 199
[2025-03-08 09:40:53,580 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:40:53,580 INFO  L471      AbstractCegarLoop]: Abstraction has 432 states and 630 transitions.
[2025-03-08 09:40:53,580 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:53,580 INFO  L276                IsEmpty]: Start isEmpty. Operand 432 states and 630 transitions.
[2025-03-08 09:40:53,581 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 201
[2025-03-08 09:40:53,581 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:40:53,582 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:40:53,582 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-08 09:40:53,582 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:40:53,583 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:40:53,583 INFO  L85        PathProgramCache]: Analyzing trace with hash -519592602, now seen corresponding path program 1 times
[2025-03-08 09:40:53,583 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:40:53,583 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796820435]
[2025-03-08 09:40:53,583 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:40:53,583 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:40:53,632 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes.
[2025-03-08 09:40:53,855 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements.
[2025-03-08 09:40:53,855 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:40:53,855 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:40:54,206 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:40:54,206 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:40:54,206 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796820435]
[2025-03-08 09:40:54,206 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796820435] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:40:54,206 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:40:54,207 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 09:40:54,207 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858875788]
[2025-03-08 09:40:54,207 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:40:54,207 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 09:40:54,207 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:40:54,207 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 09:40:54,208 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:40:54,208 INFO  L87              Difference]: Start difference. First operand 432 states and 630 transitions. Second operand  has 6 states, 6 states have (on average 33.333333333333336) internal successors, (200), 6 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:54,725 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:40:54,725 INFO  L93              Difference]: Finished difference Result 835 states and 1216 transitions.
[2025-03-08 09:40:54,725 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 09:40:54,726 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 33.333333333333336) internal successors, (200), 6 states have internal predecessors, (200), 0 states have call successors, (0), 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 200
[2025-03-08 09:40:54,726 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:40:54,729 INFO  L225             Difference]: With dead ends: 835
[2025-03-08 09:40:54,729 INFO  L226             Difference]: Without dead ends: 615
[2025-03-08 09:40:54,730 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2025-03-08 09:40:54,731 INFO  L435           NwaCegarLoop]: 452 mSDtfsCounter, 982 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 09:40:54,731 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 1423 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 09:40:54,732 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 615 states.
[2025-03-08 09:40:54,738 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 542.
[2025-03-08 09:40:54,739 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 542 states, 541 states have (on average 1.4639556377079483) internal successors, (792), 541 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:54,741 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 792 transitions.
[2025-03-08 09:40:54,741 INFO  L78                 Accepts]: Start accepts. Automaton has 542 states and 792 transitions. Word has length 200
[2025-03-08 09:40:54,741 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:40:54,741 INFO  L471      AbstractCegarLoop]: Abstraction has 542 states and 792 transitions.
[2025-03-08 09:40:54,741 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 33.333333333333336) internal successors, (200), 6 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:54,741 INFO  L276                IsEmpty]: Start isEmpty. Operand 542 states and 792 transitions.
[2025-03-08 09:40:54,742 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 202
[2025-03-08 09:40:54,742 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:40:54,744 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:40:54,744 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-08 09:40:54,744 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:40:54,744 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:40:54,744 INFO  L85        PathProgramCache]: Analyzing trace with hash -1355413524, now seen corresponding path program 1 times
[2025-03-08 09:40:54,745 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:40:54,745 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839966274]
[2025-03-08 09:40:54,746 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:40:54,746 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:40:54,804 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes.
[2025-03-08 09:40:55,093 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements.
[2025-03-08 09:40:55,094 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:40:55,094 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:40:55,519 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:40:55,519 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:40:55,520 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839966274]
[2025-03-08 09:40:55,520 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839966274] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:40:55,520 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:40:55,520 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:40:55,520 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156363090]
[2025-03-08 09:40:55,520 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:40:55,521 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:40:55,521 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:40:55,522 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:40:55,522 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:40:55,522 INFO  L87              Difference]: Start difference. First operand 542 states and 792 transitions. Second operand  has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:56,002 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:40:56,002 INFO  L93              Difference]: Finished difference Result 764 states and 1119 transitions.
[2025-03-08 09:40:56,002 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:40:56,002 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 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 201
[2025-03-08 09:40:56,003 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:40:56,004 INFO  L225             Difference]: With dead ends: 764
[2025-03-08 09:40:56,004 INFO  L226             Difference]: Without dead ends: 544
[2025-03-08 09:40:56,005 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:40:56,006 INFO  L435           NwaCegarLoop]: 249 mSDtfsCounter, 896 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 09:40:56,006 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 746 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 09:40:56,006 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 544 states.
[2025-03-08 09:40:56,012 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 543.
[2025-03-08 09:40:56,013 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 543 states, 542 states have (on average 1.46309963099631) internal successors, (793), 542 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:56,014 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 793 transitions.
[2025-03-08 09:40:56,014 INFO  L78                 Accepts]: Start accepts. Automaton has 543 states and 793 transitions. Word has length 201
[2025-03-08 09:40:56,015 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:40:56,015 INFO  L471      AbstractCegarLoop]: Abstraction has 543 states and 793 transitions.
[2025-03-08 09:40:56,015 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:56,015 INFO  L276                IsEmpty]: Start isEmpty. Operand 543 states and 793 transitions.
[2025-03-08 09:40:56,016 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 203
[2025-03-08 09:40:56,016 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:40:56,017 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:40:56,017 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-08 09:40:56,017 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:40:56,017 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:40:56,017 INFO  L85        PathProgramCache]: Analyzing trace with hash -625584777, now seen corresponding path program 1 times
[2025-03-08 09:40:56,017 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:40:56,017 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326629013]
[2025-03-08 09:40:56,017 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:40:56,018 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:40:56,070 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes.
[2025-03-08 09:40:56,452 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements.
[2025-03-08 09:40:56,453 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:40:56,453 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:40:58,040 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:40:58,040 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:40:58,040 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326629013]
[2025-03-08 09:40:58,040 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326629013] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:40:58,040 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:40:58,040 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-08 09:40:58,040 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197636601]
[2025-03-08 09:40:58,040 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:40:58,040 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 09:40:58,040 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:40:58,041 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 09:40:58,041 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2025-03-08 09:40:58,041 INFO  L87              Difference]: Start difference. First operand 543 states and 793 transitions. Second operand  has 10 states, 10 states have (on average 20.2) internal successors, (202), 10 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-03-08 09:40:58,513 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:40:58,514 INFO  L93              Difference]: Finished difference Result 963 states and 1402 transitions.
[2025-03-08 09:40:58,514 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-08 09:40:58,514 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 20.2) internal successors, (202), 10 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) Word has length 202
[2025-03-08 09:40:58,514 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:40:58,516 INFO  L225             Difference]: With dead ends: 963
[2025-03-08 09:40:58,516 INFO  L226             Difference]: Without dead ends: 659
[2025-03-08 09:40:58,517 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272
[2025-03-08 09:40:58,517 INFO  L435           NwaCegarLoop]: 400 mSDtfsCounter, 1010 mSDsluCounter, 2214 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 2614 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 09:40:58,517 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 2614 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 09:40:58,519 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 659 states.
[2025-03-08 09:40:58,526 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 652.
[2025-03-08 09:40:58,526 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 652 states, 651 states have (on average 1.4470046082949308) internal successors, (942), 651 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:58,528 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 942 transitions.
[2025-03-08 09:40:58,528 INFO  L78                 Accepts]: Start accepts. Automaton has 652 states and 942 transitions. Word has length 202
[2025-03-08 09:40:58,528 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:40:58,528 INFO  L471      AbstractCegarLoop]: Abstraction has 652 states and 942 transitions.
[2025-03-08 09:40:58,529 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 20.2) internal successors, (202), 10 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-03-08 09:40:58,529 INFO  L276                IsEmpty]: Start isEmpty. Operand 652 states and 942 transitions.
[2025-03-08 09:40:58,530 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 204
[2025-03-08 09:40:58,530 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:40:58,531 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:40:58,531 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-08 09:40:58,531 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:40:58,531 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:40:58,532 INFO  L85        PathProgramCache]: Analyzing trace with hash 994453839, now seen corresponding path program 1 times
[2025-03-08 09:40:58,532 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:40:58,532 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276164174]
[2025-03-08 09:40:58,532 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:40:58,532 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:40:58,578 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes.
[2025-03-08 09:40:58,866 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements.
[2025-03-08 09:40:58,866 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:40:58,866 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:00,604 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:00,604 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:00,604 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276164174]
[2025-03-08 09:41:00,604 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276164174] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:00,604 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:00,604 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-08 09:41:00,604 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453516121]
[2025-03-08 09:41:00,604 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:00,604 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-08 09:41:00,604 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:00,605 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-08 09:41:00,605 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2025-03-08 09:41:00,605 INFO  L87              Difference]: Start difference. First operand 652 states and 942 transitions. Second operand  has 9 states, 9 states have (on average 22.555555555555557) internal successors, (203), 9 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:01,127 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:01,127 INFO  L93              Difference]: Finished difference Result 1036 states and 1505 transitions.
[2025-03-08 09:41:01,127 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-08 09:41:01,128 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 22.555555555555557) internal successors, (203), 9 states have internal predecessors, (203), 0 states have call successors, (0), 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 203
[2025-03-08 09:41:01,128 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:01,130 INFO  L225             Difference]: With dead ends: 1036
[2025-03-08 09:41:01,130 INFO  L226             Difference]: Without dead ends: 737
[2025-03-08 09:41:01,131 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210
[2025-03-08 09:41:01,132 INFO  L435           NwaCegarLoop]: 396 mSDtfsCounter, 1311 mSDsluCounter, 2089 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1311 SdHoareTripleChecker+Valid, 2485 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:01,132 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1311 Valid, 2485 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 09:41:01,133 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 737 states.
[2025-03-08 09:41:01,141 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 726.
[2025-03-08 09:41:01,142 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 726 states, 725 states have (on average 1.446896551724138) internal successors, (1049), 725 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:01,144 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1049 transitions.
[2025-03-08 09:41:01,145 INFO  L78                 Accepts]: Start accepts. Automaton has 726 states and 1049 transitions. Word has length 203
[2025-03-08 09:41:01,145 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:01,145 INFO  L471      AbstractCegarLoop]: Abstraction has 726 states and 1049 transitions.
[2025-03-08 09:41:01,145 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 22.555555555555557) internal successors, (203), 9 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:01,145 INFO  L276                IsEmpty]: Start isEmpty. Operand 726 states and 1049 transitions.
[2025-03-08 09:41:01,147 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 204
[2025-03-08 09:41:01,147 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:01,147 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:41:01,147 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-08 09:41:01,147 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:01,148 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:01,148 INFO  L85        PathProgramCache]: Analyzing trace with hash -499587431, now seen corresponding path program 1 times
[2025-03-08 09:41:01,148 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:01,148 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015731090]
[2025-03-08 09:41:01,148 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:01,148 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:01,191 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes.
[2025-03-08 09:41:01,503 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements.
[2025-03-08 09:41:01,503 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:01,503 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:02,496 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:02,497 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:02,497 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015731090]
[2025-03-08 09:41:02,497 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015731090] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:02,497 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:02,497 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:41:02,497 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855485606]
[2025-03-08 09:41:02,497 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:02,498 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:41:02,498 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:02,499 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:41:02,499 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:41:02,499 INFO  L87              Difference]: Start difference. First operand 726 states and 1049 transitions. Second operand  has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:02,676 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:02,677 INFO  L93              Difference]: Finished difference Result 1049 states and 1524 transitions.
[2025-03-08 09:41:02,677 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:41:02,677 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 0 states have call successors, (0), 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 203
[2025-03-08 09:41:02,677 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:02,679 INFO  L225             Difference]: With dead ends: 1049
[2025-03-08 09:41:02,679 INFO  L226             Difference]: Without dead ends: 734
[2025-03-08 09:41:02,679 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:41:02,680 INFO  L435           NwaCegarLoop]: 420 mSDtfsCounter, 382 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:02,680 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1255 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 09:41:02,682 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 734 states.
[2025-03-08 09:41:02,691 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 732.
[2025-03-08 09:41:02,692 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 732 states, 731 states have (on average 1.4432284541723666) internal successors, (1055), 731 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:02,694 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1055 transitions.
[2025-03-08 09:41:02,694 INFO  L78                 Accepts]: Start accepts. Automaton has 732 states and 1055 transitions. Word has length 203
[2025-03-08 09:41:02,694 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:02,694 INFO  L471      AbstractCegarLoop]: Abstraction has 732 states and 1055 transitions.
[2025-03-08 09:41:02,694 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:02,694 INFO  L276                IsEmpty]: Start isEmpty. Operand 732 states and 1055 transitions.
[2025-03-08 09:41:02,696 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 205
[2025-03-08 09:41:02,696 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:02,696 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:41:02,696 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-08 09:41:02,696 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:02,697 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:02,697 INFO  L85        PathProgramCache]: Analyzing trace with hash -1817997887, now seen corresponding path program 1 times
[2025-03-08 09:41:02,697 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:02,698 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270891763]
[2025-03-08 09:41:02,698 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:02,698 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:02,748 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes.
[2025-03-08 09:41:03,110 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements.
[2025-03-08 09:41:03,110 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:03,110 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:03,952 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:03,952 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:03,952 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270891763]
[2025-03-08 09:41:03,953 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270891763] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:03,953 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:03,953 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:41:03,953 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419647118]
[2025-03-08 09:41:03,953 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:03,953 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:41:03,953 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:03,954 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:41:03,954 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:41:03,954 INFO  L87              Difference]: Start difference. First operand 732 states and 1055 transitions. Second operand  has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:04,120 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:04,120 INFO  L93              Difference]: Finished difference Result 1053 states and 1527 transitions.
[2025-03-08 09:41:04,120 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:41:04,121 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 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 204
[2025-03-08 09:41:04,121 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:04,123 INFO  L225             Difference]: With dead ends: 1053
[2025-03-08 09:41:04,123 INFO  L226             Difference]: Without dead ends: 738
[2025-03-08 09:41:04,123 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:41:04,123 INFO  L435           NwaCegarLoop]: 420 mSDtfsCounter, 383 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:04,123 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1256 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 09:41:04,124 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 738 states.
[2025-03-08 09:41:04,131 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 735.
[2025-03-08 09:41:04,132 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 735 states, 734 states have (on average 1.44141689373297) internal successors, (1058), 734 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:04,133 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1058 transitions.
[2025-03-08 09:41:04,133 INFO  L78                 Accepts]: Start accepts. Automaton has 735 states and 1058 transitions. Word has length 204
[2025-03-08 09:41:04,133 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:04,133 INFO  L471      AbstractCegarLoop]: Abstraction has 735 states and 1058 transitions.
[2025-03-08 09:41:04,133 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:04,133 INFO  L276                IsEmpty]: Start isEmpty. Operand 735 states and 1058 transitions.
[2025-03-08 09:41:04,135 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 205
[2025-03-08 09:41:04,135 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:04,135 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:41:04,135 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-08 09:41:04,135 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:04,135 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:04,135 INFO  L85        PathProgramCache]: Analyzing trace with hash 263030758, now seen corresponding path program 1 times
[2025-03-08 09:41:04,136 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:04,136 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567550483]
[2025-03-08 09:41:04,136 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:04,136 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:04,178 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes.
[2025-03-08 09:41:04,500 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements.
[2025-03-08 09:41:04,500 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:04,500 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:05,603 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:05,603 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:05,603 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567550483]
[2025-03-08 09:41:05,603 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567550483] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 09:41:05,603 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849426270]
[2025-03-08 09:41:05,603 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:05,603 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 09:41:05,603 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 09:41:05,632 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 09:41:05,633 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-08 09:41:06,020 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes.
[2025-03-08 09:41:06,303 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements.
[2025-03-08 09:41:06,303 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:06,304 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:06,311 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1442 conjuncts, 30 conjuncts are in the unsatisfiable core
[2025-03-08 09:41:06,318 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 09:41:06,740 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:06,740 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 09:41:06,740 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [849426270] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:06,740 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 09:41:06,740 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16
[2025-03-08 09:41:06,740 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466720469]
[2025-03-08 09:41:06,740 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:06,741 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:41:06,741 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:06,741 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:41:06,741 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240
[2025-03-08 09:41:06,741 INFO  L87              Difference]: Start difference. First operand 735 states and 1058 transitions. Second operand  has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:07,164 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:07,164 INFO  L93              Difference]: Finished difference Result 1185 states and 1714 transitions.
[2025-03-08 09:41:07,165 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:41:07,165 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 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 204
[2025-03-08 09:41:07,165 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:07,167 INFO  L225             Difference]: With dead ends: 1185
[2025-03-08 09:41:07,167 INFO  L226             Difference]: Without dead ends: 658
[2025-03-08 09:41:07,168 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306
[2025-03-08 09:41:07,168 INFO  L435           NwaCegarLoop]: 250 mSDtfsCounter, 731 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:07,168 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 749 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 09:41:07,169 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 658 states.
[2025-03-08 09:41:07,175 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658.
[2025-03-08 09:41:07,176 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 658 states, 657 states have (on average 1.4368340943683409) internal successors, (944), 657 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:07,177 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 944 transitions.
[2025-03-08 09:41:07,177 INFO  L78                 Accepts]: Start accepts. Automaton has 658 states and 944 transitions. Word has length 204
[2025-03-08 09:41:07,177 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:07,177 INFO  L471      AbstractCegarLoop]: Abstraction has 658 states and 944 transitions.
[2025-03-08 09:41:07,177 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:07,177 INFO  L276                IsEmpty]: Start isEmpty. Operand 658 states and 944 transitions.
[2025-03-08 09:41:07,178 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 207
[2025-03-08 09:41:07,178 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:07,178 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:41:07,190 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-03-08 09:41:07,379 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 09:41:07,379 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:07,379 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:07,380 INFO  L85        PathProgramCache]: Analyzing trace with hash -287222696, now seen corresponding path program 1 times
[2025-03-08 09:41:07,380 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:07,380 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789895840]
[2025-03-08 09:41:07,380 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:07,380 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:07,422 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes.
[2025-03-08 09:41:07,736 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements.
[2025-03-08 09:41:07,736 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:07,736 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:08,907 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:08,907 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:08,907 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789895840]
[2025-03-08 09:41:08,907 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789895840] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 09:41:08,908 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600478042]
[2025-03-08 09:41:08,908 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:08,908 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 09:41:08,908 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 09:41:08,910 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 09:41:08,910 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-08 09:41:09,245 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes.
[2025-03-08 09:41:09,599 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements.
[2025-03-08 09:41:09,600 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:09,600 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:09,606 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1444 conjuncts, 91 conjuncts are in the unsatisfiable core
[2025-03-08 09:41:09,614 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 09:41:10,979 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:10,979 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 09:41:12,106 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:12,107 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600478042] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 09:41:12,107 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-08 09:41:12,107 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20, 14] total 42
[2025-03-08 09:41:12,107 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154907575]
[2025-03-08 09:41:12,107 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-08 09:41:12,107 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 42 states
[2025-03-08 09:41:12,107 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:12,108 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2025-03-08 09:41:12,109 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1559, Unknown=0, NotChecked=0, Total=1722
[2025-03-08 09:41:12,109 INFO  L87              Difference]: Start difference. First operand 658 states and 944 transitions. Second operand  has 42 states, 42 states have (on average 14.380952380952381) internal successors, (604), 42 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:13,754 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:13,754 INFO  L93              Difference]: Finished difference Result 1155 states and 1668 transitions.
[2025-03-08 09:41:13,754 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. 
[2025-03-08 09:41:13,755 INFO  L78                 Accepts]: Start accepts. Automaton has  has 42 states, 42 states have (on average 14.380952380952381) internal successors, (604), 42 states have internal predecessors, (604), 0 states have call successors, (0), 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 206
[2025-03-08 09:41:13,755 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:13,757 INFO  L225             Difference]: With dead ends: 1155
[2025-03-08 09:41:13,758 INFO  L226             Difference]: Without dead ends: 932
[2025-03-08 09:41:13,759 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1574 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=617, Invalid=4933, Unknown=0, NotChecked=0, Total=5550
[2025-03-08 09:41:13,760 INFO  L435           NwaCegarLoop]: 379 mSDtfsCounter, 2034 mSDsluCounter, 6901 mSDsCounter, 0 mSdLazyCounter, 2587 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2034 SdHoareTripleChecker+Valid, 7280 SdHoareTripleChecker+Invalid, 2604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:13,760 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2034 Valid, 7280 Invalid, 2604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2587 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-08 09:41:13,760 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 932 states.
[2025-03-08 09:41:13,774 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 916.
[2025-03-08 09:41:13,775 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 916 states, 915 states have (on average 1.439344262295082) internal successors, (1317), 915 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:13,776 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1317 transitions.
[2025-03-08 09:41:13,776 INFO  L78                 Accepts]: Start accepts. Automaton has 916 states and 1317 transitions. Word has length 206
[2025-03-08 09:41:13,777 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:13,777 INFO  L471      AbstractCegarLoop]: Abstraction has 916 states and 1317 transitions.
[2025-03-08 09:41:13,778 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 42 states, 42 states have (on average 14.380952380952381) internal successors, (604), 42 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:13,778 INFO  L276                IsEmpty]: Start isEmpty. Operand 916 states and 1317 transitions.
[2025-03-08 09:41:13,779 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 209
[2025-03-08 09:41:13,779 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:13,779 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:41:13,790 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-03-08 09:41:13,979 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 09:41:13,980 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:13,980 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:13,981 INFO  L85        PathProgramCache]: Analyzing trace with hash 247260355, now seen corresponding path program 1 times
[2025-03-08 09:41:13,981 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:13,981 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144219999]
[2025-03-08 09:41:13,981 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:13,981 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:14,022 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes.
[2025-03-08 09:41:14,288 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements.
[2025-03-08 09:41:14,288 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:14,288 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:15,155 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:15,155 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:15,155 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144219999]
[2025-03-08 09:41:15,155 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144219999] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 09:41:15,155 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483182120]
[2025-03-08 09:41:15,155 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:15,155 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 09:41:15,155 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 09:41:15,157 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 09:41:15,158 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-03-08 09:41:15,513 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes.
[2025-03-08 09:41:15,839 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements.
[2025-03-08 09:41:15,839 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:15,839 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:15,846 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1448 conjuncts, 101 conjuncts are in the unsatisfiable core
[2025-03-08 09:41:15,854 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 09:41:17,031 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:17,031 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 09:41:19,684 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:19,684 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483182120] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 09:41:19,684 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-08 09:41:19,684 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 22, 20] total 51
[2025-03-08 09:41:19,684 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042233372]
[2025-03-08 09:41:19,684 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-08 09:41:19,685 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 51 states
[2025-03-08 09:41:19,685 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:19,686 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants.
[2025-03-08 09:41:19,686 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=2281, Unknown=0, NotChecked=0, Total=2550
[2025-03-08 09:41:19,686 INFO  L87              Difference]: Start difference. First operand 916 states and 1317 transitions. Second operand  has 51 states, 51 states have (on average 11.96078431372549) internal successors, (610), 51 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:26,447 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:26,447 INFO  L93              Difference]: Finished difference Result 2134 states and 3079 transitions.
[2025-03-08 09:41:26,447 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. 
[2025-03-08 09:41:26,447 INFO  L78                 Accepts]: Start accepts. Automaton has  has 51 states, 51 states have (on average 11.96078431372549) internal successors, (610), 51 states have internal predecessors, (610), 0 states have call successors, (0), 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 208
[2025-03-08 09:41:26,447 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:26,450 INFO  L225             Difference]: With dead ends: 2134
[2025-03-08 09:41:26,450 INFO  L226             Difference]: Without dead ends: 1466
[2025-03-08 09:41:26,453 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3020 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1396, Invalid=11036, Unknown=0, NotChecked=0, Total=12432
[2025-03-08 09:41:26,454 INFO  L435           NwaCegarLoop]: 225 mSDtfsCounter, 3740 mSDsluCounter, 8271 mSDsCounter, 0 mSdLazyCounter, 10184 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3740 SdHoareTripleChecker+Valid, 8496 SdHoareTripleChecker+Invalid, 10206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 10184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:26,454 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3740 Valid, 8496 Invalid, 10206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 10184 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time]
[2025-03-08 09:41:26,455 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1466 states.
[2025-03-08 09:41:26,465 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1280.
[2025-03-08 09:41:26,466 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1280 states, 1279 states have (on average 1.4323690383111807) internal successors, (1832), 1279 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:26,467 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1832 transitions.
[2025-03-08 09:41:26,467 INFO  L78                 Accepts]: Start accepts. Automaton has 1280 states and 1832 transitions. Word has length 208
[2025-03-08 09:41:26,467 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:26,468 INFO  L471      AbstractCegarLoop]: Abstraction has 1280 states and 1832 transitions.
[2025-03-08 09:41:26,468 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 51 states, 51 states have (on average 11.96078431372549) internal successors, (610), 51 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:26,468 INFO  L276                IsEmpty]: Start isEmpty. Operand 1280 states and 1832 transitions.
[2025-03-08 09:41:26,469 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 210
[2025-03-08 09:41:26,469 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:26,469 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:41:26,480 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-03-08 09:41:26,670 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 09:41:26,670 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:26,670 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:26,671 INFO  L85        PathProgramCache]: Analyzing trace with hash -386566890, now seen corresponding path program 1 times
[2025-03-08 09:41:26,671 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:26,671 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950074660]
[2025-03-08 09:41:26,671 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:26,671 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:26,709 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes.
[2025-03-08 09:41:26,856 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements.
[2025-03-08 09:41:26,857 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:26,857 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:27,281 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:27,281 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:27,281 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950074660]
[2025-03-08 09:41:27,281 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950074660] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:27,281 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:27,281 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-08 09:41:27,282 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626497565]
[2025-03-08 09:41:27,282 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:27,282 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 09:41:27,282 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:27,282 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 09:41:27,282 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2025-03-08 09:41:27,282 INFO  L87              Difference]: Start difference. First operand 1280 states and 1832 transitions. Second operand  has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:27,651 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:27,653 INFO  L93              Difference]: Finished difference Result 2635 states and 3798 transitions.
[2025-03-08 09:41:27,653 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-08 09:41:27,653 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 0 states have call successors, (0), 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 209
[2025-03-08 09:41:27,653 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:27,658 INFO  L225             Difference]: With dead ends: 2635
[2025-03-08 09:41:27,658 INFO  L226             Difference]: Without dead ends: 2195
[2025-03-08 09:41:27,659 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90
[2025-03-08 09:41:27,660 INFO  L435           NwaCegarLoop]: 766 mSDtfsCounter, 815 mSDsluCounter, 2960 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 3726 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:27,660 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 3726 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 09:41:27,661 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2195 states.
[2025-03-08 09:41:27,677 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 1651.
[2025-03-08 09:41:27,679 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1651 states, 1650 states have (on average 1.4303030303030304) internal successors, (2360), 1650 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:27,681 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2360 transitions.
[2025-03-08 09:41:27,681 INFO  L78                 Accepts]: Start accepts. Automaton has 1651 states and 2360 transitions. Word has length 209
[2025-03-08 09:41:27,681 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:27,681 INFO  L471      AbstractCegarLoop]: Abstraction has 1651 states and 2360 transitions.
[2025-03-08 09:41:27,682 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:27,682 INFO  L276                IsEmpty]: Start isEmpty. Operand 1651 states and 2360 transitions.
[2025-03-08 09:41:27,683 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 211
[2025-03-08 09:41:27,684 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:27,684 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:41:27,684 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-03-08 09:41:27,684 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:27,684 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:27,684 INFO  L85        PathProgramCache]: Analyzing trace with hash -1686398678, now seen corresponding path program 1 times
[2025-03-08 09:41:27,684 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:27,685 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501543401]
[2025-03-08 09:41:27,685 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:27,685 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:27,724 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes.
[2025-03-08 09:41:28,045 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements.
[2025-03-08 09:41:28,045 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:28,045 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:29,206 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:29,207 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:29,207 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501543401]
[2025-03-08 09:41:29,207 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501543401] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 09:41:29,207 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118462127]
[2025-03-08 09:41:29,207 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:29,207 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 09:41:29,207 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 09:41:29,209 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 09:41:29,210 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-03-08 09:41:29,603 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes.
[2025-03-08 09:41:29,878 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements.
[2025-03-08 09:41:29,879 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:29,879 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:29,885 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1452 conjuncts, 68 conjuncts are in the unsatisfiable core
[2025-03-08 09:41:29,890 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 09:41:30,838 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:30,839 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 09:41:31,863 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:31,863 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118462127] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 09:41:31,863 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-08 09:41:31,864 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 17] total 40
[2025-03-08 09:41:31,864 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062434313]
[2025-03-08 09:41:31,864 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-08 09:41:31,864 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 40 states
[2025-03-08 09:41:31,864 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:31,865 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2025-03-08 09:41:31,865 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1407, Unknown=0, NotChecked=0, Total=1560
[2025-03-08 09:41:31,865 INFO  L87              Difference]: Start difference. First operand 1651 states and 2360 transitions. Second operand  has 40 states, 40 states have (on average 13.925) internal successors, (557), 40 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:35,584 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:35,584 INFO  L93              Difference]: Finished difference Result 3215 states and 4616 transitions.
[2025-03-08 09:41:35,585 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. 
[2025-03-08 09:41:35,585 INFO  L78                 Accepts]: Start accepts. Automaton has  has 40 states, 40 states have (on average 13.925) internal successors, (557), 40 states have internal predecessors, (557), 0 states have call successors, (0), 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 210
[2025-03-08 09:41:35,585 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:35,590 INFO  L225             Difference]: With dead ends: 3215
[2025-03-08 09:41:35,591 INFO  L226             Difference]: Without dead ends: 2371
[2025-03-08 09:41:35,593 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 393 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1723 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1037, Invalid=6973, Unknown=0, NotChecked=0, Total=8010
[2025-03-08 09:41:35,593 INFO  L435           NwaCegarLoop]: 460 mSDtfsCounter, 2367 mSDsluCounter, 10977 mSDsCounter, 0 mSdLazyCounter, 7305 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2367 SdHoareTripleChecker+Valid, 11437 SdHoareTripleChecker+Invalid, 7323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 7305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:35,593 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2367 Valid, 11437 Invalid, 7323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 7305 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time]
[2025-03-08 09:41:35,595 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2371 states.
[2025-03-08 09:41:35,608 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2371 to 1643.
[2025-03-08 09:41:35,610 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1643 states, 1642 states have (on average 1.4275274056029232) internal successors, (2344), 1642 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:35,612 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 2344 transitions.
[2025-03-08 09:41:35,612 INFO  L78                 Accepts]: Start accepts. Automaton has 1643 states and 2344 transitions. Word has length 210
[2025-03-08 09:41:35,612 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:35,612 INFO  L471      AbstractCegarLoop]: Abstraction has 1643 states and 2344 transitions.
[2025-03-08 09:41:35,612 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 40 states, 40 states have (on average 13.925) internal successors, (557), 40 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:35,612 INFO  L276                IsEmpty]: Start isEmpty. Operand 1643 states and 2344 transitions.
[2025-03-08 09:41:35,614 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 211
[2025-03-08 09:41:35,614 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:35,614 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:41:35,625 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2025-03-08 09:41:35,815 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22
[2025-03-08 09:41:35,815 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:35,815 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:35,815 INFO  L85        PathProgramCache]: Analyzing trace with hash -1382953814, now seen corresponding path program 1 times
[2025-03-08 09:41:35,815 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:35,815 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618471328]
[2025-03-08 09:41:35,815 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:35,816 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:35,863 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes.
[2025-03-08 09:41:36,173 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements.
[2025-03-08 09:41:36,173 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:36,173 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:36,945 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:36,946 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:36,946 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618471328]
[2025-03-08 09:41:36,946 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618471328] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 09:41:36,946 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125346577]
[2025-03-08 09:41:36,946 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:36,946 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 09:41:36,946 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 09:41:36,948 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 09:41:36,949 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-03-08 09:41:37,358 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes.
[2025-03-08 09:41:37,682 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements.
[2025-03-08 09:41:37,682 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:37,682 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:37,689 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1452 conjuncts, 71 conjuncts are in the unsatisfiable core
[2025-03-08 09:41:37,693 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 09:41:38,295 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:38,295 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 09:41:58,343 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:58,344 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125346577] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 09:41:58,344 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-08 09:41:58,344 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 18] total 45
[2025-03-08 09:41:58,344 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584493684]
[2025-03-08 09:41:58,344 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-08 09:41:58,344 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 45 states
[2025-03-08 09:41:58,344 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:58,345 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants.
[2025-03-08 09:41:58,345 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=1694, Unknown=11, NotChecked=0, Total=1980
[2025-03-08 09:41:58,346 INFO  L87              Difference]: Start difference. First operand 1643 states and 2344 transitions. Second operand  has 45 states, 45 states have (on average 11.866666666666667) internal successors, (534), 45 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:42:01,500 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:42:01,500 INFO  L93              Difference]: Finished difference Result 3833 states and 5533 transitions.
[2025-03-08 09:42:01,500 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. 
[2025-03-08 09:42:01,500 INFO  L78                 Accepts]: Start accepts. Automaton has  has 45 states, 45 states have (on average 11.866666666666667) internal successors, (534), 45 states have internal predecessors, (534), 0 states have call successors, (0), 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 210
[2025-03-08 09:42:01,501 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:42:01,507 INFO  L225             Difference]: With dead ends: 3833
[2025-03-08 09:42:01,507 INFO  L226             Difference]: Without dead ends: 3336
[2025-03-08 09:42:01,510 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 387 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3989 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=1611, Invalid=10588, Unknown=11, NotChecked=0, Total=12210
[2025-03-08 09:42:01,511 INFO  L435           NwaCegarLoop]: 421 mSDtfsCounter, 12131 mSDsluCounter, 9919 mSDsCounter, 0 mSdLazyCounter, 3058 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12131 SdHoareTripleChecker+Valid, 10340 SdHoareTripleChecker+Invalid, 3080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 3058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-03-08 09:42:01,511 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [12131 Valid, 10340 Invalid, 3080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 3058 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-03-08 09:42:01,512 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3336 states.
[2025-03-08 09:42:01,532 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3336 to 1948.
[2025-03-08 09:42:01,535 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1948 states, 1947 states have (on average 1.4268104776579353) internal successors, (2778), 1947 states have internal predecessors, (2778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:42:01,537 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1948 states and 2778 transitions.
[2025-03-08 09:42:01,537 INFO  L78                 Accepts]: Start accepts. Automaton has 1948 states and 2778 transitions. Word has length 210
[2025-03-08 09:42:01,537 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:42:01,537 INFO  L471      AbstractCegarLoop]: Abstraction has 1948 states and 2778 transitions.
[2025-03-08 09:42:01,538 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 45 states, 45 states have (on average 11.866666666666667) internal successors, (534), 45 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:42:01,538 INFO  L276                IsEmpty]: Start isEmpty. Operand 1948 states and 2778 transitions.
[2025-03-08 09:42:01,540 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 212
[2025-03-08 09:42:01,540 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:42:01,540 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:42:01,551 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-03-08 09:42:01,741 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 09:42:01,741 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:42:01,741 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:42:01,742 INFO  L85        PathProgramCache]: Analyzing trace with hash -2125219940, now seen corresponding path program 1 times
[2025-03-08 09:42:01,742 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:42:01,742 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592096065]
[2025-03-08 09:42:01,742 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:42:01,742 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:42:01,778 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes.
[2025-03-08 09:42:02,069 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements.
[2025-03-08 09:42:02,070 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:42:02,070 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat