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


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


Checking for ERROR reachability
Using default analysis
Version 798a7b37
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_ball2004_1.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 4c7460e797ab98c965c0146dc16cfd1742d13d580f8dc4b4e90e3d1aa36d777a
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 18:18:34,981 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 18:18:35,038 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf
[2025-03-03 18:18:35,044 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 18:18:35,047 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 18:18:35,068 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 18:18:35,070 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 18:18:35,070 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 18:18:35,070 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 18:18:35,070 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 18:18:35,071 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 18:18:35,071 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 18:18:35,071 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 18:18:35,072 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 18:18:35,072 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 18:18:35,072 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 18:18:35,072 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 18:18:35,072 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 18:18:35,072 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 18:18:35,072 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 18:18:35,072 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 18:18:35,072 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 18:18:35,072 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 18:18:35,073 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 18:18:35,073 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 18:18:35,073 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 18:18:35,073 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 18:18:35,073 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 18:18:35,073 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 18:18:35,073 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 18:18:35,073 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 18:18:35,074 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 18:18:35,074 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 18:18:35,074 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 18:18:35,074 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 18:18:35,074 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 18:18:35,074 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 18:18:35,074 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 18:18:35,074 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 18:18:35,074 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 18:18:35,074 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 -> 4c7460e797ab98c965c0146dc16cfd1742d13d580f8dc4b4e90e3d1aa36d777a
[2025-03-03 18:18:35,282 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 18:18:35,291 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 18:18:35,292 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 18:18:35,294 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 18:18:35,294 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 18:18:35,295 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_ball2004_1.c
[2025-03-03 18:18:36,350 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f9926656/43e4d7ed3c994fa5bc27f21ad664d30f/FLAG6e77d0703
[2025-03-03 18:18:36,610 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 18:18:36,613 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_ball2004_1.c
[2025-03-03 18:18:36,626 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f9926656/43e4d7ed3c994fa5bc27f21ad664d30f/FLAG6e77d0703
[2025-03-03 18:18:36,640 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f9926656/43e4d7ed3c994fa5bc27f21ad664d30f
[2025-03-03 18:18:36,644 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 18:18:36,645 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 18:18:36,646 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 18:18:36,646 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 18:18:36,649 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 18:18:36,651 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:18:36" (1/1) ...
[2025-03-03 18:18:36,653 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e0e19cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:36, skipping insertion in model container
[2025-03-03 18:18:36,653 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:18:36" (1/1) ...
[2025-03-03 18:18:36,673 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 18:18:36,784 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.sw_ball2004_1.c[1253,1266]
[2025-03-03 18:18:36,856 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 18:18:36,862 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 18:18:36,872 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.sw_ball2004_1.c[1253,1266]
[2025-03-03 18:18:36,926 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 18:18:36,935 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 18:18:36,936 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:36 WrapperNode
[2025-03-03 18:18:36,936 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 18:18:36,937 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 18:18:36,937 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 18:18:36,937 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 18:18:36,941 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:36" (1/1) ...
[2025-03-03 18:18:36,951 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:36" (1/1) ...
[2025-03-03 18:18:37,002 INFO  L138                Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 650
[2025-03-03 18:18:37,002 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 18:18:37,003 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 18:18:37,003 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 18:18:37,003 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 18:18:37,010 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:36" (1/1) ...
[2025-03-03 18:18:37,011 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:36" (1/1) ...
[2025-03-03 18:18:37,030 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:36" (1/1) ...
[2025-03-03 18:18:37,065 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-03 18:18:37,065 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:36" (1/1) ...
[2025-03-03 18:18:37,065 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:36" (1/1) ...
[2025-03-03 18:18:37,084 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:36" (1/1) ...
[2025-03-03 18:18:37,094 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:36" (1/1) ...
[2025-03-03 18:18:37,099 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:36" (1/1) ...
[2025-03-03 18:18:37,104 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:36" (1/1) ...
[2025-03-03 18:18:37,112 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 18:18:37,113 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 18:18:37,113 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 18:18:37,113 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 18:18:37,114 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:36" (1/1) ...
[2025-03-03 18:18:37,119 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 18:18:37,129 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:18:37,141 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-03 18:18:37,143 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-03 18:18:37,161 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 18:18:37,161 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 18:18:37,161 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 18:18:37,161 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 18:18:37,264 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 18:18:37,266 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 18:18:38,032 INFO  L?                        ?]: Removed 394 outVars from TransFormulas that were not future-live.
[2025-03-03 18:18:38,032 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 18:18:38,114 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 18:18:38,114 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 18:18:38,114 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:18:38 BoogieIcfgContainer
[2025-03-03 18:18:38,115 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 18:18:38,116 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 18:18:38,116 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 18:18:38,120 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 18:18:38,120 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:18:36" (1/3) ...
[2025-03-03 18:18:38,120 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b032e3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:18:38, skipping insertion in model container
[2025-03-03 18:18:38,120 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:36" (2/3) ...
[2025-03-03 18:18:38,121 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b032e3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:18:38, skipping insertion in model container
[2025-03-03 18:18:38,121 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:18:38" (3/3) ...
[2025-03-03 18:18:38,122 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.sw_ball2004_1.c
[2025-03-03 18:18:38,133 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 18:18:38,134 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.sw_ball2004_1.c that has 1 procedures, 194 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 18:18:38,181 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 18:18:38,188 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;@1c6eb866, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 18:18:38,188 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 18:18:38,191 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 194 states, 192 states have (on average 1.4947916666666667) internal successors, (287), 193 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:38,195 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2025-03-03 18:18:38,195 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:38,195 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]
[2025-03-03 18:18:38,196 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:38,199 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:38,200 INFO  L85        PathProgramCache]: Analyzing trace with hash -1630671599, now seen corresponding path program 1 times
[2025-03-03 18:18:38,205 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:38,205 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901857869]
[2025-03-03 18:18:38,205 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:38,206 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:38,264 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-03-03 18:18:38,301 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-03-03 18:18:38,302 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:38,302 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:38,579 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:18:38,580 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:38,580 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901857869]
[2025-03-03 18:18:38,580 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901857869] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:38,580 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:38,581 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 18:18:38,582 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238917163]
[2025-03-03 18:18:38,582 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:38,584 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 18:18:38,584 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:38,597 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 18:18:38,597 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 18:18:38,600 INFO  L87              Difference]: Start difference. First operand  has 194 states, 192 states have (on average 1.4947916666666667) internal successors, (287), 193 states have internal predecessors, (287), 0 states have call successors, (0), 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 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:38,732 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:38,732 INFO  L93              Difference]: Finished difference Result 349 states and 519 transitions.
[2025-03-03 18:18:38,734 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 18:18:38,735 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 27
[2025-03-03 18:18:38,735 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:38,740 INFO  L225             Difference]: With dead ends: 349
[2025-03-03 18:18:38,740 INFO  L226             Difference]: Without dead ends: 193
[2025-03-03 18:18:38,744 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-03 18:18:38,747 INFO  L435           NwaCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:38,747 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 700 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 18:18:38,757 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 193 states.
[2025-03-03 18:18:38,774 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193.
[2025-03-03 18:18:38,775 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 193 states, 192 states have (on average 1.484375) internal successors, (285), 192 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:38,779 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 285 transitions.
[2025-03-03 18:18:38,780 INFO  L78                 Accepts]: Start accepts. Automaton has 193 states and 285 transitions. Word has length 27
[2025-03-03 18:18:38,781 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:38,781 INFO  L471      AbstractCegarLoop]: Abstraction has 193 states and 285 transitions.
[2025-03-03 18:18:38,781 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:38,781 INFO  L276                IsEmpty]: Start isEmpty. Operand 193 states and 285 transitions.
[2025-03-03 18:18:38,781 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2025-03-03 18:18:38,781 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:38,782 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]
[2025-03-03 18:18:38,782 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 18:18:38,782 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:38,782 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:38,783 INFO  L85        PathProgramCache]: Analyzing trace with hash 993467373, now seen corresponding path program 1 times
[2025-03-03 18:18:38,783 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:38,783 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614061265]
[2025-03-03 18:18:38,783 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:38,783 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:38,793 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes.
[2025-03-03 18:18:38,806 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements.
[2025-03-03 18:18:38,807 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:38,807 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:38,915 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:18:38,916 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:38,916 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614061265]
[2025-03-03 18:18:38,916 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614061265] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:38,916 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:38,916 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 18:18:38,916 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758734085]
[2025-03-03 18:18:38,916 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:38,917 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 18:18:38,917 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:38,918 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 18:18:38,918 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 18:18:38,918 INFO  L87              Difference]: Start difference. First operand 193 states and 285 transitions. Second operand  has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:39,027 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:39,027 INFO  L93              Difference]: Finished difference Result 350 states and 517 transitions.
[2025-03-03 18:18:39,028 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 18:18:39,028 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28
[2025-03-03 18:18:39,028 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:39,029 INFO  L225             Difference]: With dead ends: 350
[2025-03-03 18:18:39,031 INFO  L226             Difference]: Without dead ends: 195
[2025-03-03 18:18:39,031 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-03 18:18:39,032 INFO  L435           NwaCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:39,033 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 697 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 18:18:39,034 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 195 states.
[2025-03-03 18:18:39,042 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195.
[2025-03-03 18:18:39,042 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 195 states, 194 states have (on average 1.4793814432989691) internal successors, (287), 194 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:39,043 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 287 transitions.
[2025-03-03 18:18:39,043 INFO  L78                 Accepts]: Start accepts. Automaton has 195 states and 287 transitions. Word has length 28
[2025-03-03 18:18:39,043 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:39,043 INFO  L471      AbstractCegarLoop]: Abstraction has 195 states and 287 transitions.
[2025-03-03 18:18:39,043 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:39,043 INFO  L276                IsEmpty]: Start isEmpty. Operand 195 states and 287 transitions.
[2025-03-03 18:18:39,045 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-03-03 18:18:39,045 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:39,045 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:18:39,045 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 18:18:39,045 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:39,046 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:39,046 INFO  L85        PathProgramCache]: Analyzing trace with hash -1630740340, now seen corresponding path program 1 times
[2025-03-03 18:18:39,046 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:39,046 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510602392]
[2025-03-03 18:18:39,046 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:39,046 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:39,054 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-03-03 18:18:39,062 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-03-03 18:18:39,063 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:39,063 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:39,170 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:18:39,173 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:39,173 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510602392]
[2025-03-03 18:18:39,173 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510602392] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:39,173 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:39,173 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 18:18:39,173 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449790235]
[2025-03-03 18:18:39,173 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:39,174 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 18:18:39,174 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:39,174 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 18:18:39,174 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 18:18:39,174 INFO  L87              Difference]: Start difference. First operand 195 states and 287 transitions. Second operand  has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:39,342 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:39,343 INFO  L93              Difference]: Finished difference Result 483 states and 712 transitions.
[2025-03-03 18:18:39,343 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 18:18:39,343 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29
[2025-03-03 18:18:39,344 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:39,345 INFO  L225             Difference]: With dead ends: 483
[2025-03-03 18:18:39,345 INFO  L226             Difference]: Without dead ends: 326
[2025-03-03 18:18:39,345 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-03 18:18:39,346 INFO  L435           NwaCegarLoop]: 227 mSDtfsCounter, 649 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:39,346 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 676 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 18:18:39,347 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 326 states.
[2025-03-03 18:18:39,352 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 197.
[2025-03-03 18:18:39,353 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 197 states, 196 states have (on average 1.4744897959183674) internal successors, (289), 196 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:39,353 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 289 transitions.
[2025-03-03 18:18:39,353 INFO  L78                 Accepts]: Start accepts. Automaton has 197 states and 289 transitions. Word has length 29
[2025-03-03 18:18:39,353 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:39,354 INFO  L471      AbstractCegarLoop]: Abstraction has 197 states and 289 transitions.
[2025-03-03 18:18:39,354 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:39,354 INFO  L276                IsEmpty]: Start isEmpty. Operand 197 states and 289 transitions.
[2025-03-03 18:18:39,356 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 107
[2025-03-03 18:18:39,356 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:39,356 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:18:39,357 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 18:18:39,357 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:39,357 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:39,357 INFO  L85        PathProgramCache]: Analyzing trace with hash 740376056, now seen corresponding path program 1 times
[2025-03-03 18:18:39,359 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:39,359 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925330540]
[2025-03-03 18:18:39,359 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:39,359 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:39,394 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes.
[2025-03-03 18:18:39,621 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements.
[2025-03-03 18:18:39,621 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:39,621 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:40,106 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:18:40,106 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:40,106 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925330540]
[2025-03-03 18:18:40,106 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925330540] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:40,106 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:40,106 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 18:18:40,106 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242872822]
[2025-03-03 18:18:40,106 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:40,107 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 18:18:40,107 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:40,107 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 18:18:40,107 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 18:18:40,107 INFO  L87              Difference]: Start difference. First operand 197 states and 289 transitions. Second operand  has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:40,310 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:40,310 INFO  L93              Difference]: Finished difference Result 475 states and 699 transitions.
[2025-03-03 18:18:40,310 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 18:18:40,310 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106
[2025-03-03 18:18:40,311 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:40,312 INFO  L225             Difference]: With dead ends: 475
[2025-03-03 18:18:40,312 INFO  L226             Difference]: Without dead ends: 318
[2025-03-03 18:18:40,313 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-03 18:18:40,313 INFO  L435           NwaCegarLoop]: 224 mSDtfsCounter, 597 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:40,313 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 669 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 18:18:40,314 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 318 states.
[2025-03-03 18:18:40,326 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 244.
[2025-03-03 18:18:40,328 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 244 states, 243 states have (on average 1.4650205761316872) internal successors, (356), 243 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:40,329 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 356 transitions.
[2025-03-03 18:18:40,330 INFO  L78                 Accepts]: Start accepts. Automaton has 244 states and 356 transitions. Word has length 106
[2025-03-03 18:18:40,330 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:40,330 INFO  L471      AbstractCegarLoop]: Abstraction has 244 states and 356 transitions.
[2025-03-03 18:18:40,330 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:40,330 INFO  L276                IsEmpty]: Start isEmpty. Operand 244 states and 356 transitions.
[2025-03-03 18:18:40,334 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 109
[2025-03-03 18:18:40,334 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:40,334 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:18:40,335 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 18:18:40,335 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:40,336 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:40,336 INFO  L85        PathProgramCache]: Analyzing trace with hash 1363364527, now seen corresponding path program 1 times
[2025-03-03 18:18:40,336 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:40,336 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515028098]
[2025-03-03 18:18:40,337 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:40,337 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:40,372 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes.
[2025-03-03 18:18:40,562 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements.
[2025-03-03 18:18:40,562 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:40,562 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:40,984 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:18:40,984 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:40,984 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515028098]
[2025-03-03 18:18:40,984 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515028098] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:40,984 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:40,984 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 18:18:40,984 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810244607]
[2025-03-03 18:18:40,984 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:40,985 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 18:18:40,985 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:40,985 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 18:18:40,985 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 18:18:40,986 INFO  L87              Difference]: Start difference. First operand 244 states and 356 transitions. Second operand  has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:41,156 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:41,156 INFO  L93              Difference]: Finished difference Result 475 states and 697 transitions.
[2025-03-03 18:18:41,156 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 18:18:41,157 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108
[2025-03-03 18:18:41,157 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:41,158 INFO  L225             Difference]: With dead ends: 475
[2025-03-03 18:18:41,158 INFO  L226             Difference]: Without dead ends: 318
[2025-03-03 18:18:41,158 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-03 18:18:41,159 INFO  L435           NwaCegarLoop]: 223 mSDtfsCounter, 575 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:41,159 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 668 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 18:18:41,160 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 318 states.
[2025-03-03 18:18:41,168 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 279.
[2025-03-03 18:18:41,169 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 279 states, 278 states have (on average 1.4640287769784173) internal successors, (407), 278 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:41,170 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 407 transitions.
[2025-03-03 18:18:41,170 INFO  L78                 Accepts]: Start accepts. Automaton has 279 states and 407 transitions. Word has length 108
[2025-03-03 18:18:41,170 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:41,170 INFO  L471      AbstractCegarLoop]: Abstraction has 279 states and 407 transitions.
[2025-03-03 18:18:41,171 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:41,172 INFO  L276                IsEmpty]: Start isEmpty. Operand 279 states and 407 transitions.
[2025-03-03 18:18:41,172 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2025-03-03 18:18:41,173 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:41,173 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:18:41,173 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 18:18:41,173 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:41,173 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:41,173 INFO  L85        PathProgramCache]: Analyzing trace with hash 332365766, now seen corresponding path program 1 times
[2025-03-03 18:18:41,173 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:41,173 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435644824]
[2025-03-03 18:18:41,173 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:41,173 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:41,206 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes.
[2025-03-03 18:18:41,284 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements.
[2025-03-03 18:18:41,285 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:41,285 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:41,671 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:18:41,672 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:41,672 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435644824]
[2025-03-03 18:18:41,672 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435644824] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:41,672 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:41,672 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 18:18:41,672 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732680086]
[2025-03-03 18:18:41,672 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:41,673 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 18:18:41,673 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:41,673 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 18:18:41,673 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 18:18:41,673 INFO  L87              Difference]: Start difference. First operand 279 states and 407 transitions. Second operand  has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:41,831 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:41,832 INFO  L93              Difference]: Finished difference Result 533 states and 780 transitions.
[2025-03-03 18:18:41,832 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 18:18:41,832 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109
[2025-03-03 18:18:41,832 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:41,834 INFO  L225             Difference]: With dead ends: 533
[2025-03-03 18:18:41,834 INFO  L226             Difference]: Without dead ends: 318
[2025-03-03 18:18:41,834 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-03 18:18:41,835 INFO  L435           NwaCegarLoop]: 226 mSDtfsCounter, 603 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:41,835 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 675 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 18:18:41,839 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 318 states.
[2025-03-03 18:18:41,844 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 279.
[2025-03-03 18:18:41,845 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 279 states, 278 states have (on average 1.4568345323741008) internal successors, (405), 278 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:41,846 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 405 transitions.
[2025-03-03 18:18:41,846 INFO  L78                 Accepts]: Start accepts. Automaton has 279 states and 405 transitions. Word has length 109
[2025-03-03 18:18:41,846 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:41,846 INFO  L471      AbstractCegarLoop]: Abstraction has 279 states and 405 transitions.
[2025-03-03 18:18:41,846 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:41,847 INFO  L276                IsEmpty]: Start isEmpty. Operand 279 states and 405 transitions.
[2025-03-03 18:18:41,847 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-03-03 18:18:41,848 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:41,848 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:18:41,848 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 18:18:41,848 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:41,848 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:41,849 INFO  L85        PathProgramCache]: Analyzing trace with hash 245406712, now seen corresponding path program 1 times
[2025-03-03 18:18:41,849 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:41,849 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125257715]
[2025-03-03 18:18:41,849 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:41,849 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:41,883 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-03-03 18:18:42,001 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-03-03 18:18:42,002 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:42,002 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:42,385 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:18:42,386 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:42,386 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125257715]
[2025-03-03 18:18:42,386 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125257715] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:42,386 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:42,386 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 18:18:42,386 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284348557]
[2025-03-03 18:18:42,386 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:42,388 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 18:18:42,388 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:42,389 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 18:18:42,389 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 18:18:42,389 INFO  L87              Difference]: Start difference. First operand 279 states and 405 transitions. Second operand  has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:42,567 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:42,567 INFO  L93              Difference]: Finished difference Result 475 states and 694 transitions.
[2025-03-03 18:18:42,567 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 18:18:42,568 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 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 111
[2025-03-03 18:18:42,568 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:42,569 INFO  L225             Difference]: With dead ends: 475
[2025-03-03 18:18:42,570 INFO  L226             Difference]: Without dead ends: 318
[2025-03-03 18:18:42,570 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-03 18:18:42,571 INFO  L435           NwaCegarLoop]: 223 mSDtfsCounter, 556 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:42,571 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 668 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 18:18:42,574 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 318 states.
[2025-03-03 18:18:42,580 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 299.
[2025-03-03 18:18:42,581 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 299 states, 298 states have (on average 1.4563758389261745) internal successors, (434), 298 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:42,582 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 434 transitions.
[2025-03-03 18:18:42,582 INFO  L78                 Accepts]: Start accepts. Automaton has 299 states and 434 transitions. Word has length 111
[2025-03-03 18:18:42,582 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:42,582 INFO  L471      AbstractCegarLoop]: Abstraction has 299 states and 434 transitions.
[2025-03-03 18:18:42,582 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:42,582 INFO  L276                IsEmpty]: Start isEmpty. Operand 299 states and 434 transitions.
[2025-03-03 18:18:42,582 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 113
[2025-03-03 18:18:42,583 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:42,583 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:18:42,583 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 18:18:42,583 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:42,583 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:42,583 INFO  L85        PathProgramCache]: Analyzing trace with hash 342097398, now seen corresponding path program 1 times
[2025-03-03 18:18:42,583 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:42,583 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597725077]
[2025-03-03 18:18:42,583 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:42,583 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:42,609 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes.
[2025-03-03 18:18:42,704 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements.
[2025-03-03 18:18:42,704 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:42,704 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:43,116 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:18:43,116 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:43,116 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597725077]
[2025-03-03 18:18:43,116 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597725077] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:43,116 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:43,116 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-03 18:18:43,116 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113801229]
[2025-03-03 18:18:43,116 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:43,117 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 18:18:43,117 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:43,117 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 18:18:43,117 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-03-03 18:18:43,117 INFO  L87              Difference]: Start difference. First operand 299 states and 434 transitions. Second operand  has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:43,329 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:43,329 INFO  L93              Difference]: Finished difference Result 483 states and 705 transitions.
[2025-03-03 18:18:43,330 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-03 18:18:43,330 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 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 112
[2025-03-03 18:18:43,330 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:43,332 INFO  L225             Difference]: With dead ends: 483
[2025-03-03 18:18:43,332 INFO  L226             Difference]: Without dead ends: 326
[2025-03-03 18:18:43,333 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2025-03-03 18:18:43,333 INFO  L435           NwaCegarLoop]: 222 mSDtfsCounter, 576 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:43,333 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 939 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 18:18:43,334 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 326 states.
[2025-03-03 18:18:43,338 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 302.
[2025-03-03 18:18:43,339 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 302 states, 301 states have (on average 1.4551495016611296) internal successors, (438), 301 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:43,340 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 438 transitions.
[2025-03-03 18:18:43,340 INFO  L78                 Accepts]: Start accepts. Automaton has 302 states and 438 transitions. Word has length 112
[2025-03-03 18:18:43,340 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:43,340 INFO  L471      AbstractCegarLoop]: Abstraction has 302 states and 438 transitions.
[2025-03-03 18:18:43,340 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:43,340 INFO  L276                IsEmpty]: Start isEmpty. Operand 302 states and 438 transitions.
[2025-03-03 18:18:43,341 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 114
[2025-03-03 18:18:43,341 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:43,341 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:18:43,341 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 18:18:43,341 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:43,342 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:43,342 INFO  L85        PathProgramCache]: Analyzing trace with hash 485311677, now seen corresponding path program 1 times
[2025-03-03 18:18:43,342 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:43,342 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150842530]
[2025-03-03 18:18:43,342 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:43,342 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:43,366 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes.
[2025-03-03 18:18:43,452 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements.
[2025-03-03 18:18:43,453 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:43,453 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:43,768 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:18:43,769 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:43,769 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150842530]
[2025-03-03 18:18:43,769 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150842530] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:43,769 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:43,769 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 18:18:43,769 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203550742]
[2025-03-03 18:18:43,769 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:43,769 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 18:18:43,770 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:43,770 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 18:18:43,770 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 18:18:43,770 INFO  L87              Difference]: Start difference. First operand 302 states and 438 transitions. Second operand  has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:43,935 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:43,935 INFO  L93              Difference]: Finished difference Result 480 states and 700 transitions.
[2025-03-03 18:18:43,935 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 18:18:43,936 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 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 113
[2025-03-03 18:18:43,936 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:43,937 INFO  L225             Difference]: With dead ends: 480
[2025-03-03 18:18:43,937 INFO  L226             Difference]: Without dead ends: 323
[2025-03-03 18:18:43,937 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-03 18:18:43,937 INFO  L435           NwaCegarLoop]: 223 mSDtfsCounter, 548 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:43,938 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 665 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 18:18:43,938 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 323 states.
[2025-03-03 18:18:43,942 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 321.
[2025-03-03 18:18:43,943 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 321 states, 320 states have (on average 1.453125) internal successors, (465), 320 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:43,944 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 465 transitions.
[2025-03-03 18:18:43,946 INFO  L78                 Accepts]: Start accepts. Automaton has 321 states and 465 transitions. Word has length 113
[2025-03-03 18:18:43,946 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:43,946 INFO  L471      AbstractCegarLoop]: Abstraction has 321 states and 465 transitions.
[2025-03-03 18:18:43,947 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:43,947 INFO  L276                IsEmpty]: Start isEmpty. Operand 321 states and 465 transitions.
[2025-03-03 18:18:43,947 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 115
[2025-03-03 18:18:43,947 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:43,947 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:18:43,948 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-03 18:18:43,948 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:43,948 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:43,948 INFO  L85        PathProgramCache]: Analyzing trace with hash -1243185302, now seen corresponding path program 1 times
[2025-03-03 18:18:43,948 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:43,948 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226893845]
[2025-03-03 18:18:43,948 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:43,948 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:43,980 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes.
[2025-03-03 18:18:44,056 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements.
[2025-03-03 18:18:44,056 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:44,056 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:44,405 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:18:44,406 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:44,406 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226893845]
[2025-03-03 18:18:44,406 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226893845] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:44,406 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:44,406 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-03 18:18:44,406 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568602069]
[2025-03-03 18:18:44,406 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:44,406 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 18:18:44,407 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:44,407 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 18:18:44,407 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-03-03 18:18:44,407 INFO  L87              Difference]: Start difference. First operand 321 states and 465 transitions. Second operand  has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:44,609 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:44,609 INFO  L93              Difference]: Finished difference Result 485 states and 706 transitions.
[2025-03-03 18:18:44,609 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-03 18:18:44,610 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 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 114
[2025-03-03 18:18:44,610 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:44,611 INFO  L225             Difference]: With dead ends: 485
[2025-03-03 18:18:44,611 INFO  L226             Difference]: Without dead ends: 328
[2025-03-03 18:18:44,611 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2025-03-03 18:18:44,612 INFO  L435           NwaCegarLoop]: 222 mSDtfsCounter, 557 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:44,612 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 940 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 18:18:44,613 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 328 states.
[2025-03-03 18:18:44,619 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 324.
[2025-03-03 18:18:44,619 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 324 states, 323 states have (on average 1.4520123839009287) internal successors, (469), 323 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:44,620 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 469 transitions.
[2025-03-03 18:18:44,620 INFO  L78                 Accepts]: Start accepts. Automaton has 324 states and 469 transitions. Word has length 114
[2025-03-03 18:18:44,620 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:44,620 INFO  L471      AbstractCegarLoop]: Abstraction has 324 states and 469 transitions.
[2025-03-03 18:18:44,620 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:44,623 INFO  L276                IsEmpty]: Start isEmpty. Operand 324 states and 469 transitions.
[2025-03-03 18:18:44,624 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 116
[2025-03-03 18:18:44,624 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:44,624 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:18:44,624 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 18:18:44,624 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:44,625 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:44,625 INFO  L85        PathProgramCache]: Analyzing trace with hash 1749980578, now seen corresponding path program 1 times
[2025-03-03 18:18:44,625 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:44,625 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995576914]
[2025-03-03 18:18:44,625 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:44,625 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:44,653 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes.
[2025-03-03 18:18:44,726 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements.
[2025-03-03 18:18:44,726 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:44,726 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:45,020 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:18:45,023 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:45,023 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995576914]
[2025-03-03 18:18:45,023 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995576914] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:45,024 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:45,024 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-03 18:18:45,024 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508350858]
[2025-03-03 18:18:45,024 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:45,024 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 18:18:45,024 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:45,025 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 18:18:45,025 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-03-03 18:18:45,025 INFO  L87              Difference]: Start difference. First operand 324 states and 469 transitions. Second operand  has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:45,267 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:45,267 INFO  L93              Difference]: Finished difference Result 491 states and 714 transitions.
[2025-03-03 18:18:45,267 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-03 18:18:45,267 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 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 115
[2025-03-03 18:18:45,268 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:45,269 INFO  L225             Difference]: With dead ends: 491
[2025-03-03 18:18:45,269 INFO  L226             Difference]: Without dead ends: 334
[2025-03-03 18:18:45,269 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2025-03-03 18:18:45,270 INFO  L435           NwaCegarLoop]: 223 mSDtfsCounter, 565 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:45,270 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 1105 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 18:18:45,270 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 334 states.
[2025-03-03 18:18:45,275 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 330.
[2025-03-03 18:18:45,276 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 330 states, 329 states have (on average 1.4498480243161094) internal successors, (477), 329 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:45,277 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 477 transitions.
[2025-03-03 18:18:45,277 INFO  L78                 Accepts]: Start accepts. Automaton has 330 states and 477 transitions. Word has length 115
[2025-03-03 18:18:45,277 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:45,277 INFO  L471      AbstractCegarLoop]: Abstraction has 330 states and 477 transitions.
[2025-03-03 18:18:45,278 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:45,278 INFO  L276                IsEmpty]: Start isEmpty. Operand 330 states and 477 transitions.
[2025-03-03 18:18:45,278 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 116
[2025-03-03 18:18:45,278 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:45,278 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:18:45,279 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 18:18:45,279 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:45,279 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:45,279 INFO  L85        PathProgramCache]: Analyzing trace with hash -1422759698, now seen corresponding path program 1 times
[2025-03-03 18:18:45,279 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:45,279 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152061826]
[2025-03-03 18:18:45,279 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:45,279 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:45,307 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes.
[2025-03-03 18:18:45,413 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements.
[2025-03-03 18:18:45,414 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:45,414 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:45,667 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:18:45,667 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:45,667 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152061826]
[2025-03-03 18:18:45,667 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152061826] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:45,667 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:45,668 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 18:18:45,668 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654908632]
[2025-03-03 18:18:45,669 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:45,669 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 18:18:45,669 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:45,670 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 18:18:45,670 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 18:18:45,670 INFO  L87              Difference]: Start difference. First operand 330 states and 477 transitions. Second operand  has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:45,833 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:45,833 INFO  L93              Difference]: Finished difference Result 512 states and 743 transitions.
[2025-03-03 18:18:45,834 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 18:18:45,834 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 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 115
[2025-03-03 18:18:45,834 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:45,835 INFO  L225             Difference]: With dead ends: 512
[2025-03-03 18:18:45,835 INFO  L226             Difference]: Without dead ends: 328
[2025-03-03 18:18:45,836 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-03 18:18:45,836 INFO  L435           NwaCegarLoop]: 224 mSDtfsCounter, 553 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:45,839 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 669 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 18:18:45,840 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 328 states.
[2025-03-03 18:18:45,849 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328.
[2025-03-03 18:18:45,850 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 328 states, 327 states have (on average 1.4495412844036697) internal successors, (474), 327 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:45,851 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 474 transitions.
[2025-03-03 18:18:45,851 INFO  L78                 Accepts]: Start accepts. Automaton has 328 states and 474 transitions. Word has length 115
[2025-03-03 18:18:45,851 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:45,851 INFO  L471      AbstractCegarLoop]: Abstraction has 328 states and 474 transitions.
[2025-03-03 18:18:45,851 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:45,851 INFO  L276                IsEmpty]: Start isEmpty. Operand 328 states and 474 transitions.
[2025-03-03 18:18:45,852 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 116
[2025-03-03 18:18:45,852 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:45,852 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:18:45,852 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-03 18:18:45,852 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:45,852 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:45,852 INFO  L85        PathProgramCache]: Analyzing trace with hash -357240312, now seen corresponding path program 1 times
[2025-03-03 18:18:45,852 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:45,852 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514172271]
[2025-03-03 18:18:45,852 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:45,853 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:45,877 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes.
[2025-03-03 18:18:45,957 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements.
[2025-03-03 18:18:45,957 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:45,957 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:46,246 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:18:46,246 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:46,246 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514172271]
[2025-03-03 18:18:46,246 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514172271] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:46,247 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:46,247 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 18:18:46,247 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041759775]
[2025-03-03 18:18:46,247 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:46,247 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 18:18:46,247 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:46,248 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 18:18:46,248 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-03 18:18:46,248 INFO  L87              Difference]: Start difference. First operand 328 states and 474 transitions. Second operand  has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:46,412 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:46,412 INFO  L93              Difference]: Finished difference Result 532 states and 771 transitions.
[2025-03-03 18:18:46,412 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 18:18:46,413 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 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 115
[2025-03-03 18:18:46,413 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:46,414 INFO  L225             Difference]: With dead ends: 532
[2025-03-03 18:18:46,414 INFO  L226             Difference]: Without dead ends: 328
[2025-03-03 18:18:46,414 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2025-03-03 18:18:46,415 INFO  L435           NwaCegarLoop]: 224 mSDtfsCounter, 564 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:46,415 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 669 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 18:18:46,415 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 328 states.
[2025-03-03 18:18:46,419 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328.
[2025-03-03 18:18:46,419 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 328 states, 327 states have (on average 1.4464831804281346) internal successors, (473), 327 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:46,420 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 473 transitions.
[2025-03-03 18:18:46,420 INFO  L78                 Accepts]: Start accepts. Automaton has 328 states and 473 transitions. Word has length 115
[2025-03-03 18:18:46,421 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:46,421 INFO  L471      AbstractCegarLoop]: Abstraction has 328 states and 473 transitions.
[2025-03-03 18:18:46,421 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:46,421 INFO  L276                IsEmpty]: Start isEmpty. Operand 328 states and 473 transitions.
[2025-03-03 18:18:46,422 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 117
[2025-03-03 18:18:46,422 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:46,422 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:18:46,422 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-03 18:18:46,422 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:46,422 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:46,423 INFO  L85        PathProgramCache]: Analyzing trace with hash 286308950, now seen corresponding path program 1 times
[2025-03-03 18:18:46,423 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:46,423 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475560219]
[2025-03-03 18:18:46,423 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:46,423 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:46,448 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes.
[2025-03-03 18:18:46,525 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements.
[2025-03-03 18:18:46,525 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:46,525 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:47,133 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:18:47,133 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:47,133 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475560219]
[2025-03-03 18:18:47,134 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475560219] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:18:47,134 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560564652]
[2025-03-03 18:18:47,134 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:47,134 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:18:47,134 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:18:47,136 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 18:18:47,138 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-03 18:18:47,303 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes.
[2025-03-03 18:18:47,405 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements.
[2025-03-03 18:18:47,405 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:47,405 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:47,410 INFO  L256         TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 45 conjuncts are in the unsatisfiable core
[2025-03-03 18:18:47,418 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 18:18:48,058 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:18:48,058 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 18:18:48,840 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:18:48,840 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560564652] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 18:18:48,840 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 18:18:48,840 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 28
[2025-03-03 18:18:48,840 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465892414]
[2025-03-03 18:18:48,841 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 18:18:48,841 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2025-03-03 18:18:48,841 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:48,842 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2025-03-03 18:18:48,842 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756
[2025-03-03 18:18:48,842 INFO  L87              Difference]: Start difference. First operand 328 states and 473 transitions. Second operand  has 28 states, 28 states have (on average 12.0) internal successors, (336), 28 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:49,764 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:49,764 INFO  L93              Difference]: Finished difference Result 876 states and 1266 transitions.
[2025-03-03 18:18:49,764 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-03-03 18:18:49,765 INFO  L78                 Accepts]: Start accepts. Automaton has  has 28 states, 28 states have (on average 12.0) internal successors, (336), 28 states have internal predecessors, (336), 0 states have call successors, (0), 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 116
[2025-03-03 18:18:49,765 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:49,767 INFO  L225             Difference]: With dead ends: 876
[2025-03-03 18:18:49,767 INFO  L226             Difference]: Without dead ends: 599
[2025-03-03 18:18:49,768 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=734, Unknown=0, NotChecked=0, Total=870
[2025-03-03 18:18:49,768 INFO  L435           NwaCegarLoop]: 337 mSDtfsCounter, 2155 mSDsluCounter, 4357 mSDsCounter, 0 mSdLazyCounter, 1939 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2155 SdHoareTripleChecker+Valid, 4694 SdHoareTripleChecker+Invalid, 1941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:49,768 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2155 Valid, 4694 Invalid, 1941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1939 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 18:18:49,769 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 599 states.
[2025-03-03 18:18:49,774 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 470.
[2025-03-03 18:18:49,775 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 470 states, 469 states have (on average 1.4349680170575694) internal successors, (673), 469 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:49,776 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 673 transitions.
[2025-03-03 18:18:49,776 INFO  L78                 Accepts]: Start accepts. Automaton has 470 states and 673 transitions. Word has length 116
[2025-03-03 18:18:49,776 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:49,776 INFO  L471      AbstractCegarLoop]: Abstraction has 470 states and 673 transitions.
[2025-03-03 18:18:49,777 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 28 states, 28 states have (on average 12.0) internal successors, (336), 28 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:49,777 INFO  L276                IsEmpty]: Start isEmpty. Operand 470 states and 673 transitions.
[2025-03-03 18:18:49,778 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 118
[2025-03-03 18:18:49,778 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:49,778 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:18:49,786 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-03 18:18:49,978 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,SelfDestructingSolverStorable13
[2025-03-03 18:18:49,979 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:49,979 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:49,979 INFO  L85        PathProgramCache]: Analyzing trace with hash 280641569, now seen corresponding path program 1 times
[2025-03-03 18:18:49,979 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:49,979 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589677789]
[2025-03-03 18:18:49,979 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:49,979 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:50,000 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes.
[2025-03-03 18:18:50,020 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements.
[2025-03-03 18:18:50,020 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:50,020 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:50,157 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:18:50,157 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:50,157 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589677789]
[2025-03-03 18:18:50,157 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589677789] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:50,157 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:50,157 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 18:18:50,157 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928242276]
[2025-03-03 18:18:50,158 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:50,158 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 18:18:50,158 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:50,158 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 18:18:50,158 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 18:18:50,158 INFO  L87              Difference]: Start difference. First operand 470 states and 673 transitions. Second operand  has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:50,282 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:50,283 INFO  L93              Difference]: Finished difference Result 748 states and 1074 transitions.
[2025-03-03 18:18:50,283 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 18:18:50,283 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 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 117
[2025-03-03 18:18:50,283 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:50,285 INFO  L225             Difference]: With dead ends: 748
[2025-03-03 18:18:50,285 INFO  L226             Difference]: Without dead ends: 469
[2025-03-03 18:18:50,286 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-03 18:18:50,287 INFO  L435           NwaCegarLoop]: 227 mSDtfsCounter, 615 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:50,287 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 677 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 18:18:50,288 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 469 states.
[2025-03-03 18:18:50,293 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 467.
[2025-03-03 18:18:50,294 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 467 states, 466 states have (on average 1.4313304721030042) internal successors, (667), 466 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:50,295 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 667 transitions.
[2025-03-03 18:18:50,296 INFO  L78                 Accepts]: Start accepts. Automaton has 467 states and 667 transitions. Word has length 117
[2025-03-03 18:18:50,296 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:50,296 INFO  L471      AbstractCegarLoop]: Abstraction has 467 states and 667 transitions.
[2025-03-03 18:18:50,296 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:50,296 INFO  L276                IsEmpty]: Start isEmpty. Operand 467 states and 667 transitions.
[2025-03-03 18:18:50,297 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 118
[2025-03-03 18:18:50,297 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:50,297 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:18:50,298 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-03 18:18:50,298 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:50,298 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:50,298 INFO  L85        PathProgramCache]: Analyzing trace with hash -296609956, now seen corresponding path program 1 times
[2025-03-03 18:18:50,298 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:50,298 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564265110]
[2025-03-03 18:18:50,298 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:50,299 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:50,320 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes.
[2025-03-03 18:18:50,341 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements.
[2025-03-03 18:18:50,341 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:50,341 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:50,505 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:18:50,506 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:50,506 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564265110]
[2025-03-03 18:18:50,506 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564265110] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:50,506 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:50,506 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 18:18:50,506 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601802591]
[2025-03-03 18:18:50,506 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:50,506 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 18:18:50,506 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:50,507 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 18:18:50,507 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-03 18:18:50,507 INFO  L87              Difference]: Start difference. First operand 467 states and 667 transitions. Second operand  has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:50,638 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:50,639 INFO  L93              Difference]: Finished difference Result 624 states and 898 transitions.
[2025-03-03 18:18:50,639 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 18:18:50,639 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 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 117
[2025-03-03 18:18:50,639 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:50,640 INFO  L225             Difference]: With dead ends: 624
[2025-03-03 18:18:50,640 INFO  L226             Difference]: Without dead ends: 344
[2025-03-03 18:18:50,641 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2025-03-03 18:18:50,642 INFO  L435           NwaCegarLoop]: 226 mSDtfsCounter, 597 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:50,642 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 673 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 18:18:50,642 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 344 states.
[2025-03-03 18:18:50,647 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344.
[2025-03-03 18:18:50,647 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 344 states, 343 states have (on average 1.4373177842565599) internal successors, (493), 343 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:50,648 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 493 transitions.
[2025-03-03 18:18:50,649 INFO  L78                 Accepts]: Start accepts. Automaton has 344 states and 493 transitions. Word has length 117
[2025-03-03 18:18:50,649 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:50,649 INFO  L471      AbstractCegarLoop]: Abstraction has 344 states and 493 transitions.
[2025-03-03 18:18:50,649 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:50,649 INFO  L276                IsEmpty]: Start isEmpty. Operand 344 states and 493 transitions.
[2025-03-03 18:18:50,650 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 194
[2025-03-03 18:18:50,650 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:50,650 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 18:18:50,650 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-03 18:18:50,650 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:50,651 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:50,651 INFO  L85        PathProgramCache]: Analyzing trace with hash 804809838, now seen corresponding path program 1 times
[2025-03-03 18:18:50,651 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:50,651 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118484446]
[2025-03-03 18:18:50,651 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:50,651 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:50,687 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes.
[2025-03-03 18:18:51,089 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements.
[2025-03-03 18:18:51,090 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:51,090 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:52,980 INFO  L134       CoverageAnalysis]: Checked inductivity of 89 backedges. 43 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:18:52,981 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:52,981 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118484446]
[2025-03-03 18:18:52,981 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118484446] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:18:52,982 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007410654]
[2025-03-03 18:18:52,982 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:52,982 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:18:52,982 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:18:52,984 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 18:18:52,985 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-03 18:18:53,178 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes.
[2025-03-03 18:18:53,387 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements.
[2025-03-03 18:18:53,387 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:53,387 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:53,394 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1227 conjuncts, 51 conjuncts are in the unsatisfiable core
[2025-03-03 18:18:53,407 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 18:18:53,888 INFO  L134       CoverageAnalysis]: Checked inductivity of 89 backedges. 46 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:18:53,888 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 18:18:54,141 INFO  L134       CoverageAnalysis]: Checked inductivity of 89 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2025-03-03 18:18:54,141 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007410654] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:18:54,141 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-03-03 18:18:54,141 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14, 9] total 26
[2025-03-03 18:18:54,141 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488175159]
[2025-03-03 18:18:54,141 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:54,141 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 18:18:54,141 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:54,142 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 18:18:54,142 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650
[2025-03-03 18:18:54,142 INFO  L87              Difference]: Start difference. First operand 344 states and 493 transitions. Second operand  has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:54,429 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:54,429 INFO  L93              Difference]: Finished difference Result 752 states and 1093 transitions.
[2025-03-03 18:18:54,430 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-03 18:18:54,430 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 0 states have call successors, (0), 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 193
[2025-03-03 18:18:54,430 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:54,432 INFO  L225             Difference]: With dead ends: 752
[2025-03-03 18:18:54,432 INFO  L226             Difference]: Without dead ends: 595
[2025-03-03 18:18:54,433 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 374 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812
[2025-03-03 18:18:54,434 INFO  L435           NwaCegarLoop]: 303 mSDtfsCounter, 296 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:54,434 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1255 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 18:18:54,435 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 595 states.
[2025-03-03 18:18:54,441 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 412.
[2025-03-03 18:18:54,442 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 412 states, 411 states have (on average 1.4452554744525548) internal successors, (594), 411 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:54,443 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 594 transitions.
[2025-03-03 18:18:54,443 INFO  L78                 Accepts]: Start accepts. Automaton has 412 states and 594 transitions. Word has length 193
[2025-03-03 18:18:54,444 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:54,444 INFO  L471      AbstractCegarLoop]: Abstraction has 412 states and 594 transitions.
[2025-03-03 18:18:54,445 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:54,445 INFO  L276                IsEmpty]: Start isEmpty. Operand 412 states and 594 transitions.
[2025-03-03 18:18:54,446 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 195
[2025-03-03 18:18:54,446 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:54,446 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 18:18:54,455 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-03 18:18:54,646 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2025-03-03 18:18:54,647 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:54,647 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:54,647 INFO  L85        PathProgramCache]: Analyzing trace with hash -835396294, now seen corresponding path program 1 times
[2025-03-03 18:18:54,647 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:54,647 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873415093]
[2025-03-03 18:18:54,647 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:54,647 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:54,690 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes.
[2025-03-03 18:18:55,045 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements.
[2025-03-03 18:18:55,045 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:55,045 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:55,975 INFO  L134       CoverageAnalysis]: Checked inductivity of 90 backedges. 60 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2025-03-03 18:18:55,976 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:55,976 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873415093]
[2025-03-03 18:18:55,976 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873415093] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:18:55,976 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787783670]
[2025-03-03 18:18:55,976 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:55,976 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:18:55,976 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:18:55,978 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 18:18:55,979 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-03 18:18:56,193 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes.
[2025-03-03 18:18:56,354 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements.
[2025-03-03 18:18:56,354 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:56,355 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:56,364 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1230 conjuncts, 83 conjuncts are in the unsatisfiable core
[2025-03-03 18:18:56,372 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 18:18:56,859 INFO  L134       CoverageAnalysis]: Checked inductivity of 90 backedges. 53 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:18:56,859 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 18:18:57,823 INFO  L134       CoverageAnalysis]: Checked inductivity of 90 backedges. 53 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:18:57,823 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [787783670] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 18:18:57,823 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 18:18:57,823 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 14] total 32
[2025-03-03 18:18:57,823 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595359395]
[2025-03-03 18:18:57,823 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 18:18:57,824 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2025-03-03 18:18:57,824 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:57,825 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2025-03-03 18:18:57,825 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992
[2025-03-03 18:18:57,826 INFO  L87              Difference]: Start difference. First operand 412 states and 594 transitions. Second operand  has 32 states, 32 states have (on average 16.09375) internal successors, (515), 32 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-03 18:18:59,610 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:59,610 INFO  L93              Difference]: Finished difference Result 1310 states and 1915 transitions.
[2025-03-03 18:18:59,610 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. 
[2025-03-03 18:18:59,611 INFO  L78                 Accepts]: Start accepts. Automaton has  has 32 states, 32 states have (on average 16.09375) internal successors, (515), 32 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) Word has length 194
[2025-03-03 18:18:59,611 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:59,614 INFO  L225             Difference]: With dead ends: 1310
[2025-03-03 18:18:59,614 INFO  L226             Difference]: Without dead ends: 1085
[2025-03-03 18:18:59,616 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=651, Invalid=3255, Unknown=0, NotChecked=0, Total=3906
[2025-03-03 18:18:59,616 INFO  L435           NwaCegarLoop]: 257 mSDtfsCounter, 3544 mSDsluCounter, 3760 mSDsCounter, 0 mSdLazyCounter, 1984 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3544 SdHoareTripleChecker+Valid, 4017 SdHoareTripleChecker+Invalid, 2000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:59,616 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3544 Valid, 4017 Invalid, 2000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1984 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-03 18:18:59,617 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1085 states.
[2025-03-03 18:18:59,628 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 833.
[2025-03-03 18:18:59,629 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 833 states, 832 states have (on average 1.4483173076923077) internal successors, (1205), 832 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:18:59,630 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1205 transitions.
[2025-03-03 18:18:59,631 INFO  L78                 Accepts]: Start accepts. Automaton has 833 states and 1205 transitions. Word has length 194
[2025-03-03 18:18:59,631 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:59,631 INFO  L471      AbstractCegarLoop]: Abstraction has 833 states and 1205 transitions.
[2025-03-03 18:18:59,631 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 16.09375) internal successors, (515), 32 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-03 18:18:59,631 INFO  L276                IsEmpty]: Start isEmpty. Operand 833 states and 1205 transitions.
[2025-03-03 18:18:59,633 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 195
[2025-03-03 18:18:59,633 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:59,633 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 18:18:59,644 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-03-03 18:18:59,838 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2025-03-03 18:18:59,838 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:59,838 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:59,839 INFO  L85        PathProgramCache]: Analyzing trace with hash 503725120, now seen corresponding path program 1 times
[2025-03-03 18:18:59,839 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:59,839 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587224328]
[2025-03-03 18:18:59,839 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:59,839 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:59,871 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes.
[2025-03-03 18:19:00,262 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements.
[2025-03-03 18:19:00,263 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:00,263 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:01,708 INFO  L134       CoverageAnalysis]: Checked inductivity of 90 backedges. 44 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:01,708 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:01,708 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587224328]
[2025-03-03 18:19:01,708 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587224328] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:19:01,708 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531492453]
[2025-03-03 18:19:01,708 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:01,708 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:01,708 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:19:01,710 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 18:19:01,711 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-03-03 18:19:01,929 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes.
[2025-03-03 18:19:02,067 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements.
[2025-03-03 18:19:02,068 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:02,068 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:02,073 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1230 conjuncts, 37 conjuncts are in the unsatisfiable core
[2025-03-03 18:19:02,079 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 18:19:02,247 INFO  L134       CoverageAnalysis]: Checked inductivity of 90 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2025-03-03 18:19:02,247 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 18:19:02,247 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531492453] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:19:02,247 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 18:19:02,247 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 19
[2025-03-03 18:19:02,247 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950679365]
[2025-03-03 18:19:02,247 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:19:02,247 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 18:19:02,247 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:19:02,248 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 18:19:02,248 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342
[2025-03-03 18:19:02,248 INFO  L87              Difference]: Start difference. First operand 833 states and 1205 transitions. Second operand  has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:02,494 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:02,494 INFO  L93              Difference]: Finished difference Result 1600 states and 2338 transitions.
[2025-03-03 18:19:02,495 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-03 18:19:02,495 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 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 194
[2025-03-03 18:19:02,495 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:02,498 INFO  L225             Difference]: With dead ends: 1600
[2025-03-03 18:19:02,498 INFO  L226             Difference]: Without dead ends: 1049
[2025-03-03 18:19:02,499 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 190 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420
[2025-03-03 18:19:02,499 INFO  L435           NwaCegarLoop]: 311 mSDtfsCounter, 179 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:02,499 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1516 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 18:19:02,500 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1049 states.
[2025-03-03 18:19:02,509 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 937.
[2025-03-03 18:19:02,510 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 937 states, 936 states have (on average 1.4497863247863247) internal successors, (1357), 936 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:02,511 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1357 transitions.
[2025-03-03 18:19:02,511 INFO  L78                 Accepts]: Start accepts. Automaton has 937 states and 1357 transitions. Word has length 194
[2025-03-03 18:19:02,512 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:02,512 INFO  L471      AbstractCegarLoop]: Abstraction has 937 states and 1357 transitions.
[2025-03-03 18:19:02,512 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:02,512 INFO  L276                IsEmpty]: Start isEmpty. Operand 937 states and 1357 transitions.
[2025-03-03 18:19:02,514 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 195
[2025-03-03 18:19:02,514 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:02,514 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 18:19:02,524 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2025-03-03 18:19:02,719 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:02,719 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:19:02,720 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:19:02,720 INFO  L85        PathProgramCache]: Analyzing trace with hash 1909080998, now seen corresponding path program 1 times
[2025-03-03 18:19:02,720 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:19:02,720 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231249266]
[2025-03-03 18:19:02,720 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:02,720 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:19:02,749 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes.
[2025-03-03 18:19:03,030 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements.
[2025-03-03 18:19:03,030 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:03,030 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:03,674 INFO  L134       CoverageAnalysis]: Checked inductivity of 89 backedges. 69 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:03,674 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:03,674 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231249266]
[2025-03-03 18:19:03,674 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231249266] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:19:03,674 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931050739]
[2025-03-03 18:19:03,674 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:03,674 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:03,675 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:19:03,676 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 18:19:03,678 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-03-03 18:19:03,931 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes.
[2025-03-03 18:19:04,083 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements.
[2025-03-03 18:19:04,083 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:04,084 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:04,089 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1230 conjuncts, 52 conjuncts are in the unsatisfiable core
[2025-03-03 18:19:04,095 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 18:19:04,626 INFO  L134       CoverageAnalysis]: Checked inductivity of 89 backedges. 53 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:04,627 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 18:19:04,882 INFO  L134       CoverageAnalysis]: Checked inductivity of 89 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2025-03-03 18:19:04,882 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [931050739] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:19:04,882 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-03-03 18:19:04,882 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 11] total 24
[2025-03-03 18:19:04,882 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714565714]
[2025-03-03 18:19:04,882 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:19:04,883 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 18:19:04,883 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:19:04,883 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 18:19:04,883 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552
[2025-03-03 18:19:04,883 INFO  L87              Difference]: Start difference. First operand 937 states and 1357 transitions. Second operand  has 8 states, 8 states have (on average 22.5) internal successors, (180), 8 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:05,245 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:05,246 INFO  L93              Difference]: Finished difference Result 2839 states and 4162 transitions.
[2025-03-03 18:19:05,246 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-03 18:19:05,246 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 22.5) internal successors, (180), 8 states have internal predecessors, (180), 0 states have call successors, (0), 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 194
[2025-03-03 18:19:05,246 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:05,250 INFO  L225             Difference]: With dead ends: 2839
[2025-03-03 18:19:05,250 INFO  L226             Difference]: Without dead ends: 1615
[2025-03-03 18:19:05,252 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 375 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702
[2025-03-03 18:19:05,252 INFO  L435           NwaCegarLoop]: 524 mSDtfsCounter, 997 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 997 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:05,253 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [997 Valid, 1500 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 18:19:05,254 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1615 states.
[2025-03-03 18:19:05,265 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1046.
[2025-03-03 18:19:05,267 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1046 states, 1045 states have (on average 1.4526315789473685) internal successors, (1518), 1045 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:05,268 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1518 transitions.
[2025-03-03 18:19:05,268 INFO  L78                 Accepts]: Start accepts. Automaton has 1046 states and 1518 transitions. Word has length 194
[2025-03-03 18:19:05,268 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:05,268 INFO  L471      AbstractCegarLoop]: Abstraction has 1046 states and 1518 transitions.
[2025-03-03 18:19:05,268 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 22.5) internal successors, (180), 8 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:05,268 INFO  L276                IsEmpty]: Start isEmpty. Operand 1046 states and 1518 transitions.
[2025-03-03 18:19:05,270 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 196
[2025-03-03 18:19:05,270 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:05,270 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 18:19:05,279 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2025-03-03 18:19:05,471 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:05,471 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:19:05,474 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:19:05,474 INFO  L85        PathProgramCache]: Analyzing trace with hash 977640335, now seen corresponding path program 1 times
[2025-03-03 18:19:05,474 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:19:05,474 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097151310]
[2025-03-03 18:19:05,474 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:05,474 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:19:05,515 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes.
[2025-03-03 18:19:05,560 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements.
[2025-03-03 18:19:05,560 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:05,560 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:05,745 INFO  L134       CoverageAnalysis]: Checked inductivity of 90 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked.
[2025-03-03 18:19:05,746 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:05,746 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097151310]
[2025-03-03 18:19:05,746 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097151310] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:19:05,746 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:19:05,746 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 18:19:05,746 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511128629]
[2025-03-03 18:19:05,746 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:19:05,746 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 18:19:05,746 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:19:05,746 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 18:19:05,746 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 18:19:05,747 INFO  L87              Difference]: Start difference. First operand 1046 states and 1518 transitions. Second operand  has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:05,845 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:05,846 INFO  L93              Difference]: Finished difference Result 1375 states and 2002 transitions.
[2025-03-03 18:19:05,846 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 18:19:05,846 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 0 states have call successors, (0), 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 195
[2025-03-03 18:19:05,846 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:05,848 INFO  L225             Difference]: With dead ends: 1375
[2025-03-03 18:19:05,848 INFO  L226             Difference]: Without dead ends: 913
[2025-03-03 18:19:05,849 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-03 18:19:05,849 INFO  L435           NwaCegarLoop]: 227 mSDtfsCounter, 573 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:05,850 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 676 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 18:19:05,851 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 913 states.
[2025-03-03 18:19:05,859 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 913.
[2025-03-03 18:19:05,860 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 913 states, 912 states have (on average 1.4583333333333333) internal successors, (1330), 912 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:05,861 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1330 transitions.
[2025-03-03 18:19:05,861 INFO  L78                 Accepts]: Start accepts. Automaton has 913 states and 1330 transitions. Word has length 195
[2025-03-03 18:19:05,861 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:05,861 INFO  L471      AbstractCegarLoop]: Abstraction has 913 states and 1330 transitions.
[2025-03-03 18:19:05,861 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:05,861 INFO  L276                IsEmpty]: Start isEmpty. Operand 913 states and 1330 transitions.
[2025-03-03 18:19:05,863 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 196
[2025-03-03 18:19:05,863 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:05,863 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 18:19:05,863 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-03-03 18:19:05,863 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:19:05,864 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:19:05,864 INFO  L85        PathProgramCache]: Analyzing trace with hash -1140280411, now seen corresponding path program 1 times
[2025-03-03 18:19:05,864 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:19:05,864 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655388276]
[2025-03-03 18:19:05,864 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:05,864 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:19:05,896 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes.
[2025-03-03 18:19:06,174 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements.
[2025-03-03 18:19:06,174 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:06,174 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:06,728 INFO  L134       CoverageAnalysis]: Checked inductivity of 91 backedges. 63 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:06,729 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:06,729 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655388276]
[2025-03-03 18:19:06,729 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655388276] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:19:06,729 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014110754]
[2025-03-03 18:19:06,729 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:06,729 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:06,729 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:19:06,731 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 18:19:06,732 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-03-03 18:19:06,983 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes.
[2025-03-03 18:19:07,121 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements.
[2025-03-03 18:19:07,121 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:07,121 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:07,126 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1231 conjuncts, 59 conjuncts are in the unsatisfiable core
[2025-03-03 18:19:07,131 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 18:19:07,521 INFO  L134       CoverageAnalysis]: Checked inductivity of 91 backedges. 63 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:07,521 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 18:19:07,679 INFO  L134       CoverageAnalysis]: Checked inductivity of 91 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2025-03-03 18:19:07,679 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014110754] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:19:07,679 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-03-03 18:19:07,679 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 11] total 21
[2025-03-03 18:19:07,679 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391333086]
[2025-03-03 18:19:07,679 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:19:07,679 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 18:19:07,679 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:19:07,680 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 18:19:07,680 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420
[2025-03-03 18:19:07,680 INFO  L87              Difference]: Start difference. First operand 913 states and 1330 transitions. Second operand  has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:07,853 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:07,854 INFO  L93              Difference]: Finished difference Result 2644 states and 3882 transitions.
[2025-03-03 18:19:07,854 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 18:19:07,854 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 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 195
[2025-03-03 18:19:07,854 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:07,857 INFO  L225             Difference]: With dead ends: 2644
[2025-03-03 18:19:07,857 INFO  L226             Difference]: Without dead ends: 1202
[2025-03-03 18:19:07,861 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462
[2025-03-03 18:19:07,863 INFO  L435           NwaCegarLoop]: 490 mSDtfsCounter, 583 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:07,863 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 983 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 18:19:07,864 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1202 states.
[2025-03-03 18:19:07,893 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 904.
[2025-03-03 18:19:07,894 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 904 states, 903 states have (on average 1.4540420819490587) internal successors, (1313), 903 states have internal predecessors, (1313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:07,895 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1313 transitions.
[2025-03-03 18:19:07,895 INFO  L78                 Accepts]: Start accepts. Automaton has 904 states and 1313 transitions. Word has length 195
[2025-03-03 18:19:07,895 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:07,895 INFO  L471      AbstractCegarLoop]: Abstraction has 904 states and 1313 transitions.
[2025-03-03 18:19:07,896 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:07,896 INFO  L276                IsEmpty]: Start isEmpty. Operand 904 states and 1313 transitions.
[2025-03-03 18:19:07,897 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 196
[2025-03-03 18:19:07,897 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:07,898 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:19:07,920 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-03-03 18:19:08,098 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:08,098 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:19:08,099 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:19:08,099 INFO  L85        PathProgramCache]: Analyzing trace with hash -1157283353, now seen corresponding path program 1 times
[2025-03-03 18:19:08,099 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:19:08,099 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392732863]
[2025-03-03 18:19:08,099 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:08,099 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:19:08,130 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes.
[2025-03-03 18:19:08,452 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements.
[2025-03-03 18:19:08,452 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:08,452 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:09,345 INFO  L134       CoverageAnalysis]: Checked inductivity of 91 backedges. 31 proven. 53 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-03-03 18:19:09,345 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:09,345 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392732863]
[2025-03-03 18:19:09,345 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392732863] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:19:09,345 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848712909]
[2025-03-03 18:19:09,345 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:09,345 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:09,346 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:19:09,348 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 18:19:09,349 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-03-03 18:19:09,625 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes.
[2025-03-03 18:19:09,774 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements.
[2025-03-03 18:19:09,774 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:09,774 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:09,780 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 94 conjuncts are in the unsatisfiable core
[2025-03-03 18:19:09,785 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 18:19:10,489 INFO  L134       CoverageAnalysis]: Checked inductivity of 91 backedges. 31 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:10,489 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 18:19:10,944 INFO  L134       CoverageAnalysis]: Checked inductivity of 91 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2025-03-03 18:19:10,944 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [848712909] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:19:10,944 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-03-03 18:19:10,944 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11, 15] total 34
[2025-03-03 18:19:10,944 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317928563]
[2025-03-03 18:19:10,944 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:19:10,945 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-03-03 18:19:10,945 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:19:10,945 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-03-03 18:19:10,945 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=987, Unknown=0, NotChecked=0, Total=1122
[2025-03-03 18:19:10,946 INFO  L87              Difference]: Start difference. First operand 904 states and 1313 transitions. Second operand  has 12 states, 12 states have (on average 15.083333333333334) internal successors, (181), 12 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:11,647 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:11,648 INFO  L93              Difference]: Finished difference Result 2696 states and 3946 transitions.
[2025-03-03 18:19:11,648 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-03-03 18:19:11,648 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 15.083333333333334) internal successors, (181), 12 states have internal predecessors, (181), 0 states have call successors, (0), 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 195
[2025-03-03 18:19:11,648 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:11,652 INFO  L225             Difference]: With dead ends: 2696
[2025-03-03 18:19:11,652 INFO  L226             Difference]: Without dead ends: 1272
[2025-03-03 18:19:11,655 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=208, Invalid=1432, Unknown=0, NotChecked=0, Total=1640
[2025-03-03 18:19:11,655 INFO  L435           NwaCegarLoop]: 478 mSDtfsCounter, 1706 mSDsluCounter, 1879 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1706 SdHoareTripleChecker+Valid, 2357 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:11,656 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1706 Valid, 2357 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 18:19:11,661 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1272 states.
[2025-03-03 18:19:11,671 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1086.
[2025-03-03 18:19:11,672 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1086 states, 1085 states have (on average 1.4589861751152073) internal successors, (1583), 1085 states have internal predecessors, (1583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:11,673 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1583 transitions.
[2025-03-03 18:19:11,673 INFO  L78                 Accepts]: Start accepts. Automaton has 1086 states and 1583 transitions. Word has length 195
[2025-03-03 18:19:11,673 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:11,673 INFO  L471      AbstractCegarLoop]: Abstraction has 1086 states and 1583 transitions.
[2025-03-03 18:19:11,674 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 15.083333333333334) internal successors, (181), 12 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:11,674 INFO  L276                IsEmpty]: Start isEmpty. Operand 1086 states and 1583 transitions.
[2025-03-03 18:19:11,675 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 196
[2025-03-03 18:19:11,675 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:11,675 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 18:19:11,686 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2025-03-03 18:19:11,876 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:11,880 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:19:11,881 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:19:11,881 INFO  L85        PathProgramCache]: Analyzing trace with hash -818586986, now seen corresponding path program 1 times
[2025-03-03 18:19:11,881 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:19:11,881 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083784407]
[2025-03-03 18:19:11,881 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:11,881 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:19:11,916 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes.
[2025-03-03 18:19:12,189 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements.
[2025-03-03 18:19:12,190 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:12,190 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:13,284 INFO  L134       CoverageAnalysis]: Checked inductivity of 89 backedges. 69 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-03 18:19:13,284 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:13,284 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083784407]
[2025-03-03 18:19:13,284 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083784407] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:19:13,284 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117418761]
[2025-03-03 18:19:13,284 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:13,284 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:13,284 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:19:13,286 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 18:19:13,287 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2025-03-03 18:19:13,565 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes.
[2025-03-03 18:19:13,730 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements.
[2025-03-03 18:19:13,730 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:13,730 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:13,735 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 70 conjuncts are in the unsatisfiable core
[2025-03-03 18:19:13,740 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 18:19:14,101 INFO  L134       CoverageAnalysis]: Checked inductivity of 89 backedges. 53 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:14,101 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 18:19:15,233 INFO  L134       CoverageAnalysis]: Checked inductivity of 89 backedges. 33 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:15,234 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [117418761] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 18:19:15,234 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 18:19:15,234 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 14] total 32
[2025-03-03 18:19:15,234 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886348154]
[2025-03-03 18:19:15,234 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 18:19:15,234 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2025-03-03 18:19:15,234 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:19:15,235 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2025-03-03 18:19:15,235 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=869, Unknown=0, NotChecked=0, Total=992
[2025-03-03 18:19:15,235 INFO  L87              Difference]: Start difference. First operand 1086 states and 1583 transitions. Second operand  has 32 states, 32 states have (on average 16.15625) internal successors, (517), 32 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:18,153 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:18,154 INFO  L93              Difference]: Finished difference Result 6412 states and 9354 transitions.
[2025-03-03 18:19:18,154 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. 
[2025-03-03 18:19:18,155 INFO  L78                 Accepts]: Start accepts. Automaton has  has 32 states, 32 states have (on average 16.15625) internal successors, (517), 32 states have internal predecessors, (517), 0 states have call successors, (0), 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 195
[2025-03-03 18:19:18,155 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:18,165 INFO  L225             Difference]: With dead ends: 6412
[2025-03-03 18:19:18,165 INFO  L226             Difference]: Without dead ends: 5104
[2025-03-03 18:19:18,168 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3848 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2291, Invalid=10365, Unknown=0, NotChecked=0, Total=12656
[2025-03-03 18:19:18,169 INFO  L435           NwaCegarLoop]: 258 mSDtfsCounter, 10515 mSDsluCounter, 5775 mSDsCounter, 0 mSdLazyCounter, 2862 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10515 SdHoareTripleChecker+Valid, 6033 SdHoareTripleChecker+Invalid, 2888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:18,169 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [10515 Valid, 6033 Invalid, 2888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2862 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-03 18:19:18,173 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5104 states.
[2025-03-03 18:19:18,199 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5104 to 2002.
[2025-03-03 18:19:18,200 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2002 states, 2001 states have (on average 1.4437781109445278) internal successors, (2889), 2001 states have internal predecessors, (2889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:18,202 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 2889 transitions.
[2025-03-03 18:19:18,202 INFO  L78                 Accepts]: Start accepts. Automaton has 2002 states and 2889 transitions. Word has length 195
[2025-03-03 18:19:18,203 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:18,203 INFO  L471      AbstractCegarLoop]: Abstraction has 2002 states and 2889 transitions.
[2025-03-03 18:19:18,204 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 16.15625) internal successors, (517), 32 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:18,204 INFO  L276                IsEmpty]: Start isEmpty. Operand 2002 states and 2889 transitions.
[2025-03-03 18:19:18,206 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 197
[2025-03-03 18:19:18,206 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:18,206 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 18:19:18,216 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2025-03-03 18:19:18,407 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23
[2025-03-03 18:19:18,407 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:19:18,407 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:19:18,408 INFO  L85        PathProgramCache]: Analyzing trace with hash -1615396201, now seen corresponding path program 1 times
[2025-03-03 18:19:18,408 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:19:18,408 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907343761]
[2025-03-03 18:19:18,408 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:18,408 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:19:18,435 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes.
[2025-03-03 18:19:18,740 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements.
[2025-03-03 18:19:18,740 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:18,740 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:19,289 INFO  L134       CoverageAnalysis]: Checked inductivity of 92 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-03-03 18:19:19,290 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:19,290 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907343761]
[2025-03-03 18:19:19,290 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907343761] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:19:19,290 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:19:19,290 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-03 18:19:19,290 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581157754]
[2025-03-03 18:19:19,290 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:19:19,290 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 18:19:19,290 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:19:19,291 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 18:19:19,291 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-03-03 18:19:19,291 INFO  L87              Difference]: Start difference. First operand 2002 states and 2889 transitions. Second operand  has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:19,449 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:19,449 INFO  L93              Difference]: Finished difference Result 3749 states and 5452 transitions.
[2025-03-03 18:19:19,449 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-03 18:19:19,450 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 0 states have call successors, (0), 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 196
[2025-03-03 18:19:19,450 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:19,454 INFO  L225             Difference]: With dead ends: 3749
[2025-03-03 18:19:19,454 INFO  L226             Difference]: Without dead ends: 2392
[2025-03-03 18:19:19,455 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-03-03 18:19:19,456 INFO  L435           NwaCegarLoop]: 224 mSDtfsCounter, 127 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:19,456 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1237 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 18:19:19,457 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2392 states.
[2025-03-03 18:19:19,471 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 2053.
[2025-03-03 18:19:19,473 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2053 states, 2052 states have (on average 1.4454191033138402) internal successors, (2966), 2052 states have internal predecessors, (2966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:19,475 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 2966 transitions.
[2025-03-03 18:19:19,476 INFO  L78                 Accepts]: Start accepts. Automaton has 2053 states and 2966 transitions. Word has length 196
[2025-03-03 18:19:19,476 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:19,476 INFO  L471      AbstractCegarLoop]: Abstraction has 2053 states and 2966 transitions.
[2025-03-03 18:19:19,476 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:19,476 INFO  L276                IsEmpty]: Start isEmpty. Operand 2053 states and 2966 transitions.
[2025-03-03 18:19:19,479 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 197
[2025-03-03 18:19:19,479 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:19,479 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 18:19:19,479 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2025-03-03 18:19:19,479 INFO  L396      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:19:19,480 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:19:19,480 INFO  L85        PathProgramCache]: Analyzing trace with hash 1249148652, now seen corresponding path program 1 times
[2025-03-03 18:19:19,480 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:19:19,480 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939071746]
[2025-03-03 18:19:19,480 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:19,480 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:19:19,510 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes.
[2025-03-03 18:19:19,826 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements.
[2025-03-03 18:19:19,826 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:19,826 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:21,301 INFO  L134       CoverageAnalysis]: Checked inductivity of 91 backedges. 23 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:21,301 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:21,301 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939071746]
[2025-03-03 18:19:21,301 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939071746] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:19:21,301 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383930448]
[2025-03-03 18:19:21,301 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:21,301 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:21,301 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:19:21,303 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 18:19:21,316 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2025-03-03 18:19:21,642 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes.
[2025-03-03 18:19:21,779 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements.
[2025-03-03 18:19:21,779 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:21,779 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:21,784 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1236 conjuncts, 39 conjuncts are in the unsatisfiable core
[2025-03-03 18:19:21,788 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 18:19:21,957 INFO  L134       CoverageAnalysis]: Checked inductivity of 91 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2025-03-03 18:19:21,957 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 18:19:21,957 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383930448] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:19:21,957 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 18:19:21,957 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 19
[2025-03-03 18:19:21,957 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228598755]
[2025-03-03 18:19:21,957 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:19:21,958 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 18:19:21,958 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:19:21,958 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 18:19:21,958 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342
[2025-03-03 18:19:21,958 INFO  L87              Difference]: Start difference. First operand 2053 states and 2966 transitions. Second operand  has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:22,125 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:22,125 INFO  L93              Difference]: Finished difference Result 3702 states and 5383 transitions.
[2025-03-03 18:19:22,126 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-03 18:19:22,126 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 0 states have call successors, (0), 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 196
[2025-03-03 18:19:22,126 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:22,130 INFO  L225             Difference]: With dead ends: 3702
[2025-03-03 18:19:22,131 INFO  L226             Difference]: Without dead ends: 2280
[2025-03-03 18:19:22,132 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380
[2025-03-03 18:19:22,132 INFO  L435           NwaCegarLoop]: 314 mSDtfsCounter, 116 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:22,132 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1310 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 18:19:22,134 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2280 states.
[2025-03-03 18:19:22,153 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2280 to 2240.
[2025-03-03 18:19:22,162 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2240 states, 2239 states have (on average 1.4461813309513176) internal successors, (3238), 2239 states have internal predecessors, (3238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:22,165 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 2240 states and 3238 transitions.
[2025-03-03 18:19:22,165 INFO  L78                 Accepts]: Start accepts. Automaton has 2240 states and 3238 transitions. Word has length 196
[2025-03-03 18:19:22,165 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:22,165 INFO  L471      AbstractCegarLoop]: Abstraction has 2240 states and 3238 transitions.
[2025-03-03 18:19:22,165 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:22,165 INFO  L276                IsEmpty]: Start isEmpty. Operand 2240 states and 3238 transitions.
[2025-03-03 18:19:22,168 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 197
[2025-03-03 18:19:22,168 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:22,168 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 18:19:22,178 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2025-03-03 18:19:22,368 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25
[2025-03-03 18:19:22,369 INFO  L396      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:19:22,370 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:19:22,370 INFO  L85        PathProgramCache]: Analyzing trace with hash -1339081759, now seen corresponding path program 1 times
[2025-03-03 18:19:22,370 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:19:22,370 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526556430]
[2025-03-03 18:19:22,370 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:22,370 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:19:22,400 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes.
[2025-03-03 18:19:22,659 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements.
[2025-03-03 18:19:22,659 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:22,659 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:23,214 INFO  L134       CoverageAnalysis]: Checked inductivity of 91 backedges. 62 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:23,214 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:23,214 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526556430]
[2025-03-03 18:19:23,214 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526556430] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:19:23,214 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70933440]
[2025-03-03 18:19:23,214 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:23,214 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:23,215 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:19:23,216 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 18:19:23,217 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2025-03-03 18:19:23,526 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes.
[2025-03-03 18:19:23,697 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements.
[2025-03-03 18:19:23,697 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:23,697 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:23,702 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1236 conjuncts, 111 conjuncts are in the unsatisfiable core
[2025-03-03 18:19:23,707 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 18:19:24,326 INFO  L134       CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:24,326 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 18:19:24,919 INFO  L134       CoverageAnalysis]: Checked inductivity of 91 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-03-03 18:19:24,919 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [70933440] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:19:24,919 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-03-03 18:19:24,919 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [8, 22] total 41
[2025-03-03 18:19:24,919 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267020912]
[2025-03-03 18:19:24,919 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:19:24,919 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-03-03 18:19:24,919 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:19:24,920 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-03-03 18:19:24,920 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=1362, Unknown=0, NotChecked=0, Total=1640
[2025-03-03 18:19:24,921 INFO  L87              Difference]: Start difference. First operand 2240 states and 3238 transitions. Second operand  has 15 states, 15 states have (on average 12.6) internal successors, (189), 15 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:25,829 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:25,829 INFO  L93              Difference]: Finished difference Result 7148 states and 10422 transitions.
[2025-03-03 18:19:25,829 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2025-03-03 18:19:25,829 INFO  L78                 Accepts]: Start accepts. Automaton has  has 15 states, 15 states have (on average 12.6) internal successors, (189), 15 states have internal predecessors, (189), 0 states have call successors, (0), 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 196
[2025-03-03 18:19:25,830 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:25,838 INFO  L225             Difference]: With dead ends: 7148
[2025-03-03 18:19:25,838 INFO  L226             Difference]: Without dead ends: 3945
[2025-03-03 18:19:25,841 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 363 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=444, Invalid=2006, Unknown=0, NotChecked=0, Total=2450
[2025-03-03 18:19:25,842 INFO  L435           NwaCegarLoop]: 383 mSDtfsCounter, 2529 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2529 SdHoareTripleChecker+Valid, 2070 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:25,842 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2529 Valid, 2070 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 18:19:25,843 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3945 states.
[2025-03-03 18:19:25,867 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3945 to 2515.
[2025-03-03 18:19:25,869 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2515 states, 2514 states have (on average 1.449085123309467) internal successors, (3643), 2514 states have internal predecessors, (3643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:25,873 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2515 states to 2515 states and 3643 transitions.
[2025-03-03 18:19:25,873 INFO  L78                 Accepts]: Start accepts. Automaton has 2515 states and 3643 transitions. Word has length 196
[2025-03-03 18:19:25,873 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:25,873 INFO  L471      AbstractCegarLoop]: Abstraction has 2515 states and 3643 transitions.
[2025-03-03 18:19:25,873 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 12.6) internal successors, (189), 15 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:25,873 INFO  L276                IsEmpty]: Start isEmpty. Operand 2515 states and 3643 transitions.
[2025-03-03 18:19:25,877 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 197
[2025-03-03 18:19:25,878 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:25,878 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 18:19:25,887 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2025-03-03 18:19:26,078 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26
[2025-03-03 18:19:26,078 INFO  L396      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:19:26,079 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:19:26,079 INFO  L85        PathProgramCache]: Analyzing trace with hash 1572316358, now seen corresponding path program 1 times
[2025-03-03 18:19:26,079 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:19:26,079 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541851927]
[2025-03-03 18:19:26,079 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:26,079 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:19:26,107 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes.
[2025-03-03 18:19:26,346 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements.
[2025-03-03 18:19:26,346 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:26,346 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:27,392 INFO  L134       CoverageAnalysis]: Checked inductivity of 89 backedges. 53 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:27,392 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:27,392 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541851927]
[2025-03-03 18:19:27,392 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541851927] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:19:27,392 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069748806]
[2025-03-03 18:19:27,392 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:27,392 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:27,392 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:19:27,394 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 18:19:27,395 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2025-03-03 18:19:27,713 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes.
[2025-03-03 18:19:27,866 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements.
[2025-03-03 18:19:27,866 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:27,866 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:27,871 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1236 conjuncts, 87 conjuncts are in the unsatisfiable core
[2025-03-03 18:19:27,876 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 18:19:28,644 INFO  L134       CoverageAnalysis]: Checked inductivity of 89 backedges. 43 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:28,644 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 18:19:30,389 INFO  L134       CoverageAnalysis]: Checked inductivity of 89 backedges. 37 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:30,389 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069748806] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 18:19:30,389 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 18:19:30,389 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 16] total 35
[2025-03-03 18:19:30,389 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836155182]
[2025-03-03 18:19:30,389 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 18:19:30,390 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2025-03-03 18:19:30,390 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:19:30,390 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2025-03-03 18:19:30,391 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190
[2025-03-03 18:19:30,391 INFO  L87              Difference]: Start difference. First operand 2515 states and 3643 transitions. Second operand  has 35 states, 35 states have (on average 15.514285714285714) internal successors, (543), 35 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:32,347 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:32,348 INFO  L93              Difference]: Finished difference Result 6919 states and 10054 transitions.
[2025-03-03 18:19:32,348 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. 
[2025-03-03 18:19:32,348 INFO  L78                 Accepts]: Start accepts. Automaton has  has 35 states, 35 states have (on average 15.514285714285714) internal successors, (543), 35 states have internal predecessors, (543), 0 states have call successors, (0), 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 196
[2025-03-03 18:19:32,348 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:32,355 INFO  L225             Difference]: With dead ends: 6919
[2025-03-03 18:19:32,355 INFO  L226             Difference]: Without dead ends: 4624
[2025-03-03 18:19:32,358 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 369 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=517, Invalid=3643, Unknown=0, NotChecked=0, Total=4160
[2025-03-03 18:19:32,359 INFO  L435           NwaCegarLoop]: 434 mSDtfsCounter, 2637 mSDsluCounter, 7895 mSDsCounter, 0 mSdLazyCounter, 3757 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2637 SdHoareTripleChecker+Valid, 8329 SdHoareTripleChecker+Invalid, 3774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:32,359 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2637 Valid, 8329 Invalid, 3774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3757 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-03-03 18:19:32,361 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4624 states.
[2025-03-03 18:19:32,387 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4624 to 3918.
[2025-03-03 18:19:32,390 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3918 states, 3917 states have (on average 1.4442175134031146) internal successors, (5657), 3917 states have internal predecessors, (5657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:32,393 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3918 states to 3918 states and 5657 transitions.
[2025-03-03 18:19:32,393 INFO  L78                 Accepts]: Start accepts. Automaton has 3918 states and 5657 transitions. Word has length 196
[2025-03-03 18:19:32,393 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:32,393 INFO  L471      AbstractCegarLoop]: Abstraction has 3918 states and 5657 transitions.
[2025-03-03 18:19:32,394 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 35 states, 35 states have (on average 15.514285714285714) internal successors, (543), 35 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:32,394 INFO  L276                IsEmpty]: Start isEmpty. Operand 3918 states and 5657 transitions.
[2025-03-03 18:19:32,397 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 198
[2025-03-03 18:19:32,397 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:32,397 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 18:19:32,407 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2025-03-03 18:19:32,598 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27
[2025-03-03 18:19:32,598 INFO  L396      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:19:32,598 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:19:32,598 INFO  L85        PathProgramCache]: Analyzing trace with hash 960924443, now seen corresponding path program 1 times
[2025-03-03 18:19:32,598 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:19:32,598 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267074882]
[2025-03-03 18:19:32,598 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:32,598 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:19:32,635 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes.
[2025-03-03 18:19:32,967 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements.
[2025-03-03 18:19:32,968 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:32,968 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:33,664 INFO  L134       CoverageAnalysis]: Checked inductivity of 92 backedges. 21 proven. 64 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-03-03 18:19:33,665 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:33,665 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267074882]
[2025-03-03 18:19:33,665 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267074882] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:19:33,665 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635782384]
[2025-03-03 18:19:33,665 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:33,665 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:33,665 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:19:33,668 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 18:19:33,669 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2025-03-03 18:19:34,003 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes.
[2025-03-03 18:19:34,134 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements.
[2025-03-03 18:19:34,135 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:34,135 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:34,140 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1239 conjuncts, 93 conjuncts are in the unsatisfiable core
[2025-03-03 18:19:34,145 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 18:19:35,228 INFO  L134       CoverageAnalysis]: Checked inductivity of 92 backedges. 34 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:35,228 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 18:19:35,697 INFO  L134       CoverageAnalysis]: Checked inductivity of 92 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2025-03-03 18:19:35,697 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [635782384] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:19:35,697 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-03-03 18:19:35,697 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [11, 19] total 40
[2025-03-03 18:19:35,697 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521736872]
[2025-03-03 18:19:35,697 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:19:35,698 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-03-03 18:19:35,698 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:19:35,698 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-03-03 18:19:35,699 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1352, Unknown=0, NotChecked=0, Total=1560
[2025-03-03 18:19:35,699 INFO  L87              Difference]: Start difference. First operand 3918 states and 5657 transitions. Second operand  has 14 states, 14 states have (on average 11.071428571428571) internal successors, (155), 14 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:36,179 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:36,179 INFO  L93              Difference]: Finished difference Result 6155 states and 8930 transitions.
[2025-03-03 18:19:36,179 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2025-03-03 18:19:36,180 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 14 states have (on average 11.071428571428571) internal successors, (155), 14 states have internal predecessors, (155), 0 states have call successors, (0), 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-03 18:19:36,180 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:36,185 INFO  L225             Difference]: With dead ends: 6155
[2025-03-03 18:19:36,185 INFO  L226             Difference]: Without dead ends: 4342
[2025-03-03 18:19:36,187 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=1559, Unknown=0, NotChecked=0, Total=1806
[2025-03-03 18:19:36,187 INFO  L435           NwaCegarLoop]: 211 mSDtfsCounter, 730 mSDsluCounter, 1821 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 2032 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:36,187 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 2032 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 18:19:36,189 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4342 states.
[2025-03-03 18:19:36,224 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4342 to 4291.
[2025-03-03 18:19:36,226 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4291 states, 4290 states have (on average 1.4452214452214451) internal successors, (6200), 4290 states have internal predecessors, (6200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:36,230 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4291 states to 4291 states and 6200 transitions.
[2025-03-03 18:19:36,230 INFO  L78                 Accepts]: Start accepts. Automaton has 4291 states and 6200 transitions. Word has length 197
[2025-03-03 18:19:36,231 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:36,231 INFO  L471      AbstractCegarLoop]: Abstraction has 4291 states and 6200 transitions.
[2025-03-03 18:19:36,231 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 11.071428571428571) internal successors, (155), 14 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:36,231 INFO  L276                IsEmpty]: Start isEmpty. Operand 4291 states and 6200 transitions.
[2025-03-03 18:19:36,234 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 199
[2025-03-03 18:19:36,234 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:36,235 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 18:19:36,244 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0
[2025-03-03 18:19:36,435 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28
[2025-03-03 18:19:36,435 INFO  L396      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:19:36,435 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:19:36,436 INFO  L85        PathProgramCache]: Analyzing trace with hash -1649633613, now seen corresponding path program 1 times
[2025-03-03 18:19:36,436 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:19:36,436 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674836805]
[2025-03-03 18:19:36,436 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:36,436 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:19:36,476 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes.
[2025-03-03 18:19:36,786 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements.
[2025-03-03 18:19:36,787 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:36,787 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:37,679 INFO  L134       CoverageAnalysis]: Checked inductivity of 92 backedges. 69 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2025-03-03 18:19:37,679 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:37,679 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674836805]
[2025-03-03 18:19:37,679 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674836805] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:19:37,679 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113501457]
[2025-03-03 18:19:37,679 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:37,679 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:37,679 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:19:37,681 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 18:19:37,682 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2025-03-03 18:19:38,037 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes.
[2025-03-03 18:19:38,166 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements.
[2025-03-03 18:19:38,166 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:38,167 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:38,172 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1242 conjuncts, 109 conjuncts are in the unsatisfiable core
[2025-03-03 18:19:38,176 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 18:19:38,588 INFO  L134       CoverageAnalysis]: Checked inductivity of 92 backedges. 58 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-03-03 18:19:38,588 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 18:19:40,361 INFO  L134       CoverageAnalysis]: Checked inductivity of 92 backedges. 41 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:40,361 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113501457] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 18:19:40,361 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 18:19:40,361 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 20] total 40
[2025-03-03 18:19:40,361 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218784519]
[2025-03-03 18:19:40,361 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 18:19:40,361 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 40 states
[2025-03-03 18:19:40,361 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:19:40,362 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2025-03-03 18:19:40,362 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1374, Unknown=0, NotChecked=0, Total=1560
[2025-03-03 18:19:40,363 INFO  L87              Difference]: Start difference. First operand 4291 states and 6200 transitions. Second operand  has 40 states, 40 states have (on average 13.0) internal successors, (520), 40 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:46,885 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:46,885 INFO  L93              Difference]: Finished difference Result 37627 states and 54905 transitions.
[2025-03-03 18:19:46,886 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. 
[2025-03-03 18:19:46,886 INFO  L78                 Accepts]: Start accepts. Automaton has  has 40 states, 40 states have (on average 13.0) internal successors, (520), 40 states have internal predecessors, (520), 0 states have call successors, (0), 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-03 18:19:46,886 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:46,930 INFO  L225             Difference]: With dead ends: 37627
[2025-03-03 18:19:46,930 INFO  L226             Difference]: Without dead ends: 34383
[2025-03-03 18:19:46,944 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11154 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=4779, Invalid=27083, Unknown=0, NotChecked=0, Total=31862
[2025-03-03 18:19:46,947 INFO  L435           NwaCegarLoop]: 239 mSDtfsCounter, 5486 mSDsluCounter, 5782 mSDsCounter, 0 mSdLazyCounter, 4489 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5486 SdHoareTripleChecker+Valid, 6021 SdHoareTripleChecker+Invalid, 4542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 4489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:46,947 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [5486 Valid, 6021 Invalid, 4542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 4489 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-03-03 18:19:46,967 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 34383 states.
[2025-03-03 18:19:47,115 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 34383 to 10884.
[2025-03-03 18:19:47,124 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10884 states, 10883 states have (on average 1.4438114490489755) internal successors, (15713), 10883 states have internal predecessors, (15713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:47,188 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10884 states to 10884 states and 15713 transitions.
[2025-03-03 18:19:47,189 INFO  L78                 Accepts]: Start accepts. Automaton has 10884 states and 15713 transitions. Word has length 198
[2025-03-03 18:19:47,189 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:47,190 INFO  L471      AbstractCegarLoop]: Abstraction has 10884 states and 15713 transitions.
[2025-03-03 18:19:47,190 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 40 states, 40 states have (on average 13.0) internal successors, (520), 40 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:47,190 INFO  L276                IsEmpty]: Start isEmpty. Operand 10884 states and 15713 transitions.
[2025-03-03 18:19:47,197 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 199
[2025-03-03 18:19:47,197 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:47,197 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 18:19:47,206 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0
[2025-03-03 18:19:47,397 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:47,398 INFO  L396      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:19:47,398 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:19:47,399 INFO  L85        PathProgramCache]: Analyzing trace with hash -1198858293, now seen corresponding path program 1 times
[2025-03-03 18:19:47,399 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:19:47,399 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359898014]
[2025-03-03 18:19:47,399 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:47,399 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:19:47,430 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes.
[2025-03-03 18:19:47,713 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements.
[2025-03-03 18:19:47,713 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:47,713 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:48,263 INFO  L134       CoverageAnalysis]: Checked inductivity of 93 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-03-03 18:19:48,263 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:48,263 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359898014]
[2025-03-03 18:19:48,263 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359898014] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:19:48,263 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:19:48,263 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-03 18:19:48,263 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332917611]
[2025-03-03 18:19:48,263 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:19:48,264 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 18:19:48,264 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:19:48,264 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 18:19:48,264 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-03-03 18:19:48,264 INFO  L87              Difference]: Start difference. First operand 10884 states and 15713 transitions. Second operand  has 7 states, 7 states have (on average 27.428571428571427) internal successors, (192), 7 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:48,422 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:48,422 INFO  L93              Difference]: Finished difference Result 17896 states and 25942 transitions.
[2025-03-03 18:19:48,422 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-03 18:19:48,422 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 27.428571428571427) internal successors, (192), 7 states have internal predecessors, (192), 0 states have call successors, (0), 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-03 18:19:48,422 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:48,434 INFO  L225             Difference]: With dead ends: 17896
[2025-03-03 18:19:48,434 INFO  L226             Difference]: Without dead ends: 11190
[2025-03-03 18:19:48,440 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-03-03 18:19:48,441 INFO  L435           NwaCegarLoop]: 221 mSDtfsCounter, 116 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:48,441 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1145 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 18:19:48,446 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11190 states.
[2025-03-03 18:19:48,508 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11190 to 10396.
[2025-03-03 18:19:48,516 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10396 states, 10395 states have (on average 1.4432900432900433) internal successors, (15003), 10395 states have internal predecessors, (15003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:48,525 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10396 states to 10396 states and 15003 transitions.
[2025-03-03 18:19:48,525 INFO  L78                 Accepts]: Start accepts. Automaton has 10396 states and 15003 transitions. Word has length 198
[2025-03-03 18:19:48,525 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:48,525 INFO  L471      AbstractCegarLoop]: Abstraction has 10396 states and 15003 transitions.
[2025-03-03 18:19:48,525 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 27.428571428571427) internal successors, (192), 7 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:48,525 INFO  L276                IsEmpty]: Start isEmpty. Operand 10396 states and 15003 transitions.
[2025-03-03 18:19:48,531 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 199
[2025-03-03 18:19:48,532 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:48,532 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 18:19:48,532 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2025-03-03 18:19:48,532 INFO  L396      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:19:48,532 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:19:48,532 INFO  L85        PathProgramCache]: Analyzing trace with hash 1357905937, now seen corresponding path program 1 times
[2025-03-03 18:19:48,533 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:19:48,533 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719375626]
[2025-03-03 18:19:48,533 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:48,533 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:19:48,562 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes.
[2025-03-03 18:19:48,925 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements.
[2025-03-03 18:19:48,925 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:48,925 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:49,540 INFO  L134       CoverageAnalysis]: Checked inductivity of 92 backedges. 88 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:49,540 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:49,540 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719375626]
[2025-03-03 18:19:49,540 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719375626] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:19:49,540 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993513484]
[2025-03-03 18:19:49,540 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:49,540 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:49,540 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:19:49,542 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 18:19:49,542 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2025-03-03 18:19:49,949 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes.
[2025-03-03 18:19:50,120 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements.
[2025-03-03 18:19:50,120 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:50,120 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:50,126 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1242 conjuncts, 115 conjuncts are in the unsatisfiable core
[2025-03-03 18:19:50,130 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 18:19:50,508 INFO  L134       CoverageAnalysis]: Checked inductivity of 92 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked.
[2025-03-03 18:19:50,508 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 18:19:50,508 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [993513484] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:19:50,508 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 18:19:50,508 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [10] total 28
[2025-03-03 18:19:50,508 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395055247]
[2025-03-03 18:19:50,509 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:19:50,509 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2025-03-03 18:19:50,509 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:19:50,509 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2025-03-03 18:19:50,509 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756
[2025-03-03 18:19:50,509 INFO  L87              Difference]: Start difference. First operand 10396 states and 15003 transitions. Second operand  has 20 states, 20 states have (on average 8.3) internal successors, (166), 20 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:51,190 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:51,190 INFO  L93              Difference]: Finished difference Result 20814 states and 30192 transitions.
[2025-03-03 18:19:51,190 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2025-03-03 18:19:51,191 INFO  L78                 Accepts]: Start accepts. Automaton has  has 20 states, 20 states have (on average 8.3) internal successors, (166), 20 states have internal predecessors, (166), 0 states have call successors, (0), 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-03 18:19:51,191 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:51,210 INFO  L225             Difference]: With dead ends: 20814
[2025-03-03 18:19:51,210 INFO  L226             Difference]: Without dead ends: 14564
[2025-03-03 18:19:51,219 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=946, Unknown=0, NotChecked=0, Total=1056
[2025-03-03 18:19:51,220 INFO  L435           NwaCegarLoop]: 251 mSDtfsCounter, 152 mSDsluCounter, 3268 mSDsCounter, 0 mSdLazyCounter, 1659 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 3519 SdHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:51,220 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 3519 Invalid, 1661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1659 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 18:19:51,242 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14564 states.
[2025-03-03 18:19:51,326 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14564 to 11910.
[2025-03-03 18:19:51,336 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11910 states, 11909 states have (on average 1.4463850869090604) internal successors, (17225), 11909 states have internal predecessors, (17225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:51,347 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11910 states to 11910 states and 17225 transitions.
[2025-03-03 18:19:51,348 INFO  L78                 Accepts]: Start accepts. Automaton has 11910 states and 17225 transitions. Word has length 198
[2025-03-03 18:19:51,348 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:51,348 INFO  L471      AbstractCegarLoop]: Abstraction has 11910 states and 17225 transitions.
[2025-03-03 18:19:51,348 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 20 states have (on average 8.3) internal successors, (166), 20 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:51,348 INFO  L276                IsEmpty]: Start isEmpty. Operand 11910 states and 17225 transitions.
[2025-03-03 18:19:51,356 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 199
[2025-03-03 18:19:51,356 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:51,357 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 18:19:51,367 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0
[2025-03-03 18:19:51,557 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:51,557 INFO  L396      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:19:51,557 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:19:51,557 INFO  L85        PathProgramCache]: Analyzing trace with hash -1814834339, now seen corresponding path program 1 times
[2025-03-03 18:19:51,558 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:19:51,558 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731815375]
[2025-03-03 18:19:51,558 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:51,558 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:19:51,585 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes.
[2025-03-03 18:19:51,899 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements.
[2025-03-03 18:19:51,900 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:51,900 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:52,640 INFO  L134       CoverageAnalysis]: Checked inductivity of 93 backedges. 9 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:52,640 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:52,640 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731815375]
[2025-03-03 18:19:52,640 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731815375] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:19:52,640 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555727936]
[2025-03-03 18:19:52,640 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:52,640 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:52,640 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:19:52,642 INFO  L229       MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 18:19:52,642 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2025-03-03 18:19:53,027 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes.
[2025-03-03 18:19:53,188 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements.
[2025-03-03 18:19:53,188 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:53,188 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:53,194 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1240 conjuncts, 63 conjuncts are in the unsatisfiable core
[2025-03-03 18:19:53,197 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 18:19:53,443 INFO  L134       CoverageAnalysis]: Checked inductivity of 93 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2025-03-03 18:19:53,443 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 18:19:53,444 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555727936] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:19:53,444 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 18:19:53,444 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18
[2025-03-03 18:19:53,444 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16517340]
[2025-03-03 18:19:53,444 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:19:53,444 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-03 18:19:53,444 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:19:53,445 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-03 18:19:53,445 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306
[2025-03-03 18:19:53,445 INFO  L87              Difference]: Start difference. First operand 11910 states and 17225 transitions. Second operand  has 10 states, 10 states have (on average 17.3) internal successors, (173), 10 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:53,793 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:53,793 INFO  L93              Difference]: Finished difference Result 20670 states and 30026 transitions.
[2025-03-03 18:19:53,793 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-03-03 18:19:53,794 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 17.3) internal successors, (173), 10 states have internal predecessors, (173), 0 states have call successors, (0), 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-03 18:19:53,794 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:53,805 INFO  L225             Difference]: With dead ends: 20670
[2025-03-03 18:19:53,805 INFO  L226             Difference]: Without dead ends: 13228
[2025-03-03 18:19:53,811 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342
[2025-03-03 18:19:53,812 INFO  L435           NwaCegarLoop]: 304 mSDtfsCounter, 225 mSDsluCounter, 1851 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 2155 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:53,812 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 2155 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 18:19:53,818 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13228 states.
[2025-03-03 18:19:53,908 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13228 to 12764.
[2025-03-03 18:19:53,917 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12764 states, 12763 states have (on average 1.4455065423489775) internal successors, (18449), 12763 states have internal predecessors, (18449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:53,929 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12764 states to 12764 states and 18449 transitions.
[2025-03-03 18:19:53,929 INFO  L78                 Accepts]: Start accepts. Automaton has 12764 states and 18449 transitions. Word has length 198
[2025-03-03 18:19:53,930 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:53,930 INFO  L471      AbstractCegarLoop]: Abstraction has 12764 states and 18449 transitions.
[2025-03-03 18:19:53,930 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 17.3) internal successors, (173), 10 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:19:53,930 INFO  L276                IsEmpty]: Start isEmpty. Operand 12764 states and 18449 transitions.
[2025-03-03 18:19:53,937 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 199
[2025-03-03 18:19:53,937 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:53,938 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 18:19:53,948 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0
[2025-03-03 18:19:54,138 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:54,138 INFO  L396      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:19:54,139 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:19:54,139 INFO  L85        PathProgramCache]: Analyzing trace with hash -1871541973, now seen corresponding path program 1 times
[2025-03-03 18:19:54,140 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:19:54,140 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323194723]
[2025-03-03 18:19:54,140 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:54,140 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:19:54,170 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes.
[2025-03-03 18:19:54,476 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements.
[2025-03-03 18:19:54,476 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:54,476 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:55,019 INFO  L134       CoverageAnalysis]: Checked inductivity of 93 backedges. 19 proven. 73 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-03-03 18:19:55,019 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:55,019 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323194723]
[2025-03-03 18:19:55,019 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323194723] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:19:55,019 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787313136]
[2025-03-03 18:19:55,019 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:55,019 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:55,019 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:19:55,021 INFO  L229       MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 18:19:55,022 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process
[2025-03-03 18:19:55,424 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes.
[2025-03-03 18:19:55,564 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements.
[2025-03-03 18:19:55,564 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:55,564 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:55,569 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1240 conjuncts, 83 conjuncts are in the unsatisfiable core
[2025-03-03 18:19:55,573 INFO  L279         TraceCheckSpWp]: Computing forward predicates...