./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_loop.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_loop.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 8bae34b88b69e395b0952f9a7e7405cfa96e2c3307dff9bcbb01737f33e4d41e
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 18:18:36,587 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 18:18:36,647 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:36,651 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 18:18:36,652 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 18:18:36,672 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 18:18:36,674 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 18:18:36,674 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 18:18:36,674 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 18:18:36,674 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 18:18:36,675 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 18:18:36,675 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 18:18:36,675 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 18:18:36,675 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 18:18:36,676 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 18:18:36,676 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 18:18:36,676 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 18:18:36,676 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 18:18:36,676 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 18:18:36,676 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 18:18:36,676 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 18:18:36,676 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 18:18:36,677 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 18:18:36,677 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 18:18:36,677 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 18:18:36,677 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 18:18:36,677 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 18:18:36,677 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 18:18:36,677 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 18:18:36,677 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 18:18:36,678 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 18:18:36,678 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 18:18:36,678 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 18:18:36,678 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 18:18:36,678 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 18:18:36,678 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 18:18:36,678 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 18:18:36,678 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 18:18:36,678 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 18:18:36,678 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 18:18:36,678 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 -> 8bae34b88b69e395b0952f9a7e7405cfa96e2c3307dff9bcbb01737f33e4d41e
[2025-03-03 18:18:36,878 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 18:18:36,886 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 18:18:36,888 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 18:18:36,889 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 18:18:36,889 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 18:18:36,890 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_loop.c
[2025-03-03 18:18:37,986 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e3e78dd2/50acbe909b5d4dd3ac01ee0d9c77c134/FLAG8b17c4874
[2025-03-03 18:18:38,271 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 18:18:38,274 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_loop.c
[2025-03-03 18:18:38,285 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e3e78dd2/50acbe909b5d4dd3ac01ee0d9c77c134/FLAG8b17c4874
[2025-03-03 18:18:38,576 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e3e78dd2/50acbe909b5d4dd3ac01ee0d9c77c134
[2025-03-03 18:18:38,578 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 18:18:38,579 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 18:18:38,581 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 18:18:38,581 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 18:18:38,584 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 18:18:38,586 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:18:38" (1/1) ...
[2025-03-03 18:18:38,586 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71a0534c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:38, skipping insertion in model container
[2025-03-03 18:18:38,588 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:18:38" (1/1) ...
[2025-03-03 18:18:38,610 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 18:18:38,715 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_loop.c[1247,1260]
[2025-03-03 18:18:38,795 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 18:18:38,801 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 18:18:38,807 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_loop.c[1247,1260]
[2025-03-03 18:18:38,864 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 18:18:38,873 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 18:18:38,873 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:38 WrapperNode
[2025-03-03 18:18:38,874 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 18:18:38,875 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 18:18:38,875 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 18:18:38,875 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 18:18:38,879 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:38" (1/1) ...
[2025-03-03 18:18:38,893 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:38" (1/1) ...
[2025-03-03 18:18:38,978 INFO  L138                Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1012
[2025-03-03 18:18:38,978 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 18:18:38,979 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 18:18:38,979 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 18:18:38,979 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 18:18:38,984 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:38" (1/1) ...
[2025-03-03 18:18:38,985 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:38" (1/1) ...
[2025-03-03 18:18:39,007 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:38" (1/1) ...
[2025-03-03 18:18:39,040 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:39,040 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:38" (1/1) ...
[2025-03-03 18:18:39,040 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:38" (1/1) ...
[2025-03-03 18:18:39,068 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:38" (1/1) ...
[2025-03-03 18:18:39,074 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:38" (1/1) ...
[2025-03-03 18:18:39,084 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:38" (1/1) ...
[2025-03-03 18:18:39,092 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:38" (1/1) ...
[2025-03-03 18:18:39,109 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 18:18:39,111 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 18:18:39,111 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 18:18:39,111 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 18:18:39,112 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:38" (1/1) ...
[2025-03-03 18:18:39,116 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 18:18:39,127 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:18:39,139 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:39,142 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:39,159 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 18:18:39,160 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 18:18:39,160 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 18:18:39,160 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 18:18:39,301 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 18:18:39,303 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 18:18:40,302 INFO  L?                        ?]: Removed 647 outVars from TransFormulas that were not future-live.
[2025-03-03 18:18:40,303 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 18:18:40,358 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 18:18:40,359 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 18:18:40,359 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:18:40 BoogieIcfgContainer
[2025-03-03 18:18:40,359 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 18:18:40,362 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 18:18:40,362 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 18:18:40,365 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 18:18:40,366 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:18:38" (1/3) ...
[2025-03-03 18:18:40,366 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521d43b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:18:40, skipping insertion in model container
[2025-03-03 18:18:40,366 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:38" (2/3) ...
[2025-03-03 18:18:40,367 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521d43b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:18:40, skipping insertion in model container
[2025-03-03 18:18:40,367 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:18:40" (3/3) ...
[2025-03-03 18:18:40,368 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.sw_loop.c
[2025-03-03 18:18:40,378 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 18:18:40,380 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.sw_loop.c that has 1 procedures, 298 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 18:18:40,432 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 18:18:40,440 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;@596b8657, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 18:18:40,440 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 18:18:40,445 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 298 states, 296 states have (on average 1.4966216216216217) internal successors, (443), 297 states have internal predecessors, (443), 0 states have call successors, (0), 0 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,449 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2025-03-03 18:18:40,450 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:40,450 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:40,451 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:40,454 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:40,454 INFO  L85        PathProgramCache]: Analyzing trace with hash -1458086393, now seen corresponding path program 1 times
[2025-03-03 18:18:40,460 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:40,461 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327646390]
[2025-03-03 18:18:40,461 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:40,461 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:40,528 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-03-03 18:18:40,572 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-03-03 18:18:40,573 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:40,573 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:40,912 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:40,914 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:40,914 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327646390]
[2025-03-03 18:18:40,915 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327646390] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:40,915 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:40,916 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 18:18:40,917 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356145977]
[2025-03-03 18:18:40,917 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:40,920 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 18:18:40,921 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:40,933 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 18:18:40,934 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 18:18:40,937 INFO  L87              Difference]: Start difference. First operand  has 298 states, 296 states have (on average 1.4966216216216217) internal successors, (443), 297 states have internal predecessors, (443), 0 states have call successors, (0), 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:41,138 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:41,139 INFO  L93              Difference]: Finished difference Result 557 states and 831 transitions.
[2025-03-03 18:18:41,140 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 18:18:41,141 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:41,141 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:41,147 INFO  L225             Difference]: With dead ends: 557
[2025-03-03 18:18:41,147 INFO  L226             Difference]: Without dead ends: 297
[2025-03-03 18:18:41,149 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:41,151 INFO  L435           NwaCegarLoop]: 365 mSDtfsCounter, 0 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:41,152 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1090 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 18:18:41,163 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 297 states.
[2025-03-03 18:18:41,183 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297.
[2025-03-03 18:18:41,184 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 297 states, 296 states have (on average 1.489864864864865) internal successors, (441), 296 states have internal predecessors, (441), 0 states have call successors, (0), 0 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,187 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 441 transitions.
[2025-03-03 18:18:41,188 INFO  L78                 Accepts]: Start accepts. Automaton has 297 states and 441 transitions. Word has length 27
[2025-03-03 18:18:41,188 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:41,189 INFO  L471      AbstractCegarLoop]: Abstraction has 297 states and 441 transitions.
[2025-03-03 18:18:41,189 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:41,189 INFO  L276                IsEmpty]: Start isEmpty. Operand 297 states and 441 transitions.
[2025-03-03 18:18:41,189 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2025-03-03 18:18:41,189 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:41,189 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:41,193 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 18:18:41,193 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:41,194 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:41,194 INFO  L85        PathProgramCache]: Analyzing trace with hash 2048641645, now seen corresponding path program 1 times
[2025-03-03 18:18:41,194 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:41,194 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261910162]
[2025-03-03 18:18:41,194 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:41,194 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:41,208 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes.
[2025-03-03 18:18:41,218 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements.
[2025-03-03 18:18:41,218 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:41,218 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:41,308 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:41,308 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:41,309 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261910162]
[2025-03-03 18:18:41,309 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261910162] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:41,309 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:41,309 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 18:18:41,309 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359021286]
[2025-03-03 18:18:41,309 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:41,309 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 18:18:41,310 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:41,310 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 18:18:41,310 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 18:18:41,310 INFO  L87              Difference]: Start difference. First operand 297 states and 441 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:41,475 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:41,476 INFO  L93              Difference]: Finished difference Result 558 states and 829 transitions.
[2025-03-03 18:18:41,476 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 18:18:41,476 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:41,476 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:41,478 INFO  L225             Difference]: With dead ends: 558
[2025-03-03 18:18:41,478 INFO  L226             Difference]: Without dead ends: 299
[2025-03-03 18:18:41,478 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:41,479 INFO  L435           NwaCegarLoop]: 365 mSDtfsCounter, 0 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:41,479 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1087 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 18:18:41,480 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 299 states.
[2025-03-03 18:18:41,491 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299.
[2025-03-03 18:18:41,493 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 299 states, 298 states have (on average 1.4865771812080537) internal successors, (443), 298 states have internal predecessors, (443), 0 states have call successors, (0), 0 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,494 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 443 transitions.
[2025-03-03 18:18:41,494 INFO  L78                 Accepts]: Start accepts. Automaton has 299 states and 443 transitions. Word has length 28
[2025-03-03 18:18:41,494 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:41,494 INFO  L471      AbstractCegarLoop]: Abstraction has 299 states and 443 transitions.
[2025-03-03 18:18:41,494 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:41,494 INFO  L276                IsEmpty]: Start isEmpty. Operand 299 states and 443 transitions.
[2025-03-03 18:18:41,495 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-03-03 18:18:41,495 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:41,495 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:41,495 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 18:18:41,496 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:41,496 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:41,498 INFO  L85        PathProgramCache]: Analyzing trace with hash 1014891202, now seen corresponding path program 1 times
[2025-03-03 18:18:41,499 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:41,499 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758226134]
[2025-03-03 18:18:41,499 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:41,499 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:41,511 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-03-03 18:18:41,531 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-03-03 18:18:41,533 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:41,534 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:41,650 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:41,650 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:41,650 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758226134]
[2025-03-03 18:18:41,650 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758226134] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:41,650 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:41,650 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 18:18:41,650 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738520762]
[2025-03-03 18:18:41,650 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:41,651 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 18:18:41,651 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:41,651 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 18:18:41,651 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 18:18:41,651 INFO  L87              Difference]: Start difference. First operand 299 states and 443 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:41,873 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:41,874 INFO  L93              Difference]: Finished difference Result 795 states and 1180 transitions.
[2025-03-03 18:18:41,874 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 18:18:41,874 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:41,874 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:41,876 INFO  L225             Difference]: With dead ends: 795
[2025-03-03 18:18:41,876 INFO  L226             Difference]: Without dead ends: 534
[2025-03-03 18:18:41,877 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:41,877 INFO  L435           NwaCegarLoop]: 355 mSDtfsCounter, 1117 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:41,878 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 1060 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 18:18:41,878 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 534 states.
[2025-03-03 18:18:41,885 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 301.
[2025-03-03 18:18:41,886 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 301 states, 300 states have (on average 1.4833333333333334) internal successors, (445), 300 states have internal predecessors, (445), 0 states have call successors, (0), 0 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,886 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 445 transitions.
[2025-03-03 18:18:41,887 INFO  L78                 Accepts]: Start accepts. Automaton has 301 states and 445 transitions. Word has length 29
[2025-03-03 18:18:41,887 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:41,887 INFO  L471      AbstractCegarLoop]: Abstraction has 301 states and 445 transitions.
[2025-03-03 18:18:41,887 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:41,887 INFO  L276                IsEmpty]: Start isEmpty. Operand 301 states and 445 transitions.
[2025-03-03 18:18:41,890 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 159
[2025-03-03 18:18:41,890 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:41,891 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,891 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 18:18:41,891 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:41,891 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:41,891 INFO  L85        PathProgramCache]: Analyzing trace with hash -162977166, now seen corresponding path program 1 times
[2025-03-03 18:18:41,891 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:41,891 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548658881]
[2025-03-03 18:18:41,891 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:41,891 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:41,960 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes.
[2025-03-03 18:18:42,313 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements.
[2025-03-03 18:18:42,313 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:42,313 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:42,892 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,893 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:42,893 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548658881]
[2025-03-03 18:18:42,893 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548658881] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:42,893 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:42,893 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 18:18:42,894 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850034671]
[2025-03-03 18:18:42,894 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:42,894 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 18:18:42,894 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:42,895 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 18:18:42,895 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-03 18:18:42,895 INFO  L87              Difference]: Start difference. First operand 301 states and 445 transitions. Second operand  has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 0 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,162 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:43,162 INFO  L93              Difference]: Finished difference Result 778 states and 1154 transitions.
[2025-03-03 18:18:43,163 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 18:18:43,163 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 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 158
[2025-03-03 18:18:43,163 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:43,167 INFO  L225             Difference]: With dead ends: 778
[2025-03-03 18:18:43,167 INFO  L226             Difference]: Without dead ends: 517
[2025-03-03 18:18:43,168 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2025-03-03 18:18:43,169 INFO  L435           NwaCegarLoop]: 354 mSDtfsCounter, 1048 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:43,170 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 1312 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 18:18:43,170 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 517 states.
[2025-03-03 18:18:43,182 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 326.
[2025-03-03 18:18:43,182 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 326 states, 325 states have (on average 1.4738461538461538) internal successors, (479), 325 states have internal predecessors, (479), 0 states have call successors, (0), 0 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,183 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 479 transitions.
[2025-03-03 18:18:43,183 INFO  L78                 Accepts]: Start accepts. Automaton has 326 states and 479 transitions. Word has length 158
[2025-03-03 18:18:43,183 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:43,183 INFO  L471      AbstractCegarLoop]: Abstraction has 326 states and 479 transitions.
[2025-03-03 18:18:43,184 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 0 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,184 INFO  L276                IsEmpty]: Start isEmpty. Operand 326 states and 479 transitions.
[2025-03-03 18:18:43,190 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 160
[2025-03-03 18:18:43,190 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:43,190 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,190 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 18:18:43,190 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:43,191 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:43,191 INFO  L85        PathProgramCache]: Analyzing trace with hash 1757927362, now seen corresponding path program 1 times
[2025-03-03 18:18:43,191 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:43,191 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213056082]
[2025-03-03 18:18:43,191 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:43,191 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:43,228 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes.
[2025-03-03 18:18:43,299 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements.
[2025-03-03 18:18:43,300 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:43,300 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:43,607 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,608 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:43,608 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213056082]
[2025-03-03 18:18:43,608 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213056082] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:43,608 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:43,608 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 18:18:43,608 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200673322]
[2025-03-03 18:18:43,608 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:43,609 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 18:18:43,609 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:43,609 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 18:18:43,609 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 18:18:43,610 INFO  L87              Difference]: Start difference. First operand 326 states and 479 transitions. Second operand  has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 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,823 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:43,824 INFO  L93              Difference]: Finished difference Result 780 states and 1155 transitions.
[2025-03-03 18:18:43,824 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 18:18:43,824 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 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 159
[2025-03-03 18:18:43,824 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:43,826 INFO  L225             Difference]: With dead ends: 780
[2025-03-03 18:18:43,826 INFO  L226             Difference]: Without dead ends: 519
[2025-03-03 18:18:43,827 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:43,827 INFO  L435           NwaCegarLoop]: 356 mSDtfsCounter, 1053 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:43,828 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 1063 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 18:18:43,828 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 519 states.
[2025-03-03 18:18:43,835 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 326.
[2025-03-03 18:18:43,836 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 326 states, 325 states have (on average 1.4707692307692308) internal successors, (478), 325 states have internal predecessors, (478), 0 states have call successors, (0), 0 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,837 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 478 transitions.
[2025-03-03 18:18:43,837 INFO  L78                 Accepts]: Start accepts. Automaton has 326 states and 478 transitions. Word has length 159
[2025-03-03 18:18:43,837 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:43,837 INFO  L471      AbstractCegarLoop]: Abstraction has 326 states and 478 transitions.
[2025-03-03 18:18:43,837 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 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,838 INFO  L276                IsEmpty]: Start isEmpty. Operand 326 states and 478 transitions.
[2025-03-03 18:18:43,839 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 160
[2025-03-03 18:18:43,839 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:43,839 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,839 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 18:18:43,840 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:43,840 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:43,840 INFO  L85        PathProgramCache]: Analyzing trace with hash -202272953, now seen corresponding path program 1 times
[2025-03-03 18:18:43,840 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:43,840 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159076252]
[2025-03-03 18:18:43,840 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:43,840 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:43,885 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes.
[2025-03-03 18:18:44,203 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements.
[2025-03-03 18:18:44,204 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:44,204 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:44,658 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,658 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:44,658 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159076252]
[2025-03-03 18:18:44,658 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159076252] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:44,658 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:44,658 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 18:18:44,659 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555707904]
[2025-03-03 18:18:44,659 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:44,659 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 18:18:44,659 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:44,659 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 18:18:44,659 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 18:18:44,660 INFO  L87              Difference]: Start difference. First operand 326 states and 478 transitions. Second operand  has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 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,891 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:44,891 INFO  L93              Difference]: Finished difference Result 772 states and 1142 transitions.
[2025-03-03 18:18:44,891 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 18:18:44,892 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 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 159
[2025-03-03 18:18:44,892 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:44,894 INFO  L225             Difference]: With dead ends: 772
[2025-03-03 18:18:44,894 INFO  L226             Difference]: Without dead ends: 511
[2025-03-03 18:18:44,895 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:44,895 INFO  L435           NwaCegarLoop]: 351 mSDtfsCounter, 1012 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:44,896 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 1049 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 18:18:44,897 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 511 states.
[2025-03-03 18:18:44,903 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 349.
[2025-03-03 18:18:44,904 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 349 states, 348 states have (on average 1.4683908045977012) internal successors, (511), 348 states have internal predecessors, (511), 0 states have call successors, (0), 0 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,908 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 511 transitions.
[2025-03-03 18:18:44,908 INFO  L78                 Accepts]: Start accepts. Automaton has 349 states and 511 transitions. Word has length 159
[2025-03-03 18:18:44,908 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:44,908 INFO  L471      AbstractCegarLoop]: Abstraction has 349 states and 511 transitions.
[2025-03-03 18:18:44,909 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 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,909 INFO  L276                IsEmpty]: Start isEmpty. Operand 349 states and 511 transitions.
[2025-03-03 18:18:44,909 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 162
[2025-03-03 18:18:44,909 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:44,910 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,910 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 18:18:44,910 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:44,910 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:44,910 INFO  L85        PathProgramCache]: Analyzing trace with hash -51604092, now seen corresponding path program 1 times
[2025-03-03 18:18:44,910 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:44,910 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265502578]
[2025-03-03 18:18:44,910 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:44,910 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:44,951 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes.
[2025-03-03 18:18:45,177 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements.
[2025-03-03 18:18:45,177 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:45,177 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:45,759 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,760 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:45,760 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265502578]
[2025-03-03 18:18:45,760 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265502578] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:45,760 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:45,760 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 18:18:45,761 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375689775]
[2025-03-03 18:18:45,761 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:45,761 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 18:18:45,761 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:45,762 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 18:18:45,763 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 18:18:45,763 INFO  L87              Difference]: Start difference. First operand 349 states and 511 transitions. Second operand  has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 0 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,991 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:45,991 INFO  L93              Difference]: Finished difference Result 772 states and 1140 transitions.
[2025-03-03 18:18:45,991 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 18:18:45,992 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 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 161
[2025-03-03 18:18:45,992 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:45,994 INFO  L225             Difference]: With dead ends: 772
[2025-03-03 18:18:45,994 INFO  L226             Difference]: Without dead ends: 511
[2025-03-03 18:18:45,995 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,996 INFO  L435           NwaCegarLoop]: 350 mSDtfsCounter, 982 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 1048 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:45,996 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 1048 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:45,997 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 511 states.
[2025-03-03 18:18:46,006 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 400.
[2025-03-03 18:18:46,006 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 400 states, 399 states have (on average 1.468671679197995) internal successors, (586), 399 states have internal predecessors, (586), 0 states have call successors, (0), 0 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,008 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 586 transitions.
[2025-03-03 18:18:46,008 INFO  L78                 Accepts]: Start accepts. Automaton has 400 states and 586 transitions. Word has length 161
[2025-03-03 18:18:46,008 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:46,008 INFO  L471      AbstractCegarLoop]: Abstraction has 400 states and 586 transitions.
[2025-03-03 18:18:46,009 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 0 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,009 INFO  L276                IsEmpty]: Start isEmpty. Operand 400 states and 586 transitions.
[2025-03-03 18:18:46,010 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 163
[2025-03-03 18:18:46,010 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:46,010 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,010 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 18:18:46,010 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:46,011 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:46,011 INFO  L85        PathProgramCache]: Analyzing trace with hash 914758356, now seen corresponding path program 1 times
[2025-03-03 18:18:46,011 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:46,011 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461657348]
[2025-03-03 18:18:46,011 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:46,011 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:46,049 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes.
[2025-03-03 18:18:46,273 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements.
[2025-03-03 18:18:46,274 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:46,274 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:46,718 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,718 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:46,718 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461657348]
[2025-03-03 18:18:46,718 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461657348] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:46,718 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:46,718 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 18:18:46,718 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042062516]
[2025-03-03 18:18:46,719 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:46,719 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 18:18:46,719 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:46,719 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 18:18:46,719 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 18:18:46,720 INFO  L87              Difference]: Start difference. First operand 400 states and 586 transitions. Second operand  has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 0 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,949 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:46,950 INFO  L93              Difference]: Finished difference Result 772 states and 1139 transitions.
[2025-03-03 18:18:46,950 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 18:18:46,950 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 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 162
[2025-03-03 18:18:46,950 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:46,952 INFO  L225             Difference]: With dead ends: 772
[2025-03-03 18:18:46,952 INFO  L226             Difference]: Without dead ends: 511
[2025-03-03 18:18:46,952 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:46,953 INFO  L435           NwaCegarLoop]: 350 mSDtfsCounter, 965 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 1048 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:46,953 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 1048 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:46,955 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 511 states.
[2025-03-03 18:18:46,965 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 428.
[2025-03-03 18:18:46,968 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 428 states, 427 states have (on average 1.468384074941452) internal successors, (627), 427 states have internal predecessors, (627), 0 states have call successors, (0), 0 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,969 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 627 transitions.
[2025-03-03 18:18:46,970 INFO  L78                 Accepts]: Start accepts. Automaton has 428 states and 627 transitions. Word has length 162
[2025-03-03 18:18:46,970 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:46,970 INFO  L471      AbstractCegarLoop]: Abstraction has 428 states and 627 transitions.
[2025-03-03 18:18:46,970 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 0 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,970 INFO  L276                IsEmpty]: Start isEmpty. Operand 428 states and 627 transitions.
[2025-03-03 18:18:46,971 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 164
[2025-03-03 18:18:46,971 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:46,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,971 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 18:18:46,971 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:46,972 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:46,972 INFO  L85        PathProgramCache]: Analyzing trace with hash 1349351783, now seen corresponding path program 1 times
[2025-03-03 18:18:46,972 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:46,972 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466118480]
[2025-03-03 18:18:46,972 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:46,972 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:47,012 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes.
[2025-03-03 18:18:47,211 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements.
[2025-03-03 18:18:47,213 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:47,214 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:47,622 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:47,623 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:47,623 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466118480]
[2025-03-03 18:18:47,623 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466118480] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:47,623 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:47,623 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 18:18:47,623 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855699607]
[2025-03-03 18:18:47,623 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:47,623 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 18:18:47,623 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:47,624 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 18:18:47,624 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 18:18:47,624 INFO  L87              Difference]: Start difference. First operand 428 states and 627 transitions. Second operand  has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 0 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:47,852 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:47,853 INFO  L93              Difference]: Finished difference Result 772 states and 1138 transitions.
[2025-03-03 18:18:47,853 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 18:18:47,853 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 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 163
[2025-03-03 18:18:47,853 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:47,855 INFO  L225             Difference]: With dead ends: 772
[2025-03-03 18:18:47,855 INFO  L226             Difference]: Without dead ends: 511
[2025-03-03 18:18:47,856 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:47,856 INFO  L435           NwaCegarLoop]: 350 mSDtfsCounter, 948 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 1048 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:47,856 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 1048 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:47,857 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 511 states.
[2025-03-03 18:18:47,862 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 456.
[2025-03-03 18:18:47,863 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 456 states, 455 states have (on average 1.468131868131868) internal successors, (668), 455 states have internal predecessors, (668), 0 states have call successors, (0), 0 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:47,865 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 668 transitions.
[2025-03-03 18:18:47,865 INFO  L78                 Accepts]: Start accepts. Automaton has 456 states and 668 transitions. Word has length 163
[2025-03-03 18:18:47,865 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:47,865 INFO  L471      AbstractCegarLoop]: Abstraction has 456 states and 668 transitions.
[2025-03-03 18:18:47,865 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 0 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:47,865 INFO  L276                IsEmpty]: Start isEmpty. Operand 456 states and 668 transitions.
[2025-03-03 18:18:47,866 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 165
[2025-03-03 18:18:47,866 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:47,866 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,866 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-03 18:18:47,867 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:47,868 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:47,868 INFO  L85        PathProgramCache]: Analyzing trace with hash -2052595625, now seen corresponding path program 1 times
[2025-03-03 18:18:47,868 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:47,868 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148066346]
[2025-03-03 18:18:47,868 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:47,869 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:47,911 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes.
[2025-03-03 18:18:48,081 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements.
[2025-03-03 18:18:48,081 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:48,081 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:48,459 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:48,459 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:48,459 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148066346]
[2025-03-03 18:18:48,459 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148066346] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:48,459 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:48,459 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-03 18:18:48,459 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677947959]
[2025-03-03 18:18:48,459 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:48,459 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 18:18:48,459 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:48,460 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 18:18:48,460 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-03-03 18:18:48,460 INFO  L87              Difference]: Start difference. First operand 456 states and 668 transitions. Second operand  has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 0 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:48,744 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:48,744 INFO  L93              Difference]: Finished difference Result 802 states and 1181 transitions.
[2025-03-03 18:18:48,744 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-03 18:18:48,744 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 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 164
[2025-03-03 18:18:48,745 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:48,746 INFO  L225             Difference]: With dead ends: 802
[2025-03-03 18:18:48,746 INFO  L226             Difference]: Without dead ends: 519
[2025-03-03 18:18:48,746 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:48,747 INFO  L435           NwaCegarLoop]: 352 mSDtfsCounter, 983 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:48,747 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 1551 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 18:18:48,748 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 519 states.
[2025-03-03 18:18:48,753 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 458.
[2025-03-03 18:18:48,754 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 458 states, 457 states have (on average 1.4660831509846828) internal successors, (670), 457 states have internal predecessors, (670), 0 states have call successors, (0), 0 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:48,755 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 670 transitions.
[2025-03-03 18:18:48,755 INFO  L78                 Accepts]: Start accepts. Automaton has 458 states and 670 transitions. Word has length 164
[2025-03-03 18:18:48,755 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:48,755 INFO  L471      AbstractCegarLoop]: Abstraction has 458 states and 670 transitions.
[2025-03-03 18:18:48,756 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 0 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:48,756 INFO  L276                IsEmpty]: Start isEmpty. Operand 458 states and 670 transitions.
[2025-03-03 18:18:48,757 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 166
[2025-03-03 18:18:48,757 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:48,757 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,757 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 18:18:48,757 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:48,758 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:48,758 INFO  L85        PathProgramCache]: Analyzing trace with hash -1934421627, now seen corresponding path program 1 times
[2025-03-03 18:18:48,758 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:48,758 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905436024]
[2025-03-03 18:18:48,758 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:48,758 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:48,796 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes.
[2025-03-03 18:18:48,932 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements.
[2025-03-03 18:18:48,933 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:48,933 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:49,358 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:49,359 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:49,359 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905436024]
[2025-03-03 18:18:49,359 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905436024] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:49,359 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:49,359 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-03 18:18:49,359 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9694612]
[2025-03-03 18:18:49,359 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:49,359 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 18:18:49,359 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:49,360 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 18:18:49,360 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-03-03 18:18:49,360 INFO  L87              Difference]: Start difference. First operand 458 states and 670 transitions. Second operand  has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 0 states have call successors, (0), 0 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,634 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:49,634 INFO  L93              Difference]: Finished difference Result 782 states and 1151 transitions.
[2025-03-03 18:18:49,634 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-03 18:18:49,635 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 0 states have call successors, (0), 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 165
[2025-03-03 18:18:49,635 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:49,637 INFO  L225             Difference]: With dead ends: 782
[2025-03-03 18:18:49,637 INFO  L226             Difference]: Without dead ends: 521
[2025-03-03 18:18:49,637 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:49,638 INFO  L435           NwaCegarLoop]: 352 mSDtfsCounter, 966 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:49,638 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [966 Valid, 1652 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 18:18:49,639 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 521 states.
[2025-03-03 18:18:49,646 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 461.
[2025-03-03 18:18:49,647 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 461 states, 460 states have (on average 1.4652173913043478) internal successors, (674), 460 states have internal predecessors, (674), 0 states have call successors, (0), 0 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,649 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 674 transitions.
[2025-03-03 18:18:49,649 INFO  L78                 Accepts]: Start accepts. Automaton has 461 states and 674 transitions. Word has length 165
[2025-03-03 18:18:49,650 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:49,650 INFO  L471      AbstractCegarLoop]: Abstraction has 461 states and 674 transitions.
[2025-03-03 18:18:49,651 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 0 states have call successors, (0), 0 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,651 INFO  L276                IsEmpty]: Start isEmpty. Operand 461 states and 674 transitions.
[2025-03-03 18:18:49,651 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 167
[2025-03-03 18:18:49,652 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:49,652 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,652 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 18:18:49,652 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:49,652 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:49,653 INFO  L85        PathProgramCache]: Analyzing trace with hash 146747599, now seen corresponding path program 1 times
[2025-03-03 18:18:49,653 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:49,653 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887066933]
[2025-03-03 18:18:49,653 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:49,653 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:49,689 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes.
[2025-03-03 18:18:49,909 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements.
[2025-03-03 18:18:49,910 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:49,910 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:50,243 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,244 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:50,244 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887066933]
[2025-03-03 18:18:50,244 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887066933] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:50,244 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:50,244 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 18:18:50,244 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627290505]
[2025-03-03 18:18:50,244 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:50,244 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 18:18:50,244 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:50,245 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 18:18:50,245 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 18:18:50,245 INFO  L87              Difference]: Start difference. First operand 461 states and 674 transitions. Second operand  has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 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:18:50,462 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:50,463 INFO  L93              Difference]: Finished difference Result 776 states and 1141 transitions.
[2025-03-03 18:18:50,463 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 18:18:50,463 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 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 166
[2025-03-03 18:18:50,463 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:50,465 INFO  L225             Difference]: With dead ends: 776
[2025-03-03 18:18:50,465 INFO  L226             Difference]: Without dead ends: 515
[2025-03-03 18:18:50,465 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:50,466 INFO  L435           NwaCegarLoop]: 350 mSDtfsCounter, 929 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 1048 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:50,466 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 1048 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:50,466 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 515 states.
[2025-03-03 18:18:50,473 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 488.
[2025-03-03 18:18:50,474 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 488 states, 487 states have (on average 1.4640657084188913) internal successors, (713), 487 states have internal predecessors, (713), 0 states have call successors, (0), 0 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,475 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 713 transitions.
[2025-03-03 18:18:50,476 INFO  L78                 Accepts]: Start accepts. Automaton has 488 states and 713 transitions. Word has length 166
[2025-03-03 18:18:50,476 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:50,476 INFO  L471      AbstractCegarLoop]: Abstraction has 488 states and 713 transitions.
[2025-03-03 18:18:50,476 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 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:18:50,476 INFO  L276                IsEmpty]: Start isEmpty. Operand 488 states and 713 transitions.
[2025-03-03 18:18:50,477 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 168
[2025-03-03 18:18:50,477 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:50,478 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,478 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-03 18:18:50,478 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:50,478 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:50,479 INFO  L85        PathProgramCache]: Analyzing trace with hash -1617300910, now seen corresponding path program 1 times
[2025-03-03 18:18:50,479 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:50,479 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266948212]
[2025-03-03 18:18:50,479 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:50,479 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:50,516 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes.
[2025-03-03 18:18:50,691 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements.
[2025-03-03 18:18:50,691 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:50,691 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:51,018 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:51,019 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:51,019 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266948212]
[2025-03-03 18:18:51,019 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266948212] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:51,019 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:51,019 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-03 18:18:51,019 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777717798]
[2025-03-03 18:18:51,019 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:51,019 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 18:18:51,020 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:51,020 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 18:18:51,020 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-03-03 18:18:51,021 INFO  L87              Difference]: Start difference. First operand 488 states and 713 transitions. Second operand  has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 0 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:51,304 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:51,304 INFO  L93              Difference]: Finished difference Result 784 states and 1152 transitions.
[2025-03-03 18:18:51,305 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-03 18:18:51,305 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 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 167
[2025-03-03 18:18:51,305 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:51,307 INFO  L225             Difference]: With dead ends: 784
[2025-03-03 18:18:51,307 INFO  L226             Difference]: Without dead ends: 523
[2025-03-03 18:18:51,308 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:51,309 INFO  L435           NwaCegarLoop]: 352 mSDtfsCounter, 948 mSDsluCounter, 1401 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:51,309 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 1753 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 18:18:51,310 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 523 states.
[2025-03-03 18:18:51,316 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 491.
[2025-03-03 18:18:51,317 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 491 states, 490 states have (on average 1.463265306122449) internal successors, (717), 490 states have internal predecessors, (717), 0 states have call successors, (0), 0 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:51,318 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 717 transitions.
[2025-03-03 18:18:51,318 INFO  L78                 Accepts]: Start accepts. Automaton has 491 states and 717 transitions. Word has length 167
[2025-03-03 18:18:51,318 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:51,318 INFO  L471      AbstractCegarLoop]: Abstraction has 491 states and 717 transitions.
[2025-03-03 18:18:51,318 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 0 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:51,319 INFO  L276                IsEmpty]: Start isEmpty. Operand 491 states and 717 transitions.
[2025-03-03 18:18:51,319 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 169
[2025-03-03 18:18:51,319 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:51,320 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,320 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-03 18:18:51,320 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:51,321 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:51,321 INFO  L85        PathProgramCache]: Analyzing trace with hash 538502325, now seen corresponding path program 1 times
[2025-03-03 18:18:51,321 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:51,321 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691846988]
[2025-03-03 18:18:51,321 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:51,321 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:51,355 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes.
[2025-03-03 18:18:51,573 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements.
[2025-03-03 18:18:51,573 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:51,573 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:51,908 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:51,908 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:51,908 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691846988]
[2025-03-03 18:18:51,908 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691846988] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:51,908 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:51,908 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 18:18:51,908 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136883291]
[2025-03-03 18:18:51,908 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:51,909 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 18:18:51,909 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:51,910 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 18:18:51,910 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 18:18:51,910 INFO  L87              Difference]: Start difference. First operand 491 states and 717 transitions. Second operand  has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 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:52,118 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:52,119 INFO  L93              Difference]: Finished difference Result 781 states and 1147 transitions.
[2025-03-03 18:18:52,119 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 18:18:52,119 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 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 168
[2025-03-03 18:18:52,119 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:52,121 INFO  L225             Difference]: With dead ends: 781
[2025-03-03 18:18:52,121 INFO  L226             Difference]: Without dead ends: 520
[2025-03-03 18:18:52,122 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:52,123 INFO  L435           NwaCegarLoop]: 350 mSDtfsCounter, 917 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:52,123 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 1045 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 18:18:52,124 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 520 states.
[2025-03-03 18:18:52,130 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 518.
[2025-03-03 18:18:52,131 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 518 states, 517 states have (on average 1.4622823984526112) internal successors, (756), 517 states have internal predecessors, (756), 0 states have call successors, (0), 0 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:52,132 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 756 transitions.
[2025-03-03 18:18:52,132 INFO  L78                 Accepts]: Start accepts. Automaton has 518 states and 756 transitions. Word has length 168
[2025-03-03 18:18:52,132 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:52,132 INFO  L471      AbstractCegarLoop]: Abstraction has 518 states and 756 transitions.
[2025-03-03 18:18:52,132 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 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:52,133 INFO  L276                IsEmpty]: Start isEmpty. Operand 518 states and 756 transitions.
[2025-03-03 18:18:52,133 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 170
[2025-03-03 18:18:52,133 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:52,133 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,134 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-03 18:18:52,134 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:52,134 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:52,134 INFO  L85        PathProgramCache]: Analyzing trace with hash -836783921, now seen corresponding path program 1 times
[2025-03-03 18:18:52,134 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:52,134 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368235419]
[2025-03-03 18:18:52,134 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:52,134 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:52,170 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes.
[2025-03-03 18:18:52,358 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements.
[2025-03-03 18:18:52,358 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:52,358 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:52,673 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:52,674 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:52,674 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368235419]
[2025-03-03 18:18:52,674 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368235419] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:52,674 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:52,674 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-03 18:18:52,674 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030732509]
[2025-03-03 18:18:52,674 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:52,675 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 18:18:52,675 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:52,675 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 18:18:52,675 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-03-03 18:18:52,675 INFO  L87              Difference]: Start difference. First operand 518 states and 756 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:18:52,949 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:52,949 INFO  L93              Difference]: Finished difference Result 786 states and 1153 transitions.
[2025-03-03 18:18:52,950 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-03 18:18:52,950 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 169
[2025-03-03 18:18:52,950 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:52,952 INFO  L225             Difference]: With dead ends: 786
[2025-03-03 18:18:52,952 INFO  L226             Difference]: Without dead ends: 525
[2025-03-03 18:18:52,953 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:52,954 INFO  L435           NwaCegarLoop]: 352 mSDtfsCounter, 925 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:52,954 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 1750 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 18:18:52,955 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 525 states.
[2025-03-03 18:18:52,960 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 521.
[2025-03-03 18:18:52,961 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 521 states, 520 states have (on average 1.4615384615384615) internal successors, (760), 520 states have internal predecessors, (760), 0 states have call successors, (0), 0 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:52,962 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 760 transitions.
[2025-03-03 18:18:52,963 INFO  L78                 Accepts]: Start accepts. Automaton has 521 states and 760 transitions. Word has length 169
[2025-03-03 18:18:52,963 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:52,963 INFO  L471      AbstractCegarLoop]: Abstraction has 521 states and 760 transitions.
[2025-03-03 18:18:52,963 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:18:52,963 INFO  L276                IsEmpty]: Start isEmpty. Operand 521 states and 760 transitions.
[2025-03-03 18:18:52,964 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2025-03-03 18:18:52,964 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:52,964 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,965 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-03 18:18:52,965 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:52,965 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:52,965 INFO  L85        PathProgramCache]: Analyzing trace with hash -240840149, now seen corresponding path program 1 times
[2025-03-03 18:18:52,965 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:52,965 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369817856]
[2025-03-03 18:18:52,965 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:52,966 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:53,006 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes.
[2025-03-03 18:18:53,218 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements.
[2025-03-03 18:18:53,219 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:53,219 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:53,478 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:53,480 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:53,480 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369817856]
[2025-03-03 18:18:53,481 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369817856] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:53,481 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:53,481 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 18:18:53,481 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406121921]
[2025-03-03 18:18:53,481 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:53,481 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 18:18:53,481 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:53,481 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 18:18:53,481 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 18:18:53,482 INFO  L87              Difference]: Start difference. First operand 521 states and 760 transitions. Second operand  has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 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:53,698 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:53,698 INFO  L93              Difference]: Finished difference Result 901 states and 1318 transitions.
[2025-03-03 18:18:53,698 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 18:18:53,699 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 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 170
[2025-03-03 18:18:53,699 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:53,700 INFO  L225             Difference]: With dead ends: 901
[2025-03-03 18:18:53,700 INFO  L226             Difference]: Without dead ends: 521
[2025-03-03 18:18:53,701 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:53,701 INFO  L435           NwaCegarLoop]: 351 mSDtfsCounter, 973 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:53,701 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 1049 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 18:18:53,702 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 521 states.
[2025-03-03 18:18:53,707 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521.
[2025-03-03 18:18:53,707 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 521 states, 520 states have (on average 1.4596153846153845) internal successors, (759), 520 states have internal predecessors, (759), 0 states have call successors, (0), 0 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:53,708 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 759 transitions.
[2025-03-03 18:18:53,709 INFO  L78                 Accepts]: Start accepts. Automaton has 521 states and 759 transitions. Word has length 170
[2025-03-03 18:18:53,709 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:53,709 INFO  L471      AbstractCegarLoop]: Abstraction has 521 states and 759 transitions.
[2025-03-03 18:18:53,709 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 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:53,709 INFO  L276                IsEmpty]: Start isEmpty. Operand 521 states and 759 transitions.
[2025-03-03 18:18:53,710 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 172
[2025-03-03 18:18:53,710 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:53,710 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,710 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-03 18:18:53,710 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:53,711 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:53,711 INFO  L85        PathProgramCache]: Analyzing trace with hash 1606676561, now seen corresponding path program 1 times
[2025-03-03 18:18:53,711 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:53,711 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866182281]
[2025-03-03 18:18:53,711 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:53,711 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:53,741 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes.
[2025-03-03 18:18:53,949 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements.
[2025-03-03 18:18:53,949 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:53,949 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:54,431 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:18:54,431 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:54,431 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866182281]
[2025-03-03 18:18:54,432 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866182281] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:18:54,432 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326677477]
[2025-03-03 18:18:54,432 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:54,432 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:18:54,432 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:18:54,434 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:54,435 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:54,697 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes.
[2025-03-03 18:18:54,808 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements.
[2025-03-03 18:18:54,808 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:54,808 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:54,815 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 28 conjuncts are in the unsatisfiable core
[2025-03-03 18:18:54,824 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 18:18:55,050 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:55,051 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 18:18:55,051 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326677477] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:55,051 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 18:18:55,051 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13
[2025-03-03 18:18:55,051 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879337409]
[2025-03-03 18:18:55,051 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:55,052 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 18:18:55,052 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:55,053 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 18:18:55,053 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156
[2025-03-03 18:18:55,053 INFO  L87              Difference]: Start difference. First operand 521 states and 759 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:18:55,432 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:55,433 INFO  L93              Difference]: Finished difference Result 973 states and 1421 transitions.
[2025-03-03 18:18:55,433 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-03 18:18:55,433 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 171
[2025-03-03 18:18:55,433 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:55,435 INFO  L225             Difference]: With dead ends: 973
[2025-03-03 18:18:55,435 INFO  L226             Difference]: Without dead ends: 520
[2025-03-03 18:18:55,436 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272
[2025-03-03 18:18:55,437 INFO  L435           NwaCegarLoop]: 307 mSDtfsCounter, 1005 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:55,437 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 1525 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 18:18:55,437 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 520 states.
[2025-03-03 18:18:55,444 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520.
[2025-03-03 18:18:55,445 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 520 states, 519 states have (on average 1.4566473988439306) internal successors, (756), 519 states have internal predecessors, (756), 0 states have call successors, (0), 0 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:55,446 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 756 transitions.
[2025-03-03 18:18:55,446 INFO  L78                 Accepts]: Start accepts. Automaton has 520 states and 756 transitions. Word has length 171
[2025-03-03 18:18:55,446 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:55,446 INFO  L471      AbstractCegarLoop]: Abstraction has 520 states and 756 transitions.
[2025-03-03 18:18:55,446 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:18:55,447 INFO  L276                IsEmpty]: Start isEmpty. Operand 520 states and 756 transitions.
[2025-03-03 18:18:55,447 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 173
[2025-03-03 18:18:55,447 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:55,448 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,457 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-03-03 18:18:55,652 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,SelfDestructingSolverStorable16
[2025-03-03 18:18:55,652 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:55,652 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:55,653 INFO  L85        PathProgramCache]: Analyzing trace with hash -1511480607, now seen corresponding path program 1 times
[2025-03-03 18:18:55,653 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:55,653 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109354799]
[2025-03-03 18:18:55,653 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:55,653 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:55,686 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes.
[2025-03-03 18:18:55,899 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements.
[2025-03-03 18:18:55,899 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:55,899 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:56,143 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:56,143 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:56,143 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109354799]
[2025-03-03 18:18:56,143 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109354799] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:18:56,143 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:18:56,143 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 18:18:56,144 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847522150]
[2025-03-03 18:18:56,144 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:18:56,144 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 18:18:56,144 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:56,144 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 18:18:56,144 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 18:18:56,145 INFO  L87              Difference]: Start difference. First operand 520 states and 756 transitions. Second operand  has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 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:56,365 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:18:56,365 INFO  L93              Difference]: Finished difference Result 868 states and 1268 transitions.
[2025-03-03 18:18:56,365 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 18:18:56,366 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 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 172
[2025-03-03 18:18:56,366 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:18:56,367 INFO  L225             Difference]: With dead ends: 868
[2025-03-03 18:18:56,367 INFO  L226             Difference]: Without dead ends: 518
[2025-03-03 18:18:56,368 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:56,368 INFO  L435           NwaCegarLoop]: 351 mSDtfsCounter, 948 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 18:18:56,368 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 1049 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 18:18:56,369 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 518 states.
[2025-03-03 18:18:56,373 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518.
[2025-03-03 18:18:56,374 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 518 states, 517 states have (on average 1.4564796905222437) internal successors, (753), 517 states have internal predecessors, (753), 0 states have call successors, (0), 0 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:56,375 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 753 transitions.
[2025-03-03 18:18:56,375 INFO  L78                 Accepts]: Start accepts. Automaton has 518 states and 753 transitions. Word has length 172
[2025-03-03 18:18:56,375 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:18:56,375 INFO  L471      AbstractCegarLoop]: Abstraction has 518 states and 753 transitions.
[2025-03-03 18:18:56,376 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 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:56,376 INFO  L276                IsEmpty]: Start isEmpty. Operand 518 states and 753 transitions.
[2025-03-03 18:18:56,377 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 173
[2025-03-03 18:18:56,377 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:18:56,377 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,377 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-03 18:18:56,377 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:18:56,377 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:18:56,377 INFO  L85        PathProgramCache]: Analyzing trace with hash 86181634, now seen corresponding path program 1 times
[2025-03-03 18:18:56,377 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:18:56,378 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980967398]
[2025-03-03 18:18:56,378 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:56,378 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:18:56,410 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes.
[2025-03-03 18:18:56,625 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements.
[2025-03-03 18:18:56,626 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:56,626 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:57,434 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:57,435 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:18:57,435 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980967398]
[2025-03-03 18:18:57,435 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980967398] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:18:57,435 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153164136]
[2025-03-03 18:18:57,435 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:18:57,435 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:18:57,435 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:18:57,438 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:57,439 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:57,716 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes.
[2025-03-03 18:18:57,899 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements.
[2025-03-03 18:18:57,900 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:18:57,900 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:18:57,905 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 65 conjuncts are in the unsatisfiable core
[2025-03-03 18:18:57,915 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 18:18:58,597 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:58,598 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 18:18:59,316 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:59,316 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153164136] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 18:18:59,316 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 18:18:59,316 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 12] total 33
[2025-03-03 18:18:59,316 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624123113]
[2025-03-03 18:18:59,316 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 18:18:59,317 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2025-03-03 18:18:59,317 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:18:59,317 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2025-03-03 18:18:59,319 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=925, Unknown=0, NotChecked=0, Total=1056
[2025-03-03 18:18:59,319 INFO  L87              Difference]: Start difference. First operand 518 states and 753 transitions. Second operand  has 33 states, 33 states have (on average 15.212121212121213) internal successors, (502), 33 states have internal predecessors, (502), 0 states have call successors, (0), 0 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:01,009 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:01,009 INFO  L93              Difference]: Finished difference Result 1752 states and 2563 transitions.
[2025-03-03 18:19:01,010 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. 
[2025-03-03 18:19:01,010 INFO  L78                 Accepts]: Start accepts. Automaton has  has 33 states, 33 states have (on average 15.212121212121213) internal successors, (502), 33 states have internal predecessors, (502), 0 states have call successors, (0), 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 172
[2025-03-03 18:19:01,010 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:01,013 INFO  L225             Difference]: With dead ends: 1752
[2025-03-03 18:19:01,014 INFO  L226             Difference]: Without dead ends: 1293
[2025-03-03 18:19:01,015 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 875 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=568, Invalid=2854, Unknown=0, NotChecked=0, Total=3422
[2025-03-03 18:19:01,016 INFO  L435           NwaCegarLoop]: 291 mSDtfsCounter, 10848 mSDsluCounter, 5721 mSDsCounter, 0 mSdLazyCounter, 2954 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10848 SdHoareTripleChecker+Valid, 6012 SdHoareTripleChecker+Invalid, 2964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:01,016 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [10848 Valid, 6012 Invalid, 2964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2954 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-03 18:19:01,017 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1293 states.
[2025-03-03 18:19:01,028 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 964.
[2025-03-03 18:19:01,029 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 964 states, 963 states have (on average 1.4548286604361371) internal successors, (1401), 963 states have internal predecessors, (1401), 0 states have call successors, (0), 0 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:01,031 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1401 transitions.
[2025-03-03 18:19:01,031 INFO  L78                 Accepts]: Start accepts. Automaton has 964 states and 1401 transitions. Word has length 172
[2025-03-03 18:19:01,031 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:01,031 INFO  L471      AbstractCegarLoop]: Abstraction has 964 states and 1401 transitions.
[2025-03-03 18:19:01,031 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 33 states, 33 states have (on average 15.212121212121213) internal successors, (502), 33 states have internal predecessors, (502), 0 states have call successors, (0), 0 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:01,031 INFO  L276                IsEmpty]: Start isEmpty. Operand 964 states and 1401 transitions.
[2025-03-03 18:19:01,032 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 174
[2025-03-03 18:19:01,032 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:01,033 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,042 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:19:01,237 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:01,237 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:19:01,238 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:19:01,238 INFO  L85        PathProgramCache]: Analyzing trace with hash 795089613, now seen corresponding path program 1 times
[2025-03-03 18:19:01,238 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:19:01,238 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687169585]
[2025-03-03 18:19:01,238 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:01,238 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:19:01,272 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes.
[2025-03-03 18:19:01,356 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements.
[2025-03-03 18:19:01,356 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:01,356 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:01,561 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:19:01,561 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:01,561 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687169585]
[2025-03-03 18:19:01,561 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687169585] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:19:01,561 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:19:01,562 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-03 18:19:01,562 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74962720]
[2025-03-03 18:19:01,562 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:19:01,563 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 18:19:01,563 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:19:01,563 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 18:19:01,563 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-03-03 18:19:01,564 INFO  L87              Difference]: Start difference. First operand 964 states and 1401 transitions. Second operand  has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 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:01,778 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:01,778 INFO  L93              Difference]: Finished difference Result 1904 states and 2771 transitions.
[2025-03-03 18:19:01,779 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-03 18:19:01,779 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 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 173
[2025-03-03 18:19:01,779 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:01,781 INFO  L225             Difference]: With dead ends: 1904
[2025-03-03 18:19:01,781 INFO  L226             Difference]: Without dead ends: 991
[2025-03-03 18:19:01,782 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-03-03 18:19:01,784 INFO  L435           NwaCegarLoop]: 360 mSDtfsCounter, 5 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2147 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:01,784 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2147 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 18:19:01,788 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 991 states.
[2025-03-03 18:19:01,796 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991.
[2025-03-03 18:19:01,797 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 991 states, 990 states have (on average 1.4505050505050505) internal successors, (1436), 990 states have internal predecessors, (1436), 0 states have call successors, (0), 0 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:01,798 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1436 transitions.
[2025-03-03 18:19:01,798 INFO  L78                 Accepts]: Start accepts. Automaton has 991 states and 1436 transitions. Word has length 173
[2025-03-03 18:19:01,798 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:01,799 INFO  L471      AbstractCegarLoop]: Abstraction has 991 states and 1436 transitions.
[2025-03-03 18:19:01,799 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 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:01,799 INFO  L276                IsEmpty]: Start isEmpty. Operand 991 states and 1436 transitions.
[2025-03-03 18:19:01,800 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 174
[2025-03-03 18:19:01,800 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:01,800 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,800 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-03-03 18:19:01,800 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:19:01,801 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:19:01,801 INFO  L85        PathProgramCache]: Analyzing trace with hash 387275400, now seen corresponding path program 1 times
[2025-03-03 18:19:01,801 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:19:01,801 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887320063]
[2025-03-03 18:19:01,801 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:01,801 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:19:01,833 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes.
[2025-03-03 18:19:01,867 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements.
[2025-03-03 18:19:01,867 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:01,867 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:02,034 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:19:02,034 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:02,035 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887320063]
[2025-03-03 18:19:02,035 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887320063] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:19:02,035 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:19:02,035 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 18:19:02,036 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112204658]
[2025-03-03 18:19:02,036 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:19:02,036 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 18:19:02,036 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:19:02,036 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 18:19:02,036 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-03 18:19:02,037 INFO  L87              Difference]: Start difference. First operand 991 states and 1436 transitions. Second operand  has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 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:02,192 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:02,192 INFO  L93              Difference]: Finished difference Result 1478 states and 2143 transitions.
[2025-03-03 18:19:02,193 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 18:19:02,193 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 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 173
[2025-03-03 18:19:02,193 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:02,195 INFO  L225             Difference]: With dead ends: 1478
[2025-03-03 18:19:02,195 INFO  L226             Difference]: Without dead ends: 1001
[2025-03-03 18:19:02,196 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:19:02,196 INFO  L435           NwaCegarLoop]: 355 mSDtfsCounter, 1033 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:02,196 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 1060 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 18:19:02,197 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1001 states.
[2025-03-03 18:19:02,205 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 981.
[2025-03-03 18:19:02,206 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 981 states, 980 states have (on average 1.4489795918367347) internal successors, (1420), 980 states have internal predecessors, (1420), 0 states have call successors, (0), 0 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,207 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1420 transitions.
[2025-03-03 18:19:02,208 INFO  L78                 Accepts]: Start accepts. Automaton has 981 states and 1420 transitions. Word has length 173
[2025-03-03 18:19:02,208 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:02,208 INFO  L471      AbstractCegarLoop]: Abstraction has 981 states and 1420 transitions.
[2025-03-03 18:19:02,208 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 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:02,208 INFO  L276                IsEmpty]: Start isEmpty. Operand 981 states and 1420 transitions.
[2025-03-03 18:19:02,209 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 175
[2025-03-03 18:19:02,210 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:02,210 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,210 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-03-03 18:19:02,210 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:19:02,210 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:19:02,210 INFO  L85        PathProgramCache]: Analyzing trace with hash -1486644628, now seen corresponding path program 1 times
[2025-03-03 18:19:02,210 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:19:02,210 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064515439]
[2025-03-03 18:19:02,210 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:02,211 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:19:02,254 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes.
[2025-03-03 18:19:02,291 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements.
[2025-03-03 18:19:02,292 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:02,292 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:02,441 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:19:02,441 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:02,441 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064515439]
[2025-03-03 18:19:02,442 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064515439] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:19:02,442 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:19:02,442 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 18:19:02,442 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606439904]
[2025-03-03 18:19:02,442 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:19:02,443 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 18:19:02,443 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:19:02,443 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 18:19:02,443 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 18:19:02,443 INFO  L87              Difference]: Start difference. First operand 981 states and 1420 transitions. Second operand  has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 0 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,585 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:02,585 INFO  L93              Difference]: Finished difference Result 1939 states and 2810 transitions.
[2025-03-03 18:19:02,587 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 18:19:02,588 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 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 174
[2025-03-03 18:19:02,588 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:02,590 INFO  L225             Difference]: With dead ends: 1939
[2025-03-03 18:19:02,590 INFO  L226             Difference]: Without dead ends: 1014
[2025-03-03 18:19:02,591 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:02,592 INFO  L435           NwaCegarLoop]: 355 mSDtfsCounter, 1051 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1051 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:02,592 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1051 Valid, 1061 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 18:19:02,593 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1014 states.
[2025-03-03 18:19:02,600 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 978.
[2025-03-03 18:19:02,601 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 978 states, 977 states have (on average 1.4472876151484135) internal successors, (1414), 977 states have internal predecessors, (1414), 0 states have call successors, (0), 0 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,602 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1414 transitions.
[2025-03-03 18:19:02,602 INFO  L78                 Accepts]: Start accepts. Automaton has 978 states and 1414 transitions. Word has length 174
[2025-03-03 18:19:02,603 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:02,603 INFO  L471      AbstractCegarLoop]: Abstraction has 978 states and 1414 transitions.
[2025-03-03 18:19:02,603 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 0 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,603 INFO  L276                IsEmpty]: Start isEmpty. Operand 978 states and 1414 transitions.
[2025-03-03 18:19:02,604 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 175
[2025-03-03 18:19:02,604 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:02,604 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,604 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-03-03 18:19:02,604 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:19:02,605 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:19:02,605 INFO  L85        PathProgramCache]: Analyzing trace with hash -1497630831, now seen corresponding path program 1 times
[2025-03-03 18:19:02,605 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:19:02,605 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856518337]
[2025-03-03 18:19:02,605 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:02,605 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:19:02,635 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes.
[2025-03-03 18:19:02,669 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements.
[2025-03-03 18:19:02,670 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:02,670 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:02,819 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:19:02,819 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:02,819 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856518337]
[2025-03-03 18:19:02,819 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856518337] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:19:02,820 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:19:02,820 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 18:19:02,820 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961773908]
[2025-03-03 18:19:02,820 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:19:02,820 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 18:19:02,820 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:19:02,821 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 18:19:02,821 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 18:19:02,821 INFO  L87              Difference]: Start difference. First operand 978 states and 1414 transitions. Second operand  has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 0 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,991 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:02,991 INFO  L93              Difference]: Finished difference Result 1728 states and 2510 transitions.
[2025-03-03 18:19:02,991 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 18:19:02,992 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 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 174
[2025-03-03 18:19:02,992 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:02,993 INFO  L225             Difference]: With dead ends: 1728
[2025-03-03 18:19:02,993 INFO  L226             Difference]: Without dead ends: 802
[2025-03-03 18:19:02,994 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:02,994 INFO  L435           NwaCegarLoop]: 353 mSDtfsCounter, 1069 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:02,994 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 1054 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 18:19:02,995 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 802 states.
[2025-03-03 18:19:03,001 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 772.
[2025-03-03 18:19:03,002 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 772 states, 771 states have (on average 1.4552529182879377) internal successors, (1122), 771 states have internal predecessors, (1122), 0 states have call successors, (0), 0 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:03,004 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1122 transitions.
[2025-03-03 18:19:03,004 INFO  L78                 Accepts]: Start accepts. Automaton has 772 states and 1122 transitions. Word has length 174
[2025-03-03 18:19:03,004 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:03,004 INFO  L471      AbstractCegarLoop]: Abstraction has 772 states and 1122 transitions.
[2025-03-03 18:19:03,004 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 0 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:03,004 INFO  L276                IsEmpty]: Start isEmpty. Operand 772 states and 1122 transitions.
[2025-03-03 18:19:03,005 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 303
[2025-03-03 18:19:03,005 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:03,006 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1]
[2025-03-03 18:19:03,006 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-03-03 18:19:03,006 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:19:03,006 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:19:03,006 INFO  L85        PathProgramCache]: Analyzing trace with hash -128551752, now seen corresponding path program 1 times
[2025-03-03 18:19:03,006 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:19:03,006 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525398179]
[2025-03-03 18:19:03,007 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:03,007 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:19:03,058 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes.
[2025-03-03 18:19:04,063 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements.
[2025-03-03 18:19:04,063 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:04,063 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:05,119 INFO  L134       CoverageAnalysis]: Checked inductivity of 141 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:05,120 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:05,120 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525398179]
[2025-03-03 18:19:05,120 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525398179] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:19:05,120 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:19:05,120 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-03 18:19:05,120 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354279851]
[2025-03-03 18:19:05,120 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:19:05,120 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-03 18:19:05,120 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:19:05,121 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-03 18:19:05,121 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2025-03-03 18:19:05,121 INFO  L87              Difference]: Start difference. First operand 772 states and 1122 transitions. Second operand  has 9 states, 9 states have (on average 33.55555555555556) internal successors, (302), 9 states have internal predecessors, (302), 0 states have call successors, (0), 0 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,710 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:05,710 INFO  L93              Difference]: Finished difference Result 2686 states and 3966 transitions.
[2025-03-03 18:19:05,710 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-03-03 18:19:05,710 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 33.55555555555556) internal successors, (302), 9 states have internal predecessors, (302), 0 states have call successors, (0), 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 302
[2025-03-03 18:19:05,710 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:05,715 INFO  L225             Difference]: With dead ends: 2686
[2025-03-03 18:19:05,715 INFO  L226             Difference]: Without dead ends: 2161
[2025-03-03 18:19:05,716 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156
[2025-03-03 18:19:05,717 INFO  L435           NwaCegarLoop]: 592 mSDtfsCounter, 1520 mSDsluCounter, 3181 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 3773 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:05,717 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 3773 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 18:19:05,718 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2161 states.
[2025-03-03 18:19:05,733 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2161 to 1287.
[2025-03-03 18:19:05,735 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1287 states, 1286 states have (on average 1.464230171073095) internal successors, (1883), 1286 states have internal predecessors, (1883), 0 states have call successors, (0), 0 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,736 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1883 transitions.
[2025-03-03 18:19:05,736 INFO  L78                 Accepts]: Start accepts. Automaton has 1287 states and 1883 transitions. Word has length 302
[2025-03-03 18:19:05,736 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:05,736 INFO  L471      AbstractCegarLoop]: Abstraction has 1287 states and 1883 transitions.
[2025-03-03 18:19:05,736 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 33.55555555555556) internal successors, (302), 9 states have internal predecessors, (302), 0 states have call successors, (0), 0 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,737 INFO  L276                IsEmpty]: Start isEmpty. Operand 1287 states and 1883 transitions.
[2025-03-03 18:19:05,738 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 304
[2025-03-03 18:19:05,739 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:05,739 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:19:05,739 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-03-03 18:19:05,739 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:19:05,740 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:19:05,740 INFO  L85        PathProgramCache]: Analyzing trace with hash -525312005, now seen corresponding path program 1 times
[2025-03-03 18:19:05,740 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:19:05,740 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871266745]
[2025-03-03 18:19:05,740 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:05,740 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:19:05,813 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes.
[2025-03-03 18:19:06,090 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements.
[2025-03-03 18:19:06,090 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:06,090 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:06,992 INFO  L134       CoverageAnalysis]: Checked inductivity of 141 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:06,992 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:06,992 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871266745]
[2025-03-03 18:19:06,992 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871266745] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:19:06,992 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:19:06,992 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-03 18:19:06,992 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495308499]
[2025-03-03 18:19:06,992 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:19:06,992 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 18:19:06,992 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:19:06,993 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 18:19:06,993 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-03 18:19:06,993 INFO  L87              Difference]: Start difference. First operand 1287 states and 1883 transitions. Second operand  has 7 states, 7 states have (on average 43.285714285714285) internal successors, (303), 7 states have internal predecessors, (303), 0 states have call successors, (0), 0 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,517 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:07,517 INFO  L93              Difference]: Finished difference Result 3254 states and 4802 transitions.
[2025-03-03 18:19:07,518 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-03 18:19:07,518 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 43.285714285714285) internal successors, (303), 7 states have internal predecessors, (303), 0 states have call successors, (0), 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 303
[2025-03-03 18:19:07,518 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:07,522 INFO  L225             Difference]: With dead ends: 3254
[2025-03-03 18:19:07,522 INFO  L226             Difference]: Without dead ends: 2214
[2025-03-03 18:19:07,523 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2025-03-03 18:19:07,523 INFO  L435           NwaCegarLoop]: 833 mSDtfsCounter, 1557 mSDsluCounter, 2310 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1557 SdHoareTripleChecker+Valid, 3143 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:07,523 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1557 Valid, 3143 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 18:19:07,524 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2214 states.
[2025-03-03 18:19:07,535 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 1309.
[2025-03-03 18:19:07,537 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1309 states, 1308 states have (on average 1.459480122324159) internal successors, (1909), 1308 states have internal predecessors, (1909), 0 states have call successors, (0), 0 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,538 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 1909 transitions.
[2025-03-03 18:19:07,538 INFO  L78                 Accepts]: Start accepts. Automaton has 1309 states and 1909 transitions. Word has length 303
[2025-03-03 18:19:07,538 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:07,538 INFO  L471      AbstractCegarLoop]: Abstraction has 1309 states and 1909 transitions.
[2025-03-03 18:19:07,538 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 43.285714285714285) internal successors, (303), 7 states have internal predecessors, (303), 0 states have call successors, (0), 0 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,539 INFO  L276                IsEmpty]: Start isEmpty. Operand 1309 states and 1909 transitions.
[2025-03-03 18:19:07,540 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 305
[2025-03-03 18:19:07,540 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:07,541 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:19:07,541 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2025-03-03 18:19:07,541 INFO  L396      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:19:07,541 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:19:07,541 INFO  L85        PathProgramCache]: Analyzing trace with hash -756366818, now seen corresponding path program 1 times
[2025-03-03 18:19:07,541 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:19:07,542 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874295982]
[2025-03-03 18:19:07,542 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:07,542 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:19:07,594 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes.
[2025-03-03 18:19:08,646 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements.
[2025-03-03 18:19:08,646 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:08,646 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:09,028 INFO  L134       CoverageAnalysis]: Checked inductivity of 141 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2025-03-03 18:19:09,029 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:09,029 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874295982]
[2025-03-03 18:19:09,029 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874295982] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:19:09,029 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:19:09,029 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-03 18:19:09,029 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471552261]
[2025-03-03 18:19:09,029 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:19:09,029 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 18:19:09,029 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:19:09,030 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 18:19:09,030 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-03 18:19:09,030 INFO  L87              Difference]: Start difference. First operand 1309 states and 1909 transitions. Second operand  has 7 states, 7 states have (on average 42.57142857142857) internal successors, (298), 7 states have internal predecessors, (298), 0 states have call successors, (0), 0 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:09,268 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:09,269 INFO  L93              Difference]: Finished difference Result 2391 states and 3504 transitions.
[2025-03-03 18:19:09,269 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-03 18:19:09,269 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 42.57142857142857) internal successors, (298), 7 states have internal predecessors, (298), 0 states have call successors, (0), 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 304
[2025-03-03 18:19:09,269 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:09,272 INFO  L225             Difference]: With dead ends: 2391
[2025-03-03 18:19:09,272 INFO  L226             Difference]: Without dead ends: 1329
[2025-03-03 18:19:09,273 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-03 18:19:09,274 INFO  L435           NwaCegarLoop]: 318 mSDtfsCounter, 287 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:09,274 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 1579 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 18:19:09,275 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1329 states.
[2025-03-03 18:19:09,286 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1329.
[2025-03-03 18:19:09,287 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1329 states, 1328 states have (on average 1.4555722891566265) internal successors, (1933), 1328 states have internal predecessors, (1933), 0 states have call successors, (0), 0 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:09,289 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1933 transitions.
[2025-03-03 18:19:09,289 INFO  L78                 Accepts]: Start accepts. Automaton has 1329 states and 1933 transitions. Word has length 304
[2025-03-03 18:19:09,289 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:09,289 INFO  L471      AbstractCegarLoop]: Abstraction has 1329 states and 1933 transitions.
[2025-03-03 18:19:09,289 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 42.57142857142857) internal successors, (298), 7 states have internal predecessors, (298), 0 states have call successors, (0), 0 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:09,290 INFO  L276                IsEmpty]: Start isEmpty. Operand 1329 states and 1933 transitions.
[2025-03-03 18:19:09,291 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 305
[2025-03-03 18:19:09,291 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:09,292 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1]
[2025-03-03 18:19:09,292 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2025-03-03 18:19:09,292 INFO  L396      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:19:09,292 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:19:09,292 INFO  L85        PathProgramCache]: Analyzing trace with hash -2134729891, now seen corresponding path program 1 times
[2025-03-03 18:19:09,292 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:19:09,293 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505315514]
[2025-03-03 18:19:09,293 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:09,293 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:19:09,342 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes.
[2025-03-03 18:19:10,260 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements.
[2025-03-03 18:19:10,260 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:10,260 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:11,256 INFO  L134       CoverageAnalysis]: Checked inductivity of 142 backedges. 140 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:11,256 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:11,256 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505315514]
[2025-03-03 18:19:11,256 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505315514] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:19:11,256 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263099509]
[2025-03-03 18:19:11,256 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:11,256 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:11,256 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:19:11,260 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:19:11,261 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:19:11,661 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes.
[2025-03-03 18:19:11,881 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements.
[2025-03-03 18:19:11,881 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:11,881 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:11,890 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2008 conjuncts, 58 conjuncts are in the unsatisfiable core
[2025-03-03 18:19:11,896 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 18:19:12,352 INFO  L134       CoverageAnalysis]: Checked inductivity of 142 backedges. 134 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:12,352 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 18:19:13,549 INFO  L134       CoverageAnalysis]: Checked inductivity of 142 backedges. 134 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:13,549 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263099509] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 18:19:13,549 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 18:19:13,550 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 29
[2025-03-03 18:19:13,550 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310704095]
[2025-03-03 18:19:13,550 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 18:19:13,550 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2025-03-03 18:19:13,550 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:19:13,551 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2025-03-03 18:19:13,551 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812
[2025-03-03 18:19:13,551 INFO  L87              Difference]: Start difference. First operand 1329 states and 1933 transitions. Second operand  has 29 states, 29 states have (on average 22.82758620689655) internal successors, (662), 29 states have internal predecessors, (662), 0 states have call successors, (0), 0 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,338 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:18,338 INFO  L93              Difference]: Finished difference Result 11962 states and 17634 transitions.
[2025-03-03 18:19:18,339 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. 
[2025-03-03 18:19:18,339 INFO  L78                 Accepts]: Start accepts. Automaton has  has 29 states, 29 states have (on average 22.82758620689655) internal successors, (662), 29 states have internal predecessors, (662), 0 states have call successors, (0), 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 304
[2025-03-03 18:19:18,339 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:18,358 INFO  L225             Difference]: With dead ends: 11962
[2025-03-03 18:19:18,358 INFO  L226             Difference]: Without dead ends: 10733
[2025-03-03 18:19:18,362 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 590 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5292 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2663, Invalid=14107, Unknown=0, NotChecked=0, Total=16770
[2025-03-03 18:19:18,362 INFO  L435           NwaCegarLoop]: 574 mSDtfsCounter, 16198 mSDsluCounter, 7969 mSDsCounter, 0 mSdLazyCounter, 3601 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16198 SdHoareTripleChecker+Valid, 8543 SdHoareTripleChecker+Invalid, 3609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 3601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:18,362 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [16198 Valid, 8543 Invalid, 3609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 3601 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-03-03 18:19:18,367 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10733 states.
[2025-03-03 18:19:18,403 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10733 to 2335.
[2025-03-03 18:19:18,404 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2335 states, 2334 states have (on average 1.443873179091688) internal successors, (3370), 2334 states have internal predecessors, (3370), 0 states have call successors, (0), 0 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,407 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 3370 transitions.
[2025-03-03 18:19:18,407 INFO  L78                 Accepts]: Start accepts. Automaton has 2335 states and 3370 transitions. Word has length 304
[2025-03-03 18:19:18,407 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:18,407 INFO  L471      AbstractCegarLoop]: Abstraction has 2335 states and 3370 transitions.
[2025-03-03 18:19:18,407 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 22.82758620689655) internal successors, (662), 29 states have internal predecessors, (662), 0 states have call successors, (0), 0 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,407 INFO  L276                IsEmpty]: Start isEmpty. Operand 2335 states and 3370 transitions.
[2025-03-03 18:19:18,410 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 307
[2025-03-03 18:19:18,410 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:18,411 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:19:18,422 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-03-03 18:19:18,611 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:18,611 INFO  L396      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:19:18,612 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:19:18,612 INFO  L85        PathProgramCache]: Analyzing trace with hash 1115168898, now seen corresponding path program 1 times
[2025-03-03 18:19:18,612 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:19:18,612 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683321681]
[2025-03-03 18:19:18,612 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:18,612 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:19:18,661 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes.
[2025-03-03 18:19:19,917 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements.
[2025-03-03 18:19:19,918 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:19,918 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:21,096 INFO  L134       CoverageAnalysis]: Checked inductivity of 142 backedges. 120 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:21,096 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:21,096 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683321681]
[2025-03-03 18:19:21,096 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683321681] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:19:21,096 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755709737]
[2025-03-03 18:19:21,096 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:21,096 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:21,096 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:19:21,098 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:21,099 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:21,499 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes.
[2025-03-03 18:19:21,693 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements.
[2025-03-03 18:19:21,693 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:21,693 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:21,702 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2012 conjuncts, 35 conjuncts are in the unsatisfiable core
[2025-03-03 18:19:21,707 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 18:19:22,127 INFO  L134       CoverageAnalysis]: Checked inductivity of 142 backedges. 120 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:22,127 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 18:19:22,304 INFO  L134       CoverageAnalysis]: Checked inductivity of 142 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-03-03 18:19:22,304 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [755709737] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:19:22,304 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-03-03 18:19:22,304 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 11] total 25
[2025-03-03 18:19:22,304 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946727605]
[2025-03-03 18:19:22,305 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:19:22,305 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 18:19:22,305 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:19:22,305 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 18:19:22,305 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600
[2025-03-03 18:19:22,306 INFO  L87              Difference]: Start difference. First operand 2335 states and 3370 transitions. Second operand  has 8 states, 8 states have (on average 36.625) internal successors, (293), 8 states have internal predecessors, (293), 0 states have call successors, (0), 0 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,679 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:22,679 INFO  L93              Difference]: Finished difference Result 6453 states and 9426 transitions.
[2025-03-03 18:19:22,680 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-03 18:19:22,680 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 36.625) internal successors, (293), 8 states have internal predecessors, (293), 0 states have call successors, (0), 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 306
[2025-03-03 18:19:22,680 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:22,690 INFO  L225             Difference]: With dead ends: 6453
[2025-03-03 18:19:22,690 INFO  L226             Difference]: Without dead ends: 4363
[2025-03-03 18:19:22,693 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756
[2025-03-03 18:19:22,694 INFO  L435           NwaCegarLoop]: 729 mSDtfsCounter, 1436 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 2685 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:22,695 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1436 Valid, 2685 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 18:19:22,698 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4363 states.
[2025-03-03 18:19:22,727 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4363 to 2551.
[2025-03-03 18:19:22,729 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2551 states, 2550 states have (on average 1.443921568627451) internal successors, (3682), 2550 states have internal predecessors, (3682), 0 states have call successors, (0), 0 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,732 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 3682 transitions.
[2025-03-03 18:19:22,732 INFO  L78                 Accepts]: Start accepts. Automaton has 2551 states and 3682 transitions. Word has length 306
[2025-03-03 18:19:22,732 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:22,732 INFO  L471      AbstractCegarLoop]: Abstraction has 2551 states and 3682 transitions.
[2025-03-03 18:19:22,733 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 36.625) internal successors, (293), 8 states have internal predecessors, (293), 0 states have call successors, (0), 0 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,733 INFO  L276                IsEmpty]: Start isEmpty. Operand 2551 states and 3682 transitions.
[2025-03-03 18:19:22,741 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 307
[2025-03-03 18:19:22,741 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:22,741 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:19:22,755 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-03-03 18:19:22,942 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27
[2025-03-03 18:19:22,942 INFO  L396      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:19:22,942 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:19:22,942 INFO  L85        PathProgramCache]: Analyzing trace with hash -452892007, now seen corresponding path program 1 times
[2025-03-03 18:19:22,942 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:19:22,943 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844857573]
[2025-03-03 18:19:22,943 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:22,943 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:19:22,993 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes.
[2025-03-03 18:19:24,149 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements.
[2025-03-03 18:19:24,149 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:24,149 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:24,794 INFO  L134       CoverageAnalysis]: Checked inductivity of 142 backedges. 13 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:24,794 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:24,794 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844857573]
[2025-03-03 18:19:24,794 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844857573] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:19:24,794 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341842568]
[2025-03-03 18:19:24,794 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:24,794 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:24,794 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:19:24,796 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:24,797 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:25,223 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes.
[2025-03-03 18:19:25,425 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements.
[2025-03-03 18:19:25,425 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:25,425 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:25,434 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2012 conjuncts, 50 conjuncts are in the unsatisfiable core
[2025-03-03 18:19:25,439 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 18:19:26,209 INFO  L134       CoverageAnalysis]: Checked inductivity of 142 backedges. 99 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:26,209 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 18:19:26,435 INFO  L134       CoverageAnalysis]: Checked inductivity of 142 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-03-03 18:19:26,435 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341842568] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:19:26,435 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-03-03 18:19:26,435 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 15] total 27
[2025-03-03 18:19:26,435 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718259138]
[2025-03-03 18:19:26,435 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:19:26,435 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 18:19:26,435 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:19:26,436 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 18:19:26,436 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702
[2025-03-03 18:19:26,437 INFO  L87              Difference]: Start difference. First operand 2551 states and 3682 transitions. Second operand  has 8 states, 8 states have (on average 37.5) internal successors, (300), 8 states have internal predecessors, (300), 0 states have call successors, (0), 0 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:26,903 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:26,903 INFO  L93              Difference]: Finished difference Result 7204 states and 10525 transitions.
[2025-03-03 18:19:26,904 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-03-03 18:19:26,904 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 37.5) internal successors, (300), 8 states have internal predecessors, (300), 0 states have call successors, (0), 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 306
[2025-03-03 18:19:26,904 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:26,910 INFO  L225             Difference]: With dead ends: 7204
[2025-03-03 18:19:26,910 INFO  L226             Difference]: Without dead ends: 4898
[2025-03-03 18:19:26,911 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 596 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870
[2025-03-03 18:19:26,912 INFO  L435           NwaCegarLoop]: 777 mSDtfsCounter, 1456 mSDsluCounter, 2303 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1456 SdHoareTripleChecker+Valid, 3080 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:26,912 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1456 Valid, 3080 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 18:19:26,914 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4898 states.
[2025-03-03 18:19:26,946 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4898 to 2588.
[2025-03-03 18:19:26,948 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2588 states, 2587 states have (on average 1.4445303440278314) internal successors, (3737), 2587 states have internal predecessors, (3737), 0 states have call successors, (0), 0 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:26,951 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2588 states to 2588 states and 3737 transitions.
[2025-03-03 18:19:26,952 INFO  L78                 Accepts]: Start accepts. Automaton has 2588 states and 3737 transitions. Word has length 306
[2025-03-03 18:19:26,952 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:26,952 INFO  L471      AbstractCegarLoop]: Abstraction has 2588 states and 3737 transitions.
[2025-03-03 18:19:26,952 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 37.5) internal successors, (300), 8 states have internal predecessors, (300), 0 states have call successors, (0), 0 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:26,952 INFO  L276                IsEmpty]: Start isEmpty. Operand 2588 states and 3737 transitions.
[2025-03-03 18:19:26,957 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 308
[2025-03-03 18:19:26,957 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:26,958 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:19:26,971 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:27,158 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28
[2025-03-03 18:19:27,159 INFO  L396      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:19:27,159 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:19:27,159 INFO  L85        PathProgramCache]: Analyzing trace with hash -724971108, now seen corresponding path program 1 times
[2025-03-03 18:19:27,159 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:19:27,159 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936130938]
[2025-03-03 18:19:27,159 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:27,160 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:19:27,222 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes.
[2025-03-03 18:19:28,524 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements.
[2025-03-03 18:19:28,524 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:28,524 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:29,379 INFO  L134       CoverageAnalysis]: Checked inductivity of 142 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2025-03-03 18:19:29,379 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:29,379 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936130938]
[2025-03-03 18:19:29,379 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936130938] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:19:29,379 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:19:29,379 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 18:19:29,379 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197870108]
[2025-03-03 18:19:29,379 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:19:29,380 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 18:19:29,380 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:19:29,380 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 18:19:29,380 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 18:19:29,380 INFO  L87              Difference]: Start difference. First operand 2588 states and 3737 transitions. Second operand  has 6 states, 6 states have (on average 49.166666666666664) internal successors, (295), 6 states have internal predecessors, (295), 0 states have call successors, (0), 0 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:29,702 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:29,702 INFO  L93              Difference]: Finished difference Result 6331 states and 9220 transitions.
[2025-03-03 18:19:29,702 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 18:19:29,702 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 49.166666666666664) internal successors, (295), 6 states have internal predecessors, (295), 0 states have call successors, (0), 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 307
[2025-03-03 18:19:29,702 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:29,707 INFO  L225             Difference]: With dead ends: 6331
[2025-03-03 18:19:29,707 INFO  L226             Difference]: Without dead ends: 3988
[2025-03-03 18:19:29,709 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-03-03 18:19:29,710 INFO  L435           NwaCegarLoop]: 597 mSDtfsCounter, 290 mSDsluCounter, 2111 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 2708 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:29,711 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 2708 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 18:19:29,715 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3988 states.
[2025-03-03 18:19:29,735 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3988 to 2676.
[2025-03-03 18:19:29,737 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2676 states, 2675 states have (on average 1.4418691588785046) internal successors, (3857), 2675 states have internal predecessors, (3857), 0 states have call successors, (0), 0 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:29,739 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2676 states and 3857 transitions.
[2025-03-03 18:19:29,739 INFO  L78                 Accepts]: Start accepts. Automaton has 2676 states and 3857 transitions. Word has length 307
[2025-03-03 18:19:29,739 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:29,739 INFO  L471      AbstractCegarLoop]: Abstraction has 2676 states and 3857 transitions.
[2025-03-03 18:19:29,739 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 49.166666666666664) internal successors, (295), 6 states have internal predecessors, (295), 0 states have call successors, (0), 0 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:29,740 INFO  L276                IsEmpty]: Start isEmpty. Operand 2676 states and 3857 transitions.
[2025-03-03 18:19:29,743 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 308
[2025-03-03 18:19:29,743 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:29,743 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:19:29,743 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2025-03-03 18:19:29,743 INFO  L396      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:19:29,743 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:19:29,744 INFO  L85        PathProgramCache]: Analyzing trace with hash -974897421, now seen corresponding path program 1 times
[2025-03-03 18:19:29,744 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:19:29,744 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996908703]
[2025-03-03 18:19:29,744 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:29,744 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:19:29,793 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes.
[2025-03-03 18:19:30,872 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements.
[2025-03-03 18:19:30,872 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:30,872 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:31,709 INFO  L134       CoverageAnalysis]: Checked inductivity of 142 backedges. 120 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:31,709 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:31,709 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996908703]
[2025-03-03 18:19:31,709 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996908703] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:19:31,709 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446281628]
[2025-03-03 18:19:31,709 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:31,709 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:31,709 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:19:31,711 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:31,713 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:32,217 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes.
[2025-03-03 18:19:32,380 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements.
[2025-03-03 18:19:32,380 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:32,380 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:32,389 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2015 conjuncts, 87 conjuncts are in the unsatisfiable core
[2025-03-03 18:19:32,397 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 18:19:33,105 INFO  L134       CoverageAnalysis]: Checked inductivity of 142 backedges. 29 proven. 113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:33,106 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 18:19:33,540 INFO  L134       CoverageAnalysis]: Checked inductivity of 142 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2025-03-03 18:19:33,540 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [446281628] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:19:33,540 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-03-03 18:19:33,540 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 17] total 32
[2025-03-03 18:19:33,540 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411780688]
[2025-03-03 18:19:33,540 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:19:33,541 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-03 18:19:33,541 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:19:33,541 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-03 18:19:33,541 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992
[2025-03-03 18:19:33,541 INFO  L87              Difference]: Start difference. First operand 2676 states and 3857 transitions. Second operand  has 9 states, 9 states have (on average 32.111111111111114) internal successors, (289), 9 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:19:34,012 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:34,012 INFO  L93              Difference]: Finished difference Result 7398 states and 10775 transitions.
[2025-03-03 18:19:34,012 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-03 18:19:34,012 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 32.111111111111114) internal successors, (289), 9 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) Word has length 307
[2025-03-03 18:19:34,013 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:34,019 INFO  L225             Difference]: With dead ends: 7398
[2025-03-03 18:19:34,019 INFO  L226             Difference]: Without dead ends: 4967
[2025-03-03 18:19:34,021 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 594 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=992, Unknown=0, NotChecked=0, Total=1190
[2025-03-03 18:19:34,022 INFO  L435           NwaCegarLoop]: 752 mSDtfsCounter, 1153 mSDsluCounter, 2242 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 2994 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:34,022 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 2994 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 18:19:34,024 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4967 states.
[2025-03-03 18:19:34,051 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4967 to 3544.
[2025-03-03 18:19:34,053 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3544 states, 3543 states have (on average 1.4532881738639571) internal successors, (5149), 3543 states have internal predecessors, (5149), 0 states have call successors, (0), 0 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:34,056 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3544 states to 3544 states and 5149 transitions.
[2025-03-03 18:19:34,056 INFO  L78                 Accepts]: Start accepts. Automaton has 3544 states and 5149 transitions. Word has length 307
[2025-03-03 18:19:34,057 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:34,057 INFO  L471      AbstractCegarLoop]: Abstraction has 3544 states and 5149 transitions.
[2025-03-03 18:19:34,057 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 32.111111111111114) internal successors, (289), 9 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:19:34,057 INFO  L276                IsEmpty]: Start isEmpty. Operand 3544 states and 5149 transitions.
[2025-03-03 18:19:34,061 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 308
[2025-03-03 18:19:34,061 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:34,061 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1]
[2025-03-03 18:19:34,074 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2025-03-03 18:19:34,261 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:34,262 INFO  L396      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:19:34,262 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:19:34,262 INFO  L85        PathProgramCache]: Analyzing trace with hash 1013169121, now seen corresponding path program 1 times
[2025-03-03 18:19:34,262 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:19:34,262 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704397949]
[2025-03-03 18:19:34,262 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:34,262 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:19:34,316 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes.
[2025-03-03 18:19:35,362 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements.
[2025-03-03 18:19:35,363 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:35,363 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:36,043 INFO  L134       CoverageAnalysis]: Checked inductivity of 143 backedges. 125 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:36,044 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:36,044 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704397949]
[2025-03-03 18:19:36,044 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704397949] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:19:36,044 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814532144]
[2025-03-03 18:19:36,044 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:36,044 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:36,044 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:19:36,045 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:36,046 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:36,528 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes.
[2025-03-03 18:19:36,790 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements.
[2025-03-03 18:19:36,790 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:36,790 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:36,798 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2015 conjuncts, 75 conjuncts are in the unsatisfiable core
[2025-03-03 18:19:36,804 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 18:19:37,405 INFO  L134       CoverageAnalysis]: Checked inductivity of 143 backedges. 111 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:37,405 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 18:19:37,566 INFO  L134       CoverageAnalysis]: Checked inductivity of 143 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked.
[2025-03-03 18:19:37,567 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [814532144] provided 1 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:19:37,567 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-03-03 18:19:37,567 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7, 17] total 27
[2025-03-03 18:19:37,567 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358452276]
[2025-03-03 18:19:37,567 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:19:37,567 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 18:19:37,567 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:19:37,568 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 18:19:37,568 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702
[2025-03-03 18:19:37,568 INFO  L87              Difference]: Start difference. First operand 3544 states and 5149 transitions. Second operand  has 8 states, 8 states have (on average 36.625) internal successors, (293), 8 states have internal predecessors, (293), 0 states have call successors, (0), 0 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:37,967 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:37,967 INFO  L93              Difference]: Finished difference Result 10192 states and 14933 transitions.
[2025-03-03 18:19:37,968 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-03-03 18:19:37,968 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 36.625) internal successors, (293), 8 states have internal predecessors, (293), 0 states have call successors, (0), 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 307
[2025-03-03 18:19:37,968 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:37,973 INFO  L225             Difference]: With dead ends: 10192
[2025-03-03 18:19:37,973 INFO  L226             Difference]: Without dead ends: 6893
[2025-03-03 18:19:37,977 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 596 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=770, Unknown=0, NotChecked=0, Total=930
[2025-03-03 18:19:37,977 INFO  L435           NwaCegarLoop]: 572 mSDtfsCounter, 540 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 2405 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:37,977 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 2405 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 18:19:37,983 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6893 states.
[2025-03-03 18:19:38,013 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6893 to 3696.
[2025-03-03 18:19:38,016 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3696 states, 3695 states have (on average 1.4497970230040595) internal successors, (5357), 3695 states have internal predecessors, (5357), 0 states have call successors, (0), 0 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:38,019 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 5357 transitions.
[2025-03-03 18:19:38,019 INFO  L78                 Accepts]: Start accepts. Automaton has 3696 states and 5357 transitions. Word has length 307
[2025-03-03 18:19:38,019 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:38,019 INFO  L471      AbstractCegarLoop]: Abstraction has 3696 states and 5357 transitions.
[2025-03-03 18:19:38,020 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 36.625) internal successors, (293), 8 states have internal predecessors, (293), 0 states have call successors, (0), 0 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:38,020 INFO  L276                IsEmpty]: Start isEmpty. Operand 3696 states and 5357 transitions.
[2025-03-03 18:19:38,023 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 308
[2025-03-03 18:19:38,024 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:38,024 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:19:38,035 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:38,224 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:38,224 INFO  L396      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:19:38,225 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:19:38,225 INFO  L85        PathProgramCache]: Analyzing trace with hash 1954822076, now seen corresponding path program 1 times
[2025-03-03 18:19:38,225 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:19:38,225 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368552973]
[2025-03-03 18:19:38,225 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:38,225 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:19:38,268 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes.
[2025-03-03 18:19:39,319 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements.
[2025-03-03 18:19:39,320 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:39,320 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:39,962 INFO  L134       CoverageAnalysis]: Checked inductivity of 142 backedges. 13 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:39,963 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:39,963 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368552973]
[2025-03-03 18:19:39,963 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368552973] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:19:39,963 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235568669]
[2025-03-03 18:19:39,963 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:39,963 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:39,963 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:19:39,965 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:39,965 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:40,480 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes.
[2025-03-03 18:19:40,778 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements.
[2025-03-03 18:19:40,778 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:40,778 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:40,787 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2015 conjuncts, 104 conjuncts are in the unsatisfiable core
[2025-03-03 18:19:40,797 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 18:19:42,182 INFO  L134       CoverageAnalysis]: Checked inductivity of 142 backedges. 71 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:42,182 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 18:19:43,769 INFO  L134       CoverageAnalysis]: Checked inductivity of 142 backedges. 65 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:43,769 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235568669] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 18:19:43,769 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 18:19:43,770 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 18] total 37
[2025-03-03 18:19:43,770 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494810107]
[2025-03-03 18:19:43,770 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 18:19:43,770 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2025-03-03 18:19:43,770 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:19:43,771 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2025-03-03 18:19:43,771 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1161, Unknown=0, NotChecked=0, Total=1332
[2025-03-03 18:19:43,771 INFO  L87              Difference]: Start difference. First operand 3696 states and 5357 transitions. Second operand  has 37 states, 37 states have (on average 24.486486486486488) internal successors, (906), 37 states have internal predecessors, (906), 0 states have call successors, (0), 0 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:49,993 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:49,994 INFO  L93              Difference]: Finished difference Result 25984 states and 38107 transitions.
[2025-03-03 18:19:49,994 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. 
[2025-03-03 18:19:49,994 INFO  L78                 Accepts]: Start accepts. Automaton has  has 37 states, 37 states have (on average 24.486486486486488) internal successors, (906), 37 states have internal predecessors, (906), 0 states have call successors, (0), 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 307
[2025-03-03 18:19:49,994 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:50,015 INFO  L225             Difference]: With dead ends: 25984
[2025-03-03 18:19:50,015 INFO  L226             Difference]: Without dead ends: 22533
[2025-03-03 18:19:50,022 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 740 GetRequests, 587 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8110 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2690, Invalid=21180, Unknown=0, NotChecked=0, Total=23870
[2025-03-03 18:19:50,022 INFO  L435           NwaCegarLoop]: 983 mSDtfsCounter, 11667 mSDsluCounter, 18182 mSDsCounter, 0 mSdLazyCounter, 7784 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11667 SdHoareTripleChecker+Valid, 19165 SdHoareTripleChecker+Invalid, 7842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 7784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:50,022 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [11667 Valid, 19165 Invalid, 7842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 7784 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time]
[2025-03-03 18:19:50,032 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22533 states.
[2025-03-03 18:19:50,143 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22533 to 11340.
[2025-03-03 18:19:50,153 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11340 states, 11339 states have (on average 1.4562130699356204) internal successors, (16512), 11339 states have internal predecessors, (16512), 0 states have call successors, (0), 0 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:50,164 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11340 states to 11340 states and 16512 transitions.
[2025-03-03 18:19:50,164 INFO  L78                 Accepts]: Start accepts. Automaton has 11340 states and 16512 transitions. Word has length 307
[2025-03-03 18:19:50,165 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:50,165 INFO  L471      AbstractCegarLoop]: Abstraction has 11340 states and 16512 transitions.
[2025-03-03 18:19:50,165 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 37 states, 37 states have (on average 24.486486486486488) internal successors, (906), 37 states have internal predecessors, (906), 0 states have call successors, (0), 0 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:50,165 INFO  L276                IsEmpty]: Start isEmpty. Operand 11340 states and 16512 transitions.
[2025-03-03 18:19:50,172 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 309
[2025-03-03 18:19:50,172 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:50,173 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:19:50,185 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:50,373 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,SelfDestructingSolverStorable32
[2025-03-03 18:19:50,374 INFO  L396      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:19:50,374 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:19:50,374 INFO  L85        PathProgramCache]: Analyzing trace with hash 1660355731, now seen corresponding path program 1 times
[2025-03-03 18:19:50,374 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:19:50,374 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766610212]
[2025-03-03 18:19:50,374 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:50,375 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:19:50,420 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes.
[2025-03-03 18:19:51,488 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements.
[2025-03-03 18:19:51,488 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:51,488 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:52,315 INFO  L134       CoverageAnalysis]: Checked inductivity of 142 backedges. 126 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:52,315 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:19:52,315 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766610212]
[2025-03-03 18:19:52,315 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766610212] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:19:52,315 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84789272]
[2025-03-03 18:19:52,315 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:19:52,315 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:19:52,315 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:19:52,317 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:52,318 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:52,861 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes.
[2025-03-03 18:19:53,183 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements.
[2025-03-03 18:19:53,183 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:19:53,183 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:19:53,192 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2016 conjuncts, 51 conjuncts are in the unsatisfiable core
[2025-03-03 18:19:53,198 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 18:19:53,807 INFO  L134       CoverageAnalysis]: Checked inductivity of 142 backedges. 99 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:53,807 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 18:19:54,556 INFO  L134       CoverageAnalysis]: Checked inductivity of 142 backedges. 99 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:19:54,556 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [84789272] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 18:19:54,556 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 18:19:54,556 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 12] total 27
[2025-03-03 18:19:54,556 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88639232]
[2025-03-03 18:19:54,557 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 18:19:54,557 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2025-03-03 18:19:54,557 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:19:54,558 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2025-03-03 18:19:54,558 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702
[2025-03-03 18:19:54,558 INFO  L87              Difference]: Start difference. First operand 11340 states and 16512 transitions. Second operand  has 27 states, 27 states have (on average 27.037037037037038) internal successors, (730), 27 states have internal predecessors, (730), 0 states have call successors, (0), 0 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:56,213 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:19:56,214 INFO  L93              Difference]: Finished difference Result 31015 states and 45404 transitions.
[2025-03-03 18:19:56,214 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. 
[2025-03-03 18:19:56,214 INFO  L78                 Accepts]: Start accepts. Automaton has  has 27 states, 27 states have (on average 27.037037037037038) internal successors, (730), 27 states have internal predecessors, (730), 0 states have call successors, (0), 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 308
[2025-03-03 18:19:56,214 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:19:56,233 INFO  L225             Difference]: With dead ends: 31015
[2025-03-03 18:19:56,233 INFO  L226             Difference]: Without dead ends: 19737
[2025-03-03 18:19:56,246 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 597 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=813, Invalid=2969, Unknown=0, NotChecked=0, Total=3782
[2025-03-03 18:19:56,247 INFO  L435           NwaCegarLoop]: 622 mSDtfsCounter, 7595 mSDsluCounter, 5181 mSDsCounter, 0 mSdLazyCounter, 2582 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7595 SdHoareTripleChecker+Valid, 5803 SdHoareTripleChecker+Invalid, 2595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-03 18:19:56,247 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [7595 Valid, 5803 Invalid, 2595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2582 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-03 18:19:56,257 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19737 states.
[2025-03-03 18:19:56,373 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19737 to 10669.
[2025-03-03 18:19:56,383 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10669 states, 10668 states have (on average 1.4503187101612298) internal successors, (15472), 10668 states have internal predecessors, (15472), 0 states have call successors, (0), 0 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:56,393 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10669 states to 10669 states and 15472 transitions.
[2025-03-03 18:19:56,394 INFO  L78                 Accepts]: Start accepts. Automaton has 10669 states and 15472 transitions. Word has length 308
[2025-03-03 18:19:56,394 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:19:56,394 INFO  L471      AbstractCegarLoop]: Abstraction has 10669 states and 15472 transitions.
[2025-03-03 18:19:56,395 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 27.037037037037038) internal successors, (730), 27 states have internal predecessors, (730), 0 states have call successors, (0), 0 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:56,395 INFO  L276                IsEmpty]: Start isEmpty. Operand 10669 states and 15472 transitions.
[2025-03-03 18:19:56,401 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 309
[2025-03-03 18:19:56,401 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:19:56,401 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1]
[2025-03-03 18:19:56,416 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0