./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/byte_add_2-2.i --full-output --architecture 32bit


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


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/bitvector/byte_add_2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 09:42:25,132 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 09:42:25,186 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-03 09:42:25,190 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 09:42:25,190 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 09:42:25,209 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 09:42:25,211 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 09:42:25,211 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 09:42:25,211 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 09:42:25,212 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 09:42:25,212 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 09:42:25,212 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 09:42:25,213 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 09:42:25,213 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 09:42:25,213 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 09:42:25,213 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 09:42:25,213 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 09:42:25,214 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 09:42:25,214 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 09:42:25,214 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 09:42:25,214 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 09:42:25,214 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 09:42:25,214 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 09:42:25,214 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 09:42:25,214 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 09:42:25,214 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 09:42:25,214 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 09:42:25,214 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 09:42:25,214 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 09:42:25,214 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 09:42:25,215 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 09:42:25,215 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 09:42:25,215 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 09:42:25,215 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 09:42:25,215 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 09:42:25,215 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 09:42:25,215 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 09:42:25,215 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 09:42:25,215 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 09:42:25,215 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 09:42:25,215 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 09:42:25,215 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 09:42:25,215 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 09:42:25,215 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 -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba
[2025-03-03 09:42:25,435 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 09:42:25,444 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 09:42:25,446 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 09:42:25,447 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 09:42:25,447 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 09:42:25,449 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-2.i
[2025-03-03 09:42:26,604 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87cd359bb/35a5aa2e47154259b3e06f2d9741ae22/FLAG5f2b735f1
[2025-03-03 09:42:26,810 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 09:42:26,810 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i
[2025-03-03 09:42:26,816 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87cd359bb/35a5aa2e47154259b3e06f2d9741ae22/FLAG5f2b735f1
[2025-03-03 09:42:26,826 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87cd359bb/35a5aa2e47154259b3e06f2d9741ae22
[2025-03-03 09:42:26,827 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 09:42:26,828 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 09:42:26,829 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 09:42:26,829 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 09:42:26,832 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 09:42:26,833 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:42:26" (1/1) ...
[2025-03-03 09:42:26,834 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d8c171b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:26, skipping insertion in model container
[2025-03-03 09:42:26,834 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:42:26" (1/1) ...
[2025-03-03 09:42:26,845 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 09:42:26,943 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/bitvector/byte_add_2-2.i[1168,1181]
[2025-03-03 09:42:26,988 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 09:42:26,997 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 09:42:27,005 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/bitvector/byte_add_2-2.i[1168,1181]
[2025-03-03 09:42:27,029 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 09:42:27,048 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 09:42:27,049 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:27 WrapperNode
[2025-03-03 09:42:27,049 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 09:42:27,050 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 09:42:27,050 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 09:42:27,051 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 09:42:27,057 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:27" (1/1) ...
[2025-03-03 09:42:27,061 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:27" (1/1) ...
[2025-03-03 09:42:27,091 INFO  L138                Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 141
[2025-03-03 09:42:27,095 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 09:42:27,095 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 09:42:27,096 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 09:42:27,096 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 09:42:27,102 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:27" (1/1) ...
[2025-03-03 09:42:27,102 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:27" (1/1) ...
[2025-03-03 09:42:27,108 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:27" (1/1) ...
[2025-03-03 09:42:27,118 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 09:42:27,119 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:27" (1/1) ...
[2025-03-03 09:42:27,119 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:27" (1/1) ...
[2025-03-03 09:42:27,125 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:27" (1/1) ...
[2025-03-03 09:42:27,128 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:27" (1/1) ...
[2025-03-03 09:42:27,129 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:27" (1/1) ...
[2025-03-03 09:42:27,129 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:27" (1/1) ...
[2025-03-03 09:42:27,136 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 09:42:27,137 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 09:42:27,137 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 09:42:27,137 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 09:42:27,138 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:27" (1/1) ...
[2025-03-03 09:42:27,144 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 09:42:27,155 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:42:27,166 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 09:42:27,169 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 09:42:27,186 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 09:42:27,187 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 09:42:27,187 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 09:42:27,187 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 09:42:27,235 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 09:42:27,237 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 09:42:27,517 INFO  L?                        ?]: Removed 37 outVars from TransFormulas that were not future-live.
[2025-03-03 09:42:27,519 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 09:42:27,535 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 09:42:27,535 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 09:42:27,535 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:42:27 BoogieIcfgContainer
[2025-03-03 09:42:27,536 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 09:42:27,538 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 09:42:27,538 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 09:42:27,541 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 09:42:27,541 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:42:26" (1/3) ...
[2025-03-03 09:42:27,542 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40bb05f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:42:27, skipping insertion in model container
[2025-03-03 09:42:27,542 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:27" (2/3) ...
[2025-03-03 09:42:27,542 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40bb05f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:42:27, skipping insertion in model container
[2025-03-03 09:42:27,543 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:42:27" (3/3) ...
[2025-03-03 09:42:27,544 INFO  L128   eAbstractionObserver]: Analyzing ICFG byte_add_2-2.i
[2025-03-03 09:42:27,556 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 09:42:27,557 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG byte_add_2-2.i that has 1 procedures, 51 locations, 1 initial locations, 2 loop locations, and 1 error locations.
[2025-03-03 09:42:27,594 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 09:42:27,603 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;@19911011, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 09:42:27,603 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 09:42:27,607 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 51 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 50 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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 09:42:27,612 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2025-03-03 09:42:27,612 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:27,613 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:42:27,613 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:27,617 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:27,617 INFO  L85        PathProgramCache]: Analyzing trace with hash 256418395, now seen corresponding path program 1 times
[2025-03-03 09:42:27,623 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:42:27,624 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136008559]
[2025-03-03 09:42:27,624 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:27,624 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:42:27,690 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes.
[2025-03-03 09:42:27,741 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements.
[2025-03-03 09:42:27,741 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:27,742 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:27,877 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 09:42:27,877 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:42:27,877 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136008559]
[2025-03-03 09:42:27,878 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136008559] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:42:27,878 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:42:27,878 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:42:27,879 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59173018]
[2025-03-03 09:42:27,880 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:42:27,882 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:42:27,882 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:42:27,896 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:42:27,896 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:42:27,898 INFO  L87              Difference]: Start difference. First operand  has 51 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 50 states have internal predecessors, (84), 0 states have call successors, (0), 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 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 09:42:28,060 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:28,061 INFO  L93              Difference]: Finished difference Result 115 states and 196 transitions.
[2025-03-03 09:42:28,061 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:42:28,062 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15
[2025-03-03 09:42:28,062 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:28,067 INFO  L225             Difference]: With dead ends: 115
[2025-03-03 09:42:28,067 INFO  L226             Difference]: Without dead ends: 70
[2025-03-03 09:42:28,069 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:42:28,070 INFO  L435           NwaCegarLoop]: 55 mSDtfsCounter, 24 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:28,071 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 90 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:42:28,079 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 70 states.
[2025-03-03 09:42:28,106 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68.
[2025-03-03 09:42:28,107 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 68 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 67 states have internal predecessors, (104), 0 states have call successors, (0), 0 states 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 09:42:28,113 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions.
[2025-03-03 09:42:28,114 INFO  L78                 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 15
[2025-03-03 09:42:28,114 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:28,114 INFO  L471      AbstractCegarLoop]: Abstraction has 68 states and 104 transitions.
[2025-03-03 09:42:28,114 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 09:42:28,114 INFO  L276                IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions.
[2025-03-03 09:42:28,115 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2025-03-03 09:42:28,115 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:28,115 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:42:28,115 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 09:42:28,115 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:28,116 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:28,116 INFO  L85        PathProgramCache]: Analyzing trace with hash -150396971, now seen corresponding path program 1 times
[2025-03-03 09:42:28,116 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:42:28,116 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900750143]
[2025-03-03 09:42:28,116 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:28,116 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:42:28,124 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes.
[2025-03-03 09:42:28,147 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements.
[2025-03-03 09:42:28,147 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:28,147 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:28,280 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:42:28,280 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:42:28,280 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900750143]
[2025-03-03 09:42:28,281 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900750143] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:42:28,281 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:42:28,281 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 09:42:28,281 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373330421]
[2025-03-03 09:42:28,281 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:42:28,281 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:42:28,281 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:42:28,282 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:42:28,282 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 09:42:28,282 INFO  L87              Difference]: Start difference. First operand 68 states and 104 transitions. Second operand  has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 09:42:28,507 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:28,508 INFO  L93              Difference]: Finished difference Result 164 states and 279 transitions.
[2025-03-03 09:42:28,508 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 09:42:28,508 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 21
[2025-03-03 09:42:28,508 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:28,509 INFO  L225             Difference]: With dead ends: 164
[2025-03-03 09:42:28,509 INFO  L226             Difference]: Without dead ends: 127
[2025-03-03 09:42:28,509 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:42:28,509 INFO  L435           NwaCegarLoop]: 43 mSDtfsCounter, 92 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:28,510 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 107 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 09:42:28,510 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 127 states.
[2025-03-03 09:42:28,515 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91.
[2025-03-03 09:42:28,517 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 91 states, 90 states have (on average 1.5444444444444445) internal successors, (139), 90 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 09:42:28,518 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 139 transitions.
[2025-03-03 09:42:28,521 INFO  L78                 Accepts]: Start accepts. Automaton has 91 states and 139 transitions. Word has length 21
[2025-03-03 09:42:28,521 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:28,521 INFO  L471      AbstractCegarLoop]: Abstraction has 91 states and 139 transitions.
[2025-03-03 09:42:28,521 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 09:42:28,521 INFO  L276                IsEmpty]: Start isEmpty. Operand 91 states and 139 transitions.
[2025-03-03 09:42:28,522 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2025-03-03 09:42:28,522 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:28,522 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:42:28,522 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 09:42:28,522 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:28,522 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:28,523 INFO  L85        PathProgramCache]: Analyzing trace with hash -1774093583, now seen corresponding path program 1 times
[2025-03-03 09:42:28,523 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:42:28,523 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689629402]
[2025-03-03 09:42:28,523 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:28,523 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:42:28,537 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-03-03 09:42:28,548 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-03-03 09:42:28,548 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:28,548 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:28,649 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-03-03 09:42:28,649 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:42:28,649 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689629402]
[2025-03-03 09:42:28,649 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689629402] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:42:28,649 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:42:28,649 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 09:42:28,649 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54159227]
[2025-03-03 09:42:28,649 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:42:28,650 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:42:28,650 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:42:28,650 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:42:28,650 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 09:42:28,650 INFO  L87              Difference]: Start difference. First operand 91 states and 139 transitions. Second operand  has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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 09:42:28,776 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:28,777 INFO  L93              Difference]: Finished difference Result 238 states and 361 transitions.
[2025-03-03 09:42:28,777 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 09:42:28,777 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 09:42:28,777 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:28,778 INFO  L225             Difference]: With dead ends: 238
[2025-03-03 09:42:28,779 INFO  L226             Difference]: Without dead ends: 160
[2025-03-03 09:42:28,779 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:42:28,780 INFO  L435           NwaCegarLoop]: 83 mSDtfsCounter, 75 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:28,780 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 179 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:42:28,781 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 160 states.
[2025-03-03 09:42:28,788 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 98.
[2025-03-03 09:42:28,788 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 98 states, 97 states have (on average 1.5360824742268042) internal successors, (149), 97 states have internal predecessors, (149), 0 states have call successors, (0), 0 states 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 09:42:28,789 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 149 transitions.
[2025-03-03 09:42:28,789 INFO  L78                 Accepts]: Start accepts. Automaton has 98 states and 149 transitions. Word has length 27
[2025-03-03 09:42:28,789 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:28,789 INFO  L471      AbstractCegarLoop]: Abstraction has 98 states and 149 transitions.
[2025-03-03 09:42:28,789 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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 09:42:28,789 INFO  L276                IsEmpty]: Start isEmpty. Operand 98 states and 149 transitions.
[2025-03-03 09:42:28,789 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2025-03-03 09:42:28,792 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:28,792 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:42:28,792 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 09:42:28,793 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:28,793 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:28,793 INFO  L85        PathProgramCache]: Analyzing trace with hash 1362530234, now seen corresponding path program 1 times
[2025-03-03 09:42:28,793 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:42:28,793 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446356812]
[2025-03-03 09:42:28,793 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:28,793 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:42:28,804 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes.
[2025-03-03 09:42:28,835 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements.
[2025-03-03 09:42:28,835 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:28,835 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:28,910 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-03-03 09:42:28,910 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:42:28,910 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446356812]
[2025-03-03 09:42:28,910 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446356812] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:42:28,910 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:42:28,911 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 09:42:28,911 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114913086]
[2025-03-03 09:42:28,911 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:42:28,911 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:42:28,911 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:42:28,911 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:42:28,911 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 09:42:28,912 INFO  L87              Difference]: Start difference. First operand 98 states and 149 transitions. Second operand  has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states 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 09:42:29,023 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:29,023 INFO  L93              Difference]: Finished difference Result 244 states and 367 transitions.
[2025-03-03 09:42:29,023 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 09:42:29,024 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 09:42:29,024 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:29,024 INFO  L225             Difference]: With dead ends: 244
[2025-03-03 09:42:29,025 INFO  L226             Difference]: Without dead ends: 166
[2025-03-03 09:42:29,025 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:42:29,025 INFO  L435           NwaCegarLoop]: 77 mSDtfsCounter, 70 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:29,026 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 171 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:42:29,026 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 166 states.
[2025-03-03 09:42:29,031 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 109.
[2025-03-03 09:42:29,033 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 109 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 108 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 09:42:29,034 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 161 transitions.
[2025-03-03 09:42:29,035 INFO  L78                 Accepts]: Start accepts. Automaton has 109 states and 161 transitions. Word has length 28
[2025-03-03 09:42:29,035 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:29,036 INFO  L471      AbstractCegarLoop]: Abstraction has 109 states and 161 transitions.
[2025-03-03 09:42:29,036 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states 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 09:42:29,036 INFO  L276                IsEmpty]: Start isEmpty. Operand 109 states and 161 transitions.
[2025-03-03 09:42:29,036 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-03-03 09:42:29,036 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:29,036 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-03 09:42:29,036 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 09:42:29,036 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:29,037 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:29,037 INFO  L85        PathProgramCache]: Analyzing trace with hash 1502995180, now seen corresponding path program 1 times
[2025-03-03 09:42:29,037 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:42:29,037 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337071326]
[2025-03-03 09:42:29,037 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:29,037 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:42:29,045 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-03-03 09:42:29,056 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-03-03 09:42:29,056 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:29,056 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:29,133 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:42:29,133 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:42:29,133 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337071326]
[2025-03-03 09:42:29,133 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337071326] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:42:29,133 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138833320]
[2025-03-03 09:42:29,133 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:29,133 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:29,133 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:42:29,135 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 09:42:29,137 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 09:42:29,167 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-03-03 09:42:29,189 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-03-03 09:42:29,190 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:29,190 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:29,192 INFO  L256         TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-03-03 09:42:29,195 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:42:29,238 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-03-03 09:42:29,238 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:42:29,238 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138833320] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:42:29,238 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:42:29,238 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6
[2025-03-03 09:42:29,238 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668339225]
[2025-03-03 09:42:29,238 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:42:29,238 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:42:29,238 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:42:29,239 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:42:29,239 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:42:29,239 INFO  L87              Difference]: Start difference. First operand 109 states and 161 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 09:42:29,399 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:29,399 INFO  L93              Difference]: Finished difference Result 230 states and 363 transitions.
[2025-03-03 09:42:29,399 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 09:42:29,400 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 29
[2025-03-03 09:42:29,400 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:29,400 INFO  L225             Difference]: With dead ends: 230
[2025-03-03 09:42:29,401 INFO  L226             Difference]: Without dead ends: 154
[2025-03-03 09:42:29,401 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:42:29,401 INFO  L435           NwaCegarLoop]: 76 mSDtfsCounter, 37 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:29,402 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 142 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 09:42:29,402 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 154 states.
[2025-03-03 09:42:29,406 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 138.
[2025-03-03 09:42:29,407 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 138 states, 137 states have (on average 1.4306569343065694) internal successors, (196), 137 states have internal predecessors, (196), 0 states have call successors, (0), 0 states 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 09:42:29,407 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 196 transitions.
[2025-03-03 09:42:29,407 INFO  L78                 Accepts]: Start accepts. Automaton has 138 states and 196 transitions. Word has length 29
[2025-03-03 09:42:29,408 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:29,408 INFO  L471      AbstractCegarLoop]: Abstraction has 138 states and 196 transitions.
[2025-03-03 09:42:29,408 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 09:42:29,408 INFO  L276                IsEmpty]: Start isEmpty. Operand 138 states and 196 transitions.
[2025-03-03 09:42:29,409 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2025-03-03 09:42:29,409 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:29,409 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:42:29,415 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-03 09:42:29,614 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:29,614 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:29,614 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:29,614 INFO  L85        PathProgramCache]: Analyzing trace with hash 1919697766, now seen corresponding path program 1 times
[2025-03-03 09:42:29,614 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:42:29,614 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369220735]
[2025-03-03 09:42:29,614 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:29,615 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:42:29,623 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes.
[2025-03-03 09:42:29,633 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements.
[2025-03-03 09:42:29,633 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:29,633 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:29,742 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:42:29,743 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:42:29,743 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369220735]
[2025-03-03 09:42:29,743 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369220735] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:42:29,743 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672865442]
[2025-03-03 09:42:29,743 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:29,743 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:29,743 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:42:29,745 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 09:42:29,746 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 09:42:29,772 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes.
[2025-03-03 09:42:29,786 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements.
[2025-03-03 09:42:29,787 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:29,787 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:29,788 INFO  L256         TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-03-03 09:42:29,789 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:42:29,809 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-03-03 09:42:29,810 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:42:29,810 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [672865442] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:42:29,810 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:42:29,810 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7
[2025-03-03 09:42:29,810 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515261581]
[2025-03-03 09:42:29,810 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:42:29,810 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:42:29,810 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:42:29,811 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:42:29,811 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-03 09:42:29,811 INFO  L87              Difference]: Start difference. First operand 138 states and 196 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 09:42:29,952 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:29,952 INFO  L93              Difference]: Finished difference Result 288 states and 427 transitions.
[2025-03-03 09:42:29,952 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 09:42:29,953 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 35
[2025-03-03 09:42:29,953 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:29,953 INFO  L225             Difference]: With dead ends: 288
[2025-03-03 09:42:29,953 INFO  L226             Difference]: Without dead ends: 183
[2025-03-03 09:42:29,954 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-03 09:42:29,954 INFO  L435           NwaCegarLoop]: 76 mSDtfsCounter, 36 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:29,955 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 142 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:42:29,955 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 183 states.
[2025-03-03 09:42:29,960 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 161.
[2025-03-03 09:42:29,960 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 161 states, 160 states have (on average 1.39375) internal successors, (223), 160 states have internal predecessors, (223), 0 states have call successors, (0), 0 states 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 09:42:29,961 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 223 transitions.
[2025-03-03 09:42:29,961 INFO  L78                 Accepts]: Start accepts. Automaton has 161 states and 223 transitions. Word has length 35
[2025-03-03 09:42:29,961 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:29,961 INFO  L471      AbstractCegarLoop]: Abstraction has 161 states and 223 transitions.
[2025-03-03 09:42:29,961 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 09:42:29,961 INFO  L276                IsEmpty]: Start isEmpty. Operand 161 states and 223 transitions.
[2025-03-03 09:42:29,962 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-03-03 09:42:29,962 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:29,962 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:42:29,968 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 09:42:30,163 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5
[2025-03-03 09:42:30,163 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:30,163 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:30,164 INFO  L85        PathProgramCache]: Analyzing trace with hash 1062085122, now seen corresponding path program 1 times
[2025-03-03 09:42:30,164 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:42:30,164 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002189046]
[2025-03-03 09:42:30,164 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:30,164 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:42:30,170 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes.
[2025-03-03 09:42:30,183 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-03-03 09:42:30,184 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:30,184 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:30,287 INFO  L134       CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2025-03-03 09:42:30,287 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:42:30,287 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002189046]
[2025-03-03 09:42:30,287 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002189046] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:42:30,287 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:42:30,287 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:42:30,287 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119918836]
[2025-03-03 09:42:30,287 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:42:30,287 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:42:30,288 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:42:30,288 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:42:30,288 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:42:30,289 INFO  L87              Difference]: Start difference. First operand 161 states and 223 transitions. Second operand  has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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 09:42:30,299 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:30,299 INFO  L93              Difference]: Finished difference Result 289 states and 401 transitions.
[2025-03-03 09:42:30,299 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:42:30,300 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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 41
[2025-03-03 09:42:30,300 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:30,300 INFO  L225             Difference]: With dead ends: 289
[2025-03-03 09:42:30,300 INFO  L226             Difference]: Without dead ends: 148
[2025-03-03 09:42:30,301 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:42:30,301 INFO  L435           NwaCegarLoop]: 69 mSDtfsCounter, 66 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:30,301 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 72 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 09:42:30,302 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 148 states.
[2025-03-03 09:42:30,305 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148.
[2025-03-03 09:42:30,306 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 148 states, 147 states have (on average 1.3741496598639455) internal successors, (202), 147 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:42:30,306 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 202 transitions.
[2025-03-03 09:42:30,306 INFO  L78                 Accepts]: Start accepts. Automaton has 148 states and 202 transitions. Word has length 41
[2025-03-03 09:42:30,306 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:30,307 INFO  L471      AbstractCegarLoop]: Abstraction has 148 states and 202 transitions.
[2025-03-03 09:42:30,307 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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 09:42:30,307 INFO  L276                IsEmpty]: Start isEmpty. Operand 148 states and 202 transitions.
[2025-03-03 09:42:30,307 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2025-03-03 09:42:30,308 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:30,308 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 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]
[2025-03-03 09:42:30,308 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 09:42:30,308 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:30,308 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:30,308 INFO  L85        PathProgramCache]: Analyzing trace with hash -113587399, now seen corresponding path program 1 times
[2025-03-03 09:42:30,308 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:42:30,308 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912466194]
[2025-03-03 09:42:30,309 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:30,309 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:42:30,314 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes.
[2025-03-03 09:42:30,320 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements.
[2025-03-03 09:42:30,320 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:30,320 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:30,370 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2025-03-03 09:42:30,371 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:42:30,371 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912466194]
[2025-03-03 09:42:30,371 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912466194] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:42:30,371 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:42:30,371 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:42:30,371 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101475188]
[2025-03-03 09:42:30,371 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:42:30,371 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:42:30,371 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:42:30,372 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:42:30,372 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:42:30,372 INFO  L87              Difference]: Start difference. First operand 148 states and 202 transitions. Second operand  has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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 09:42:30,388 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:30,388 INFO  L93              Difference]: Finished difference Result 219 states and 295 transitions.
[2025-03-03 09:42:30,389 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:42:30,389 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 47
[2025-03-03 09:42:30,389 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:30,390 INFO  L225             Difference]: With dead ends: 219
[2025-03-03 09:42:30,390 INFO  L226             Difference]: Without dead ends: 178
[2025-03-03 09:42:30,390 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:42:30,390 INFO  L435           NwaCegarLoop]: 71 mSDtfsCounter, 4 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:30,391 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 136 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 09:42:30,391 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 178 states.
[2025-03-03 09:42:30,397 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178.
[2025-03-03 09:42:30,398 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 178 states, 177 states have (on average 1.344632768361582) internal successors, (238), 177 states have internal predecessors, (238), 0 states have call successors, (0), 0 states 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 09:42:30,398 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 238 transitions.
[2025-03-03 09:42:30,398 INFO  L78                 Accepts]: Start accepts. Automaton has 178 states and 238 transitions. Word has length 47
[2025-03-03 09:42:30,398 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:30,398 INFO  L471      AbstractCegarLoop]: Abstraction has 178 states and 238 transitions.
[2025-03-03 09:42:30,398 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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 09:42:30,399 INFO  L276                IsEmpty]: Start isEmpty. Operand 178 states and 238 transitions.
[2025-03-03 09:42:30,399 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2025-03-03 09:42:30,399 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:30,403 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 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]
[2025-03-03 09:42:30,403 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 09:42:30,403 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:30,403 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:30,403 INFO  L85        PathProgramCache]: Analyzing trace with hash 1997702970, now seen corresponding path program 1 times
[2025-03-03 09:42:30,403 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:42:30,404 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89208908]
[2025-03-03 09:42:30,404 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:30,404 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:42:30,411 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes.
[2025-03-03 09:42:30,419 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements.
[2025-03-03 09:42:30,419 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:30,420 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:30,561 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-03-03 09:42:30,561 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:42:30,561 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89208908]
[2025-03-03 09:42:30,561 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89208908] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:42:30,561 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812139268]
[2025-03-03 09:42:30,561 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:30,561 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:30,561 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:42:30,564 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 09:42:30,565 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 09:42:30,598 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes.
[2025-03-03 09:42:30,613 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements.
[2025-03-03 09:42:30,613 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:30,613 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:30,614 INFO  L256         TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 9 conjuncts are in the unsatisfiable core
[2025-03-03 09:42:30,615 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:42:30,637 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2025-03-03 09:42:30,638 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:42:30,638 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [812139268] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:42:30,638 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:42:30,638 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6
[2025-03-03 09:42:30,638 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438178505]
[2025-03-03 09:42:30,638 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:42:30,638 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:42:30,638 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:42:30,638 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:42:30,638 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:42:30,639 INFO  L87              Difference]: Start difference. First operand 178 states and 238 transitions. Second operand  has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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 09:42:30,695 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:30,695 INFO  L93              Difference]: Finished difference Result 354 states and 477 transitions.
[2025-03-03 09:42:30,695 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 09:42:30,695 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 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 47
[2025-03-03 09:42:30,696 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:30,696 INFO  L225             Difference]: With dead ends: 354
[2025-03-03 09:42:30,696 INFO  L226             Difference]: Without dead ends: 169
[2025-03-03 09:42:30,697 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2025-03-03 09:42:30,697 INFO  L435           NwaCegarLoop]: 57 mSDtfsCounter, 26 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:30,697 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 105 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 09:42:30,698 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 169 states.
[2025-03-03 09:42:30,700 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 136.
[2025-03-03 09:42:30,701 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 136 states, 135 states have (on average 1.325925925925926) internal successors, (179), 135 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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 09:42:30,701 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 179 transitions.
[2025-03-03 09:42:30,701 INFO  L78                 Accepts]: Start accepts. Automaton has 136 states and 179 transitions. Word has length 47
[2025-03-03 09:42:30,701 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:30,702 INFO  L471      AbstractCegarLoop]: Abstraction has 136 states and 179 transitions.
[2025-03-03 09:42:30,702 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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 09:42:30,702 INFO  L276                IsEmpty]: Start isEmpty. Operand 136 states and 179 transitions.
[2025-03-03 09:42:30,703 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2025-03-03 09:42:30,703 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:30,703 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 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 09:42:30,709 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 09:42:30,903 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:30,904 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:30,904 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:30,904 INFO  L85        PathProgramCache]: Analyzing trace with hash -184015323, now seen corresponding path program 1 times
[2025-03-03 09:42:30,904 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:42:30,904 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384081936]
[2025-03-03 09:42:30,904 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:30,904 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:42:30,910 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes.
[2025-03-03 09:42:30,922 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements.
[2025-03-03 09:42:30,923 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:30,923 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:31,048 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked.
[2025-03-03 09:42:31,049 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:42:31,049 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384081936]
[2025-03-03 09:42:31,049 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384081936] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:42:31,049 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:42:31,049 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 09:42:31,049 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25575614]
[2025-03-03 09:42:31,049 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:42:31,049 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 09:42:31,049 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:42:31,050 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 09:42:31,050 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:42:31,050 INFO  L87              Difference]: Start difference. First operand 136 states and 179 transitions. Second operand  has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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 09:42:31,245 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:31,245 INFO  L93              Difference]: Finished difference Result 501 states and 654 transitions.
[2025-03-03 09:42:31,246 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 09:42:31,246 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 68
[2025-03-03 09:42:31,246 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:31,248 INFO  L225             Difference]: With dead ends: 501
[2025-03-03 09:42:31,248 INFO  L226             Difference]: Without dead ends: 381
[2025-03-03 09:42:31,248 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-03 09:42:31,249 INFO  L435           NwaCegarLoop]: 86 mSDtfsCounter, 137 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:31,249 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 239 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 09:42:31,249 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 381 states.
[2025-03-03 09:42:31,256 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 136.
[2025-03-03 09:42:31,256 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 136 states, 135 states have (on average 1.325925925925926) internal successors, (179), 135 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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 09:42:31,256 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 179 transitions.
[2025-03-03 09:42:31,256 INFO  L78                 Accepts]: Start accepts. Automaton has 136 states and 179 transitions. Word has length 68
[2025-03-03 09:42:31,257 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:31,257 INFO  L471      AbstractCegarLoop]: Abstraction has 136 states and 179 transitions.
[2025-03-03 09:42:31,257 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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 09:42:31,257 INFO  L276                IsEmpty]: Start isEmpty. Operand 136 states and 179 transitions.
[2025-03-03 09:42:31,257 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 70
[2025-03-03 09:42:31,257 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:31,257 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 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 09:42:31,257 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 09:42:31,257 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:31,258 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:31,258 INFO  L85        PathProgramCache]: Analyzing trace with hash 521265017, now seen corresponding path program 1 times
[2025-03-03 09:42:31,258 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:42:31,258 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220726342]
[2025-03-03 09:42:31,258 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:31,258 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:42:31,272 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes.
[2025-03-03 09:42:31,287 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements.
[2025-03-03 09:42:31,287 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:31,287 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:31,417 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked.
[2025-03-03 09:42:31,417 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:42:31,417 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220726342]
[2025-03-03 09:42:31,417 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220726342] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:42:31,417 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:42:31,417 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 09:42:31,418 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118642784]
[2025-03-03 09:42:31,418 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:42:31,418 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 09:42:31,418 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:42:31,418 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 09:42:31,418 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:42:31,418 INFO  L87              Difference]: Start difference. First operand 136 states and 179 transitions. Second operand  has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states 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 09:42:31,514 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:31,514 INFO  L93              Difference]: Finished difference Result 438 states and 575 transitions.
[2025-03-03 09:42:31,514 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-03 09:42:31,515 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69
[2025-03-03 09:42:31,515 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:31,516 INFO  L225             Difference]: With dead ends: 438
[2025-03-03 09:42:31,516 INFO  L226             Difference]: Without dead ends: 318
[2025-03-03 09:42:31,516 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-03-03 09:42:31,517 INFO  L435           NwaCegarLoop]: 71 mSDtfsCounter, 162 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:31,517 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 187 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:42:31,517 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 318 states.
[2025-03-03 09:42:31,524 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 204.
[2025-03-03 09:42:31,525 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 204 states, 203 states have (on average 1.3300492610837438) internal successors, (270), 203 states have internal predecessors, (270), 0 states have call successors, (0), 0 states 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 09:42:31,526 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 270 transitions.
[2025-03-03 09:42:31,526 INFO  L78                 Accepts]: Start accepts. Automaton has 204 states and 270 transitions. Word has length 69
[2025-03-03 09:42:31,526 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:31,526 INFO  L471      AbstractCegarLoop]: Abstraction has 204 states and 270 transitions.
[2025-03-03 09:42:31,526 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states 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 09:42:31,526 INFO  L276                IsEmpty]: Start isEmpty. Operand 204 states and 270 transitions.
[2025-03-03 09:42:31,527 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 70
[2025-03-03 09:42:31,527 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:31,527 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 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 09:42:31,527 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 09:42:31,527 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:31,528 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:31,528 INFO  L85        PathProgramCache]: Analyzing trace with hash -1231122312, now seen corresponding path program 1 times
[2025-03-03 09:42:31,528 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:42:31,528 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445176334]
[2025-03-03 09:42:31,528 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:31,528 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:42:31,535 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes.
[2025-03-03 09:42:31,553 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements.
[2025-03-03 09:42:31,553 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:31,553 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:31,806 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2025-03-03 09:42:31,807 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:42:31,807 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445176334]
[2025-03-03 09:42:31,807 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445176334] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:42:31,807 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090937252]
[2025-03-03 09:42:31,807 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:31,807 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:31,807 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:42:31,809 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 09:42:31,810 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 09:42:31,841 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes.
[2025-03-03 09:42:31,933 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements.
[2025-03-03 09:42:31,933 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:31,933 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:31,936 INFO  L256         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 17 conjuncts are in the unsatisfiable core
[2025-03-03 09:42:31,937 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:42:32,032 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked.
[2025-03-03 09:42:32,032 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 09:42:32,190 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked.
[2025-03-03 09:42:32,190 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090937252] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 09:42:32,190 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 09:42:32,190 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15
[2025-03-03 09:42:32,190 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051896507]
[2025-03-03 09:42:32,191 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 09:42:32,191 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-03-03 09:42:32,191 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:42:32,191 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-03-03 09:42:32,191 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210
[2025-03-03 09:42:32,192 INFO  L87              Difference]: Start difference. First operand 204 states and 270 transitions. Second operand  has 15 states, 15 states have (on average 8.2) internal successors, (123), 15 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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 09:42:32,886 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:32,886 INFO  L93              Difference]: Finished difference Result 906 states and 1171 transitions.
[2025-03-03 09:42:32,886 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. 
[2025-03-03 09:42:32,886 INFO  L78                 Accepts]: Start accepts. Automaton has  has 15 states, 15 states have (on average 8.2) internal successors, (123), 15 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69
[2025-03-03 09:42:32,887 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:32,890 INFO  L225             Difference]: With dead ends: 906
[2025-03-03 09:42:32,890 INFO  L226             Difference]: Without dead ends: 895
[2025-03-03 09:42:32,891 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=484, Invalid=1496, Unknown=0, NotChecked=0, Total=1980
[2025-03-03 09:42:32,892 INFO  L435           NwaCegarLoop]: 81 mSDtfsCounter, 353 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:32,892 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 862 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 09:42:32,893 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 895 states.
[2025-03-03 09:42:32,925 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 377.
[2025-03-03 09:42:32,926 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 377 states, 376 states have (on average 1.3404255319148937) internal successors, (504), 376 states have internal predecessors, (504), 0 states have call successors, (0), 0 states 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 09:42:32,927 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 504 transitions.
[2025-03-03 09:42:32,928 INFO  L78                 Accepts]: Start accepts. Automaton has 377 states and 504 transitions. Word has length 69
[2025-03-03 09:42:32,928 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:32,929 INFO  L471      AbstractCegarLoop]: Abstraction has 377 states and 504 transitions.
[2025-03-03 09:42:32,929 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 8.2) internal successors, (123), 15 states have internal predecessors, (123), 0 states have call successors, (0), 0 states 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 09:42:32,929 INFO  L276                IsEmpty]: Start isEmpty. Operand 377 states and 504 transitions.
[2025-03-03 09:42:32,930 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2025-03-03 09:42:32,930 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:32,930 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 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 09:42:32,936 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 09:42:33,131 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:33,131 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:33,131 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:33,132 INFO  L85        PathProgramCache]: Analyzing trace with hash -1590617783, now seen corresponding path program 1 times
[2025-03-03 09:42:33,132 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:42:33,132 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418181529]
[2025-03-03 09:42:33,132 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:33,132 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:42:33,137 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes.
[2025-03-03 09:42:33,143 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements.
[2025-03-03 09:42:33,144 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:33,144 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:33,221 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked.
[2025-03-03 09:42:33,221 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:42:33,222 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418181529]
[2025-03-03 09:42:33,222 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418181529] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:42:33,222 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:42:33,222 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 09:42:33,222 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328766145]
[2025-03-03 09:42:33,222 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:42:33,222 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:42:33,222 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:42:33,223 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:42:33,223 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 09:42:33,223 INFO  L87              Difference]: Start difference. First operand 377 states and 504 transitions. Second operand  has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 09:42:33,253 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:33,253 INFO  L93              Difference]: Finished difference Result 388 states and 518 transitions.
[2025-03-03 09:42:33,253 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 09:42:33,254 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70
[2025-03-03 09:42:33,254 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:33,255 INFO  L225             Difference]: With dead ends: 388
[2025-03-03 09:42:33,255 INFO  L226             Difference]: Without dead ends: 380
[2025-03-03 09:42:33,255 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 09:42:33,255 INFO  L435           NwaCegarLoop]: 57 mSDtfsCounter, 3 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:33,256 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 159 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 09:42:33,256 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 380 states.
[2025-03-03 09:42:33,267 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 378.
[2025-03-03 09:42:33,268 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 378 states, 377 states have (on average 1.339522546419098) internal successors, (505), 377 states have internal predecessors, (505), 0 states have call successors, (0), 0 states 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 09:42:33,269 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 505 transitions.
[2025-03-03 09:42:33,269 INFO  L78                 Accepts]: Start accepts. Automaton has 378 states and 505 transitions. Word has length 70
[2025-03-03 09:42:33,269 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:33,269 INFO  L471      AbstractCegarLoop]: Abstraction has 378 states and 505 transitions.
[2025-03-03 09:42:33,269 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 09:42:33,269 INFO  L276                IsEmpty]: Start isEmpty. Operand 378 states and 505 transitions.
[2025-03-03 09:42:33,270 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2025-03-03 09:42:33,270 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:33,270 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 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 09:42:33,270 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-03 09:42:33,270 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:33,270 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:33,271 INFO  L85        PathProgramCache]: Analyzing trace with hash -1720570790, now seen corresponding path program 1 times
[2025-03-03 09:42:33,271 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:42:33,271 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583819862]
[2025-03-03 09:42:33,271 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:33,271 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:42:33,276 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes.
[2025-03-03 09:42:33,286 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements.
[2025-03-03 09:42:33,286 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:33,287 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:33,622 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked.
[2025-03-03 09:42:33,622 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:42:33,622 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583819862]
[2025-03-03 09:42:33,622 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583819862] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:42:33,622 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346224471]
[2025-03-03 09:42:33,622 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:33,622 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:33,622 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:42:33,624 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 09:42:33,626 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 09:42:33,656 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes.
[2025-03-03 09:42:33,722 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements.
[2025-03-03 09:42:33,723 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:33,723 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:33,724 INFO  L256         TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-03-03 09:42:33,725 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:42:33,777 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked.
[2025-03-03 09:42:33,777 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:42:33,777 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [346224471] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:42:33,777 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:42:33,777 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12
[2025-03-03 09:42:33,777 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069789607]
[2025-03-03 09:42:33,777 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:42:33,777 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 09:42:33,777 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:42:33,778 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 09:42:33,778 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132
[2025-03-03 09:42:33,778 INFO  L87              Difference]: Start difference. First operand 378 states and 505 transitions. Second operand  has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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 09:42:33,821 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:33,821 INFO  L93              Difference]: Finished difference Result 388 states and 517 transitions.
[2025-03-03 09:42:33,821 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 09:42:33,822 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71
[2025-03-03 09:42:33,822 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:33,823 INFO  L225             Difference]: With dead ends: 388
[2025-03-03 09:42:33,823 INFO  L226             Difference]: Without dead ends: 383
[2025-03-03 09:42:33,823 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132
[2025-03-03 09:42:33,824 INFO  L435           NwaCegarLoop]: 56 mSDtfsCounter, 4 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:33,825 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 208 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 09:42:33,825 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 383 states.
[2025-03-03 09:42:33,840 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 380.
[2025-03-03 09:42:33,843 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 380 states, 379 states have (on average 1.3403693931398417) internal successors, (508), 379 states have internal predecessors, (508), 0 states have call successors, (0), 0 states 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 09:42:33,844 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 508 transitions.
[2025-03-03 09:42:33,844 INFO  L78                 Accepts]: Start accepts. Automaton has 380 states and 508 transitions. Word has length 71
[2025-03-03 09:42:33,844 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:33,844 INFO  L471      AbstractCegarLoop]: Abstraction has 380 states and 508 transitions.
[2025-03-03 09:42:33,844 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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 09:42:33,844 INFO  L276                IsEmpty]: Start isEmpty. Operand 380 states and 508 transitions.
[2025-03-03 09:42:33,846 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2025-03-03 09:42:33,848 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:33,848 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 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 09:42:33,854 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2025-03-03 09:42:34,048 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,SelfDestructingSolverStorable13
[2025-03-03 09:42:34,049 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:34,049 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:34,049 INFO  L85        PathProgramCache]: Analyzing trace with hash 1179979294, now seen corresponding path program 1 times
[2025-03-03 09:42:34,050 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:42:34,050 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856383049]
[2025-03-03 09:42:34,050 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:34,050 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:42:34,056 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes.
[2025-03-03 09:42:34,077 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements.
[2025-03-03 09:42:34,077 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:34,077 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:34,182 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked.
[2025-03-03 09:42:34,182 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:42:34,182 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856383049]
[2025-03-03 09:42:34,182 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856383049] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:42:34,182 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:42:34,182 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 09:42:34,182 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730521135]
[2025-03-03 09:42:34,182 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:42:34,183 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:42:34,183 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:42:34,183 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:42:34,183 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 09:42:34,183 INFO  L87              Difference]: Start difference. First operand 380 states and 508 transitions. Second operand  has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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 09:42:34,215 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:34,216 INFO  L93              Difference]: Finished difference Result 391 states and 522 transitions.
[2025-03-03 09:42:34,216 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 09:42:34,216 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71
[2025-03-03 09:42:34,216 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:34,217 INFO  L225             Difference]: With dead ends: 391
[2025-03-03 09:42:34,217 INFO  L226             Difference]: Without dead ends: 383
[2025-03-03 09:42:34,218 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 09:42:34,218 INFO  L435           NwaCegarLoop]: 61 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:34,218 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 166 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 09:42:34,218 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 383 states.
[2025-03-03 09:42:34,242 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 381.
[2025-03-03 09:42:34,243 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 381 states, 380 states have (on average 1.3394736842105264) internal successors, (509), 380 states have internal predecessors, (509), 0 states have call successors, (0), 0 states 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 09:42:34,244 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 509 transitions.
[2025-03-03 09:42:34,244 INFO  L78                 Accepts]: Start accepts. Automaton has 381 states and 509 transitions. Word has length 71
[2025-03-03 09:42:34,244 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:34,244 INFO  L471      AbstractCegarLoop]: Abstraction has 381 states and 509 transitions.
[2025-03-03 09:42:34,245 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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 09:42:34,245 INFO  L276                IsEmpty]: Start isEmpty. Operand 381 states and 509 transitions.
[2025-03-03 09:42:34,246 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2025-03-03 09:42:34,247 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:34,248 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 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 09:42:34,248 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-03 09:42:34,248 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:34,248 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:34,248 INFO  L85        PathProgramCache]: Analyzing trace with hash 609128768, now seen corresponding path program 1 times
[2025-03-03 09:42:34,248 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:42:34,248 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281748209]
[2025-03-03 09:42:34,248 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:34,249 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:42:34,256 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes.
[2025-03-03 09:42:34,264 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements.
[2025-03-03 09:42:34,264 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:34,264 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:34,360 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked.
[2025-03-03 09:42:34,360 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:42:34,360 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281748209]
[2025-03-03 09:42:34,360 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281748209] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:42:34,360 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784442352]
[2025-03-03 09:42:34,360 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:34,361 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:34,361 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:42:34,362 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 09:42:34,365 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 09:42:34,394 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes.
[2025-03-03 09:42:34,413 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements.
[2025-03-03 09:42:34,413 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:34,413 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:34,414 INFO  L256         TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 9 conjuncts are in the unsatisfiable core
[2025-03-03 09:42:34,416 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:42:34,453 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked.
[2025-03-03 09:42:34,453 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 09:42:34,551 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 38 proven. 25 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2025-03-03 09:42:34,551 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [784442352] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 09:42:34,551 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 09:42:34,551 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 6] total 11
[2025-03-03 09:42:34,551 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403928804]
[2025-03-03 09:42:34,551 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 09:42:34,552 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-03-03 09:42:34,552 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:42:34,552 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-03-03 09:42:34,552 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2025-03-03 09:42:34,552 INFO  L87              Difference]: Start difference. First operand 381 states and 509 transitions. Second operand  has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:42:35,244 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:35,244 INFO  L93              Difference]: Finished difference Result 2067 states and 2948 transitions.
[2025-03-03 09:42:35,245 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2025-03-03 09:42:35,245 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71
[2025-03-03 09:42:35,245 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:35,250 INFO  L225             Difference]: With dead ends: 2067
[2025-03-03 09:42:35,250 INFO  L226             Difference]: Without dead ends: 1600
[2025-03-03 09:42:35,251 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600
[2025-03-03 09:42:35,252 INFO  L435           NwaCegarLoop]: 36 mSDtfsCounter, 284 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:35,252 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 216 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:42:35,253 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1600 states.
[2025-03-03 09:42:35,301 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1370.
[2025-03-03 09:42:35,303 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1370 states, 1369 states have (on average 1.320672023374726) internal successors, (1808), 1369 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states 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 09:42:35,306 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1808 transitions.
[2025-03-03 09:42:35,307 INFO  L78                 Accepts]: Start accepts. Automaton has 1370 states and 1808 transitions. Word has length 71
[2025-03-03 09:42:35,307 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:35,307 INFO  L471      AbstractCegarLoop]: Abstraction has 1370 states and 1808 transitions.
[2025-03-03 09:42:35,307 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:42:35,307 INFO  L276                IsEmpty]: Start isEmpty. Operand 1370 states and 1808 transitions.
[2025-03-03 09:42:35,308 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2025-03-03 09:42:35,308 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:35,309 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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 09:42:35,315 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 09:42:35,509 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2025-03-03 09:42:35,509 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:35,510 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:35,510 INFO  L85        PathProgramCache]: Analyzing trace with hash -1653032601, now seen corresponding path program 1 times
[2025-03-03 09:42:35,510 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:42:35,510 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639916661]
[2025-03-03 09:42:35,510 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:35,510 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:42:35,517 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes.
[2025-03-03 09:42:35,535 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements.
[2025-03-03 09:42:35,535 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:35,536 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:35,749 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 39 proven. 28 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2025-03-03 09:42:35,750 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:42:35,750 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639916661]
[2025-03-03 09:42:35,750 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639916661] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:42:35,750 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986917480]
[2025-03-03 09:42:35,750 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:35,750 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:35,750 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:42:35,752 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 09:42:35,753 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 09:42:35,786 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes.
[2025-03-03 09:42:35,855 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements.
[2025-03-03 09:42:35,855 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:35,855 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:35,858 INFO  L256         TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 10 conjuncts are in the unsatisfiable core
[2025-03-03 09:42:35,861 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:42:36,051 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 39 proven. 28 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2025-03-03 09:42:36,051 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 09:42:36,178 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2025-03-03 09:42:36,178 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986917480] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 09:42:36,178 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 09:42:36,179 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16
[2025-03-03 09:42:36,179 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003230086]
[2025-03-03 09:42:36,179 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 09:42:36,179 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2025-03-03 09:42:36,179 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:42:36,179 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2025-03-03 09:42:36,180 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240
[2025-03-03 09:42:36,180 INFO  L87              Difference]: Start difference. First operand 1370 states and 1808 transitions. Second operand  has 16 states, 16 states have (on average 9.6875) internal successors, (155), 16 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:42:37,463 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:37,464 INFO  L93              Difference]: Finished difference Result 5929 states and 7406 transitions.
[2025-03-03 09:42:37,464 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. 
[2025-03-03 09:42:37,464 INFO  L78                 Accepts]: Start accepts. Automaton has  has 16 states, 16 states have (on average 9.6875) internal successors, (155), 16 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72
[2025-03-03 09:42:37,464 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:37,482 INFO  L225             Difference]: With dead ends: 5929
[2025-03-03 09:42:37,483 INFO  L226             Difference]: Without dead ends: 5924
[2025-03-03 09:42:37,485 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=697, Invalid=2273, Unknown=0, NotChecked=0, Total=2970
[2025-03-03 09:42:37,486 INFO  L435           NwaCegarLoop]: 106 mSDtfsCounter, 600 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:37,486 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 1064 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 09:42:37,490 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5924 states.
[2025-03-03 09:42:37,600 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5924 to 1749.
[2025-03-03 09:42:37,602 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1749 states, 1748 states have (on average 1.3724256292906178) internal successors, (2399), 1748 states have internal predecessors, (2399), 0 states have call successors, (0), 0 states 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 09:42:37,606 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 2399 transitions.
[2025-03-03 09:42:37,607 INFO  L78                 Accepts]: Start accepts. Automaton has 1749 states and 2399 transitions. Word has length 72
[2025-03-03 09:42:37,607 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:37,607 INFO  L471      AbstractCegarLoop]: Abstraction has 1749 states and 2399 transitions.
[2025-03-03 09:42:37,607 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 9.6875) internal successors, (155), 16 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:42:37,607 INFO  L276                IsEmpty]: Start isEmpty. Operand 1749 states and 2399 transitions.
[2025-03-03 09:42:37,608 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2025-03-03 09:42:37,608 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:37,608 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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 09:42:37,615 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2025-03-03 09:42:37,813 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:37,813 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:37,813 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:37,813 INFO  L85        PathProgramCache]: Analyzing trace with hash -1139226050, now seen corresponding path program 1 times
[2025-03-03 09:42:37,813 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:42:37,813 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27426248]
[2025-03-03 09:42:37,813 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:37,814 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:42:37,820 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes.
[2025-03-03 09:42:37,841 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements.
[2025-03-03 09:42:37,841 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:37,841 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:37,939 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked.
[2025-03-03 09:42:37,939 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:42:37,939 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27426248]
[2025-03-03 09:42:37,939 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27426248] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:42:37,939 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:42:37,940 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-03 09:42:37,940 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63692959]
[2025-03-03 09:42:37,940 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:42:37,940 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 09:42:37,940 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:42:37,940 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 09:42:37,940 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-03-03 09:42:37,940 INFO  L87              Difference]: Start difference. First operand 1749 states and 2399 transitions. Second operand  has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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 09:42:38,331 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:38,331 INFO  L93              Difference]: Finished difference Result 5090 states and 7061 transitions.
[2025-03-03 09:42:38,331 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-03 09:42:38,332 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72
[2025-03-03 09:42:38,332 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:38,341 INFO  L225             Difference]: With dead ends: 5090
[2025-03-03 09:42:38,342 INFO  L226             Difference]: Without dead ends: 3777
[2025-03-03 09:42:38,344 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2025-03-03 09:42:38,344 INFO  L435           NwaCegarLoop]: 94 mSDtfsCounter, 277 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:38,345 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 422 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 09:42:38,347 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3777 states.
[2025-03-03 09:42:38,418 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3777 to 1749.
[2025-03-03 09:42:38,420 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1749 states, 1748 states have (on average 1.3718535469107551) internal successors, (2398), 1748 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states 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 09:42:38,424 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 2398 transitions.
[2025-03-03 09:42:38,424 INFO  L78                 Accepts]: Start accepts. Automaton has 1749 states and 2398 transitions. Word has length 72
[2025-03-03 09:42:38,424 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:38,424 INFO  L471      AbstractCegarLoop]: Abstraction has 1749 states and 2398 transitions.
[2025-03-03 09:42:38,425 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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 09:42:38,425 INFO  L276                IsEmpty]: Start isEmpty. Operand 1749 states and 2398 transitions.
[2025-03-03 09:42:38,426 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2025-03-03 09:42:38,426 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:38,426 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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 09:42:38,426 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-03 09:42:38,426 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:38,427 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:38,427 INFO  L85        PathProgramCache]: Analyzing trace with hash 743656413, now seen corresponding path program 1 times
[2025-03-03 09:42:38,427 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:42:38,427 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250065955]
[2025-03-03 09:42:38,427 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:38,427 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:42:38,433 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes.
[2025-03-03 09:42:38,452 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements.
[2025-03-03 09:42:38,452 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:38,452 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:38,624 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked.
[2025-03-03 09:42:38,625 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:42:38,625 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250065955]
[2025-03-03 09:42:38,625 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250065955] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:42:38,625 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018279730]
[2025-03-03 09:42:38,625 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:38,625 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:38,625 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:42:38,627 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 09:42:38,628 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 09:42:38,660 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes.
[2025-03-03 09:42:38,754 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements.
[2025-03-03 09:42:38,754 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:38,754 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:38,755 INFO  L256         TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 17 conjuncts are in the unsatisfiable core
[2025-03-03 09:42:38,758 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:42:38,835 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 64 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-03-03 09:42:38,835 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 09:42:38,937 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 21 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-03-03 09:42:38,938 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018279730] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 09:42:38,938 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 09:42:38,938 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14
[2025-03-03 09:42:38,938 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958542433]
[2025-03-03 09:42:38,938 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 09:42:38,938 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-03-03 09:42:38,938 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:42:38,939 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-03-03 09:42:38,939 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182
[2025-03-03 09:42:38,939 INFO  L87              Difference]: Start difference. First operand 1749 states and 2398 transitions. Second operand  has 14 states, 14 states have (on average 10.214285714285714) internal successors, (143), 14 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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 09:42:39,310 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:39,311 INFO  L93              Difference]: Finished difference Result 3708 states and 4916 transitions.
[2025-03-03 09:42:39,311 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-03-03 09:42:39,311 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 14 states have (on average 10.214285714285714) internal successors, (143), 14 states have internal predecessors, (143), 0 states have call successors, (0), 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 73
[2025-03-03 09:42:39,311 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:39,316 INFO  L225             Difference]: With dead ends: 3708
[2025-03-03 09:42:39,316 INFO  L226             Difference]: Without dead ends: 1982
[2025-03-03 09:42:39,319 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650
[2025-03-03 09:42:39,319 INFO  L435           NwaCegarLoop]: 97 mSDtfsCounter, 353 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:39,319 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 577 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 09:42:39,321 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1982 states.
[2025-03-03 09:42:39,373 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1427.
[2025-03-03 09:42:39,375 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1427 states, 1426 states have (on average 1.326788218793829) internal successors, (1892), 1426 states have internal predecessors, (1892), 0 states have call successors, (0), 0 states 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 09:42:39,377 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1892 transitions.
[2025-03-03 09:42:39,379 INFO  L78                 Accepts]: Start accepts. Automaton has 1427 states and 1892 transitions. Word has length 73
[2025-03-03 09:42:39,379 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:39,379 INFO  L471      AbstractCegarLoop]: Abstraction has 1427 states and 1892 transitions.
[2025-03-03 09:42:39,379 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 10.214285714285714) internal successors, (143), 14 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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 09:42:39,379 INFO  L276                IsEmpty]: Start isEmpty. Operand 1427 states and 1892 transitions.
[2025-03-03 09:42:39,380 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2025-03-03 09:42:39,380 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:39,380 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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 09:42:39,387 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2025-03-03 09:42:39,581 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:39,581 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:39,581 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:39,581 INFO  L85        PathProgramCache]: Analyzing trace with hash -1446740419, now seen corresponding path program 2 times
[2025-03-03 09:42:39,582 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:42:39,582 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899016698]
[2025-03-03 09:42:39,582 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-03-03 09:42:39,582 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:42:39,592 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes.
[2025-03-03 09:42:39,611 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements.
[2025-03-03 09:42:39,611 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-03-03 09:42:39,611 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:39,826 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 5 proven. 73 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-03 09:42:39,827 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:42:39,827 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899016698]
[2025-03-03 09:42:39,827 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899016698] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:42:39,827 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109067490]
[2025-03-03 09:42:39,827 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-03-03 09:42:39,827 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:39,827 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:42:39,829 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 09:42:39,831 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 09:42:39,862 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes.
[2025-03-03 09:42:39,973 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements.
[2025-03-03 09:42:39,973 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-03-03 09:42:39,973 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:39,974 INFO  L256         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 23 conjuncts are in the unsatisfiable core
[2025-03-03 09:42:39,976 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:42:40,139 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 59 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-03 09:42:40,139 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 09:42:40,499 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-03 09:42:40,499 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [109067490] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 09:42:40,499 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 09:42:40,500 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 24
[2025-03-03 09:42:40,500 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116643647]
[2025-03-03 09:42:40,500 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 09:42:40,500 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2025-03-03 09:42:40,500 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:42:40,500 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2025-03-03 09:42:40,501 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552
[2025-03-03 09:42:40,501 INFO  L87              Difference]: Start difference. First operand 1427 states and 1892 transitions. Second operand  has 24 states, 24 states have (on average 8.583333333333334) internal successors, (206), 24 states have internal predecessors, (206), 0 states have call successors, (0), 0 states 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 09:42:44,312 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:44,313 INFO  L93              Difference]: Finished difference Result 10492 states and 13361 transitions.
[2025-03-03 09:42:44,313 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. 
[2025-03-03 09:42:44,313 INFO  L78                 Accepts]: Start accepts. Automaton has  has 24 states, 24 states have (on average 8.583333333333334) internal successors, (206), 24 states have internal predecessors, (206), 0 states have call successors, (0), 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 73
[2025-03-03 09:42:44,313 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:44,335 INFO  L225             Difference]: With dead ends: 10492
[2025-03-03 09:42:44,335 INFO  L226             Difference]: Without dead ends: 10474
[2025-03-03 09:42:44,342 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5706 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2403, Invalid=14889, Unknown=0, NotChecked=0, Total=17292
[2025-03-03 09:42:44,343 INFO  L435           NwaCegarLoop]: 188 mSDtfsCounter, 1134 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:44,344 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 1870 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1676 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-03 09:42:44,353 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10474 states.
[2025-03-03 09:42:44,568 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10474 to 4943.
[2025-03-03 09:42:44,573 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4943 states, 4942 states have (on average 1.388101983002833) internal successors, (6860), 4942 states have internal predecessors, (6860), 0 states have call successors, (0), 0 states 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 09:42:44,581 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4943 states to 4943 states and 6860 transitions.
[2025-03-03 09:42:44,582 INFO  L78                 Accepts]: Start accepts. Automaton has 4943 states and 6860 transitions. Word has length 73
[2025-03-03 09:42:44,582 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:44,582 INFO  L471      AbstractCegarLoop]: Abstraction has 4943 states and 6860 transitions.
[2025-03-03 09:42:44,582 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 24 states have (on average 8.583333333333334) internal successors, (206), 24 states have internal predecessors, (206), 0 states have call successors, (0), 0 states 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 09:42:44,582 INFO  L276                IsEmpty]: Start isEmpty. Operand 4943 states and 6860 transitions.
[2025-03-03 09:42:44,606 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2025-03-03 09:42:44,606 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:44,607 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:44,614 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2025-03-03 09:42:44,807 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:44,808 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:44,808 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:44,808 INFO  L85        PathProgramCache]: Analyzing trace with hash 1633746444, now seen corresponding path program 1 times
[2025-03-03 09:42:44,808 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:42:44,808 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422032871]
[2025-03-03 09:42:44,808 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:44,808 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:42:44,814 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes.
[2025-03-03 09:42:44,831 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements.
[2025-03-03 09:42:44,831 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:44,831 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:45,073 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 1 proven. 60 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2025-03-03 09:42:45,073 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:42:45,073 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422032871]
[2025-03-03 09:42:45,073 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422032871] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:42:45,073 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676572955]
[2025-03-03 09:42:45,073 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:45,073 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:45,073 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:42:45,076 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:42:45,085 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2025-03-03 09:42:45,118 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes.
[2025-03-03 09:42:45,200 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements.
[2025-03-03 09:42:45,200 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:45,200 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:45,204 INFO  L256         TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjuncts are in the unsatisfiable core
[2025-03-03 09:42:45,206 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:42:45,357 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 1 proven. 60 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2025-03-03 09:42:45,357 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 09:42:45,517 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2025-03-03 09:42:45,517 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676572955] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 09:42:45,517 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 09:42:45,517 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21
[2025-03-03 09:42:45,518 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694388126]
[2025-03-03 09:42:45,518 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 09:42:45,518 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2025-03-03 09:42:45,518 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:42:45,518 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2025-03-03 09:42:45,519 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420
[2025-03-03 09:42:45,519 INFO  L87              Difference]: Start difference. First operand 4943 states and 6860 transitions. Second operand  has 21 states, 21 states have (on average 8.285714285714286) internal successors, (174), 21 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 09:42:46,662 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:46,663 INFO  L93              Difference]: Finished difference Result 9920 states and 13202 transitions.
[2025-03-03 09:42:46,663 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. 
[2025-03-03 09:42:46,663 INFO  L78                 Accepts]: Start accepts. Automaton has  has 21 states, 21 states have (on average 8.285714285714286) internal successors, (174), 21 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 75
[2025-03-03 09:42:46,663 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:46,678 INFO  L225             Difference]: With dead ends: 9920
[2025-03-03 09:42:46,678 INFO  L226             Difference]: Without dead ends: 9898
[2025-03-03 09:42:46,680 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=543, Invalid=2319, Unknown=0, NotChecked=0, Total=2862
[2025-03-03 09:42:46,680 INFO  L435           NwaCegarLoop]: 161 mSDtfsCounter, 398 mSDsluCounter, 1233 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:46,680 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 1394 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 09:42:46,685 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9898 states.
[2025-03-03 09:42:46,927 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9898 to 5549.
[2025-03-03 09:42:46,934 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5549 states, 5548 states have (on average 1.3767123287671232) internal successors, (7638), 5548 states have internal predecessors, (7638), 0 states have call successors, (0), 0 states 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 09:42:46,944 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5549 states to 5549 states and 7638 transitions.
[2025-03-03 09:42:46,945 INFO  L78                 Accepts]: Start accepts. Automaton has 5549 states and 7638 transitions. Word has length 75
[2025-03-03 09:42:46,945 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:46,945 INFO  L471      AbstractCegarLoop]: Abstraction has 5549 states and 7638 transitions.
[2025-03-03 09:42:46,946 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 21 states, 21 states have (on average 8.285714285714286) internal successors, (174), 21 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 09:42:46,946 INFO  L276                IsEmpty]: Start isEmpty. Operand 5549 states and 7638 transitions.
[2025-03-03 09:42:46,949 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-03-03 09:42:46,949 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:46,949 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:46,955 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2025-03-03 09:42:47,153 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20
[2025-03-03 09:42:47,153 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:47,153 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:47,153 INFO  L85        PathProgramCache]: Analyzing trace with hash 1145816546, now seen corresponding path program 1 times
[2025-03-03 09:42:47,153 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:42:47,153 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852795333]
[2025-03-03 09:42:47,153 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:47,154 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:42:47,159 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-03-03 09:42:47,192 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-03-03 09:42:47,192 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:47,193 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-03 09:42:47,193 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-03 09:42:47,195 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-03-03 09:42:47,221 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-03-03 09:42:47,221 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:47,221 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-03 09:42:47,241 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-03 09:42:47,241 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-03-03 09:42:47,241 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-03 09:42:47,243 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-03-03 09:42:47,247 INFO  L422         BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:42:47,307 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-03 09:42:47,310 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:42:47 BoogieIcfgContainer
[2025-03-03 09:42:47,310 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-03 09:42:47,311 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-03 09:42:47,311 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-03 09:42:47,311 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-03 09:42:47,312 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:42:27" (3/4) ...
[2025-03-03 09:42:47,313 INFO  L149         WitnessPrinter]: No result that supports witness generation found
[2025-03-03 09:42:47,314 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-03 09:42:47,316 INFO  L158              Benchmark]: Toolchain (without parser) took 20486.17ms. Allocated memory was 142.6MB in the beginning and 511.7MB in the end (delta: 369.1MB). Free memory was 112.3MB in the beginning and 395.4MB in the end (delta: -283.2MB). Peak memory consumption was 88.7MB. Max. memory is 16.1GB.
[2025-03-03 09:42:47,316 INFO  L158              Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 09:42:47,316 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 220.04ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 98.6MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-03 09:42:47,317 INFO  L158              Benchmark]: Boogie Procedure Inliner took 44.98ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 96.1MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-03 09:42:47,317 INFO  L158              Benchmark]: Boogie Preprocessor took 41.23ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 93.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 09:42:47,317 INFO  L158              Benchmark]: IcfgBuilder took 398.75ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 71.4MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-03-03 09:42:47,317 INFO  L158              Benchmark]: TraceAbstraction took 19772.55ms. Allocated memory was 142.6MB in the beginning and 511.7MB in the end (delta: 369.1MB). Free memory was 70.9MB in the beginning and 395.6MB in the end (delta: -324.6MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB.
[2025-03-03 09:42:47,317 INFO  L158              Benchmark]: Witness Printer took 3.13ms. Allocated memory is still 511.7MB. Free memory was 395.6MB in the beginning and 395.4MB in the end (delta: 147.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-03 09:42:47,318 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 220.04ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 98.6MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 44.98ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 96.1MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 41.23ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 93.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 398.75ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 71.4MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * TraceAbstraction took 19772.55ms. Allocated memory was 142.6MB in the beginning and 511.7MB in the end (delta: 369.1MB). Free memory was 70.9MB in the beginning and 395.6MB in the end (delta: -324.6MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB.
 * Witness Printer took 3.13ms. Allocated memory is still 511.7MB. Free memory was 395.6MB in the beginning and 395.4MB in the end (delta: 147.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - UnprovableResult [Line: 25]: Unable to prove that a call to reach_error is unreachable
    Unable to prove that a call to reach_error is unreachable
 Reason: overapproximation of bitwiseOr at line 116, overapproximation of bitwiseOr at line 116. 
Possible FailurePath: 
[L124]              unsigned int a, b, r;
[L125]              a = __VERIFIER_nondet_uint()
[L127]              b = 234770789
[L129]  CALL, EXPR  mp_add(a, b)
[L42]               unsigned char a0, a1, a2, a3;
[L43]               unsigned char b0, b1, b2, b3;
[L44]               unsigned char r0, r1, r2, r3;
[L45]               unsigned short carry;
[L46]               unsigned short partial_sum;
[L47]               unsigned int r;
[L48]               unsigned char i;
[L49]               unsigned char na, nb;
[L50]               a0 = a
[L51]               a1 = a >> 8
[L52]               a2 = a >> 16U
[L53]               a3 = a >> 24U
[L54]               b0 = b
[L55]               b1 = b >> 8U
[L56]               b2 = b >> 16U
[L57]               b3 = b >> 24U
[L58]               na = (unsigned char)4
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, na=4]
[L59]   COND TRUE   a3 == (unsigned char)0
[L60]               na = na - 1
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, na=3]
[L61]   COND TRUE   a2 == (unsigned char)0
[L62]               na = na - 1
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, na=2]
[L63]   COND TRUE   a1 == (unsigned char)0
[L64]               na = na - 1
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, na=1]
[L68]               nb = (unsigned char)4
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, na=1, nb=4]
[L69]   COND FALSE  !(b3 == (unsigned char)0)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, na=1, nb=4]
[L78]               carry = (unsigned short)0
[L79]               i = (unsigned char)0
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4]
[L80]   COND TRUE   (i < na) || (i < nb) || (carry != (unsigned short)0)
[L81]               partial_sum = carry
[L82]               carry = (unsigned short)0
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0]
[L83]   COND TRUE   i < na
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0]
[L84]   COND TRUE   i == (unsigned char)0
[L84]               partial_sum = partial_sum + a0
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=155]
[L85]   COND FALSE  !(i == (unsigned char)1)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=155]
[L86]   COND FALSE  !(i == (unsigned char)2)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=155]
[L87]   COND FALSE  !(i == (unsigned char)3)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=155]
[L89]   COND TRUE   i < nb
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=155]
[L90]   COND TRUE   i == (unsigned char)0
[L90]               partial_sum = partial_sum + b0
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=256]
[L91]   COND FALSE  !(i == (unsigned char)1)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=256]
[L92]   COND FALSE  !(i == (unsigned char)2)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=256]
[L93]   COND FALSE  !(i == (unsigned char)3)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=256]
[L95]   COND TRUE   partial_sum > ((unsigned char)255)
[L96]               partial_sum = partial_sum & ((unsigned char)255)
[L97]               carry = (unsigned short)1
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=0]
[L99]   COND TRUE   i == (unsigned char)0
[L99]               r0 = (unsigned char)partial_sum
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0]
[L100]  COND FALSE  !(i == (unsigned char)1)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0]
[L101]  COND FALSE  !(i == (unsigned char)2)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0]
[L102]  COND FALSE  !(i == (unsigned char)3)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0]
[L104]              i = i + (unsigned char)1
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=0]
[L80]   COND TRUE   (i < na) || (i < nb) || (carry != (unsigned short)0)
[L81]               partial_sum = carry
[L82]               carry = (unsigned short)0
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0]
[L83]   COND FALSE  !(i < na)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0]
[L89]   COND TRUE   i < nb
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0]
[L90]   COND FALSE  !(i == (unsigned char)0)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0]
[L91]   COND TRUE   i == (unsigned char)1
[L91]               partial_sum = partial_sum + b1
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0]
[L92]   COND FALSE  !(i == (unsigned char)2)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0]
[L93]   COND FALSE  !(i == (unsigned char)3)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0]
[L95]   COND FALSE  !(partial_sum > ((unsigned char)255))
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0]
[L99]   COND FALSE  !(i == (unsigned char)0)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0]
[L100]  COND TRUE   i == (unsigned char)1
[L100]              r1 = (unsigned char)partial_sum
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0, r1=82]
[L101]  COND FALSE  !(i == (unsigned char)2)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0, r1=82]
[L102]  COND FALSE  !(i == (unsigned char)3)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0, r1=82]
[L104]              i = i + (unsigned char)1
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=82, r0=0, r1=82]
[L80]   COND TRUE   (i < na) || (i < nb) || (carry != (unsigned short)0)
[L81]               partial_sum = carry
[L82]               carry = (unsigned short)0
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=82]
[L83]   COND FALSE  !(i < na)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=82]
[L89]   COND TRUE   i < nb
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=82]
[L90]   COND FALSE  !(i == (unsigned char)0)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=82]
[L91]   COND FALSE  !(i == (unsigned char)1)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=82]
[L92]   COND TRUE   i == (unsigned char)2
[L92]               partial_sum = partial_sum + b2
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82]
[L93]   COND FALSE  !(i == (unsigned char)3)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82]
[L95]   COND FALSE  !(partial_sum > ((unsigned char)255))
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82]
[L99]   COND FALSE  !(i == (unsigned char)0)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82]
[L100]  COND FALSE  !(i == (unsigned char)1)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82]
[L101]  COND TRUE   i == (unsigned char)2
[L101]              r2 = (unsigned char)partial_sum
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82, r2=254]
[L102]  COND FALSE  !(i == (unsigned char)3)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82, r2=254]
[L104]              i = i + (unsigned char)1
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=254, r0=0, r1=82, r2=254]
[L80]   COND TRUE   (i < na) || (i < nb) || (carry != (unsigned short)0)
[L81]               partial_sum = carry
[L82]               carry = (unsigned short)0
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=82, r2=254]
[L83]   COND FALSE  !(i < na)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=82, r2=254]
[L89]   COND TRUE   i < nb
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=82, r2=254]
[L90]   COND FALSE  !(i == (unsigned char)0)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=82, r2=254]
[L91]   COND FALSE  !(i == (unsigned char)1)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=82, r2=254]
[L92]   COND FALSE  !(i == (unsigned char)2)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=82, r2=254]
[L93]   COND TRUE   i == (unsigned char)3
[L93]               partial_sum = partial_sum + b3
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=0, r1=82, r2=254]
[L95]   COND FALSE  !(partial_sum > ((unsigned char)255))
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=0, r1=82, r2=254]
[L99]   COND FALSE  !(i == (unsigned char)0)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=0, r1=82, r2=254]
[L100]  COND FALSE  !(i == (unsigned char)1)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=0, r1=82, r2=254]
[L101]  COND FALSE  !(i == (unsigned char)2)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=0, r1=82, r2=254]
[L102]  COND TRUE   i == (unsigned char)3
[L102]              r3 = (unsigned char)partial_sum
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, r0=0, r1=82, r2=254, r3=13]
[L104]              i = i + (unsigned char)1
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, r0=0, r1=82, r2=254, r3=13]
[L80]   COND FALSE  !((i < na) || (i < nb) || (carry != (unsigned short)0))
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, i=4, r0=0, r1=82, r2=254, r3=13]
[L107]  COND FALSE  !(i < (unsigned char)4)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, r0=0, r1=82, r2=254, r3=13]
[L116]  EXPR        r0 | (r1 << 8U)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, r2=254, r3=13]
[L116]  EXPR        r0 | (r1 << 8U) | (r2 << 16U)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, r3=13]
[L116]  EXPR        r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U)
        VAL         [a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13]
[L116]              r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U)
[L118]              return r;
        VAL         [\result=218103808, a0=155, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13]
[L129]  RET, EXPR   mp_add(a, b)
[L129]              r = mp_add(a, b)
[L131]  CALL        __VERIFIER_assert(r == a + b)
[L24]   COND TRUE   !(cond)
[L25]               reach_error()

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.7s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4137 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4137 mSDsluCounter, 8508 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6807 mSDsCounter, 317 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6600 IncrementalHoareTripleChecker+Invalid, 6917 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 317 mSolverCounterUnsat, 1701 mSDtfsCounter, 6600 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1417 GetRequests, 1030 SyntacticMatches, 3 SemanticMatches, 384 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7926 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5549occurred in iteration=21, InterpolantAutomatonStates: 333, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 17980 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 1836 NumberOfCodeBlocks, 1836 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2155 ConstructedInterpolants, 0 QuantifiedInterpolants, 10595 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1736 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 37 InterpolantComputations, 15 PerfectInterpolantSequences, 1484/2231 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2025-03-03 09:42:47,334 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis

### Bit-precise run ###
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/bitvector/byte_add_2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 32bit --witnessprinter.graph.data.programhash de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 09:42:49,154 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 09:42:49,236 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2025-03-03 09:42:49,244 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 09:42:49,244 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 09:42:49,258 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 09:42:49,258 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 09:42:49,258 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 09:42:49,258 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 09:42:49,258 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 09:42:49,258 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 09:42:49,258 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 09:42:49,259 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 09:42:49,259 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 09:42:49,259 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 09:42:49,259 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 09:42:49,259 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 09:42:49,259 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 09:42:49,259 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 09:42:49,259 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 09:42:49,259 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 09:42:49,259 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 09:42:49,259 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 09:42:49,259 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2025-03-03 09:42:49,259 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2025-03-03 09:42:49,259 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2025-03-03 09:42:49,259 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 09:42:49,259 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 09:42:49,259 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 09:42:49,260 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 09:42:49,260 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 09:42:49,260 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 09:42:49,260 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 09:42:49,260 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 09:42:49,260 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 09:42:49,261 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 09:42:49,261 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 09:42:49,262 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 09:42:49,262 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 09:42:49,262 INFO  L153        SettingsManager]:  * Trace refinement strategy=FOX
[2025-03-03 09:42:49,262 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2025-03-03 09:42:49,262 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 09:42:49,262 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 09:42:49,262 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 09:42:49,262 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 09:42:49,262 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 -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba
[2025-03-03 09:42:49,487 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 09:42:49,492 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 09:42:49,493 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 09:42:49,494 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 09:42:49,494 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 09:42:49,495 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-2.i
[2025-03-03 09:42:50,642 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c47a418eb/a1e00c5173ed4c53870dd2d9f34a3948/FLAG4d8f65886
[2025-03-03 09:42:50,840 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 09:42:50,841 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i
[2025-03-03 09:42:50,848 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c47a418eb/a1e00c5173ed4c53870dd2d9f34a3948/FLAG4d8f65886
[2025-03-03 09:42:50,863 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c47a418eb/a1e00c5173ed4c53870dd2d9f34a3948
[2025-03-03 09:42:50,865 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 09:42:50,866 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 09:42:50,867 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 09:42:50,868 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 09:42:50,871 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 09:42:50,872 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:42:50" (1/1) ...
[2025-03-03 09:42:50,873 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b359aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:50, skipping insertion in model container
[2025-03-03 09:42:50,874 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:42:50" (1/1) ...
[2025-03-03 09:42:50,888 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 09:42:50,998 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/bitvector/byte_add_2-2.i[1168,1181]
[2025-03-03 09:42:51,039 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 09:42:51,050 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 09:42:51,060 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/bitvector/byte_add_2-2.i[1168,1181]
[2025-03-03 09:42:51,081 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 09:42:51,093 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 09:42:51,094 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:51 WrapperNode
[2025-03-03 09:42:51,094 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 09:42:51,095 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 09:42:51,095 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 09:42:51,096 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 09:42:51,101 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:51" (1/1) ...
[2025-03-03 09:42:51,105 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:51" (1/1) ...
[2025-03-03 09:42:51,121 INFO  L138                Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 117
[2025-03-03 09:42:51,122 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 09:42:51,122 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 09:42:51,122 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 09:42:51,122 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 09:42:51,129 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:51" (1/1) ...
[2025-03-03 09:42:51,129 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:51" (1/1) ...
[2025-03-03 09:42:51,131 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:51" (1/1) ...
[2025-03-03 09:42:51,144 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 09:42:51,146 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:51" (1/1) ...
[2025-03-03 09:42:51,147 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:51" (1/1) ...
[2025-03-03 09:42:51,150 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:51" (1/1) ...
[2025-03-03 09:42:51,154 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:51" (1/1) ...
[2025-03-03 09:42:51,155 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:51" (1/1) ...
[2025-03-03 09:42:51,156 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:51" (1/1) ...
[2025-03-03 09:42:51,157 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 09:42:51,158 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 09:42:51,158 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 09:42:51,158 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 09:42:51,158 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:51" (1/1) ...
[2025-03-03 09:42:51,162 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 09:42:51,171 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:42:51,182 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 09:42:51,184 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 09:42:51,207 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 09:42:51,207 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2025-03-03 09:42:51,207 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 09:42:51,207 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 09:42:51,261 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 09:42:51,262 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 09:42:51,478 INFO  L?                        ?]: Removed 23 outVars from TransFormulas that were not future-live.
[2025-03-03 09:42:51,478 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 09:42:51,484 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 09:42:51,484 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 09:42:51,484 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:42:51 BoogieIcfgContainer
[2025-03-03 09:42:51,485 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 09:42:51,486 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 09:42:51,486 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 09:42:51,489 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 09:42:51,490 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:42:50" (1/3) ...
[2025-03-03 09:42:51,490 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3482d1ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:42:51, skipping insertion in model container
[2025-03-03 09:42:51,491 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:51" (2/3) ...
[2025-03-03 09:42:51,491 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3482d1ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:42:51, skipping insertion in model container
[2025-03-03 09:42:51,491 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:42:51" (3/3) ...
[2025-03-03 09:42:51,492 INFO  L128   eAbstractionObserver]: Analyzing ICFG byte_add_2-2.i
[2025-03-03 09:42:51,501 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 09:42:51,502 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG byte_add_2-2.i that has 1 procedures, 41 locations, 1 initial locations, 2 loop locations, and 1 error locations.
[2025-03-03 09:42:51,531 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 09:42:51,539 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;@b446b70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 09:42:51,539 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 09:42:51,542 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 41 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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 09:42:51,545 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2025-03-03 09:42:51,545 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:51,545 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:42:51,546 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:51,549 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:51,549 INFO  L85        PathProgramCache]: Analyzing trace with hash 1618197246, now seen corresponding path program 1 times
[2025-03-03 09:42:51,555 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 09:42:51,556 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1112234012]
[2025-03-03 09:42:51,556 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:51,556 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:51,556 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:42:51,560 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 09:42:51,561 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 09:42:51,611 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes.
[2025-03-03 09:42:51,619 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements.
[2025-03-03 09:42:51,620 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:51,620 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:51,621 INFO  L256         TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 09:42:51,624 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:42:51,657 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 09:42:51,657 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:42:51,658 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 09:42:51,658 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112234012]
[2025-03-03 09:42:51,658 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112234012] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:42:51,658 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:42:51,659 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:42:51,660 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52317112]
[2025-03-03 09:42:51,660 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:42:51,662 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:42:51,662 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 09:42:51,675 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:42:51,676 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:42:51,677 INFO  L87              Difference]: Start difference. First operand  has 41 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 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 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states 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 09:42:51,817 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:51,818 INFO  L93              Difference]: Finished difference Result 95 states and 164 transitions.
[2025-03-03 09:42:51,819 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:42:51,820 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11
[2025-03-03 09:42:51,820 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:51,825 INFO  L225             Difference]: With dead ends: 95
[2025-03-03 09:42:51,827 INFO  L226             Difference]: Without dead ends: 60
[2025-03-03 09:42:51,829 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:42:51,832 INFO  L435           NwaCegarLoop]: 42 mSDtfsCounter, 24 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:51,834 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 64 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:42:51,844 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 60 states.
[2025-03-03 09:42:51,875 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58.
[2025-03-03 09:42:51,876 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 58 states, 57 states have (on average 1.543859649122807) internal successors, (88), 57 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:42:51,880 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 88 transitions.
[2025-03-03 09:42:51,882 INFO  L78                 Accepts]: Start accepts. Automaton has 58 states and 88 transitions. Word has length 11
[2025-03-03 09:42:51,882 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:51,882 INFO  L471      AbstractCegarLoop]: Abstraction has 58 states and 88 transitions.
[2025-03-03 09:42:51,882 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states 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 09:42:51,882 INFO  L276                IsEmpty]: Start isEmpty. Operand 58 states and 88 transitions.
[2025-03-03 09:42:51,883 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2025-03-03 09:42:51,884 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:51,884 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:42:51,891 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-03 09:42:52,084 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
[2025-03-03 09:42:52,085 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:52,086 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:52,086 INFO  L85        PathProgramCache]: Analyzing trace with hash -1246514952, now seen corresponding path program 1 times
[2025-03-03 09:42:52,086 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 09:42:52,086 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [628010646]
[2025-03-03 09:42:52,086 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:52,086 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:52,086 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:42:52,088 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 09:42:52,089 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 09:42:52,124 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes.
[2025-03-03 09:42:52,136 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements.
[2025-03-03 09:42:52,136 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:52,136 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:52,137 INFO  L256         TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-03 09:42:52,138 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:42:52,170 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:42:52,170 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:42:52,171 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 09:42:52,171 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628010646]
[2025-03-03 09:42:52,171 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [628010646] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:42:52,171 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:42:52,171 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 09:42:52,171 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398884784]
[2025-03-03 09:42:52,171 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:42:52,171 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:42:52,172 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 09:42:52,172 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:42:52,172 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 09:42:52,172 INFO  L87              Difference]: Start difference. First operand 58 states and 88 transitions. Second operand  has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 09:42:52,318 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:52,318 INFO  L93              Difference]: Finished difference Result 157 states and 245 transitions.
[2025-03-03 09:42:52,318 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 09:42:52,318 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17
[2025-03-03 09:42:52,318 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:52,319 INFO  L225             Difference]: With dead ends: 157
[2025-03-03 09:42:52,319 INFO  L226             Difference]: Without dead ends: 108
[2025-03-03 09:42:52,321 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:42:52,321 INFO  L435           NwaCegarLoop]: 75 mSDtfsCounter, 55 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:52,321 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 147 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:42:52,322 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 108 states.
[2025-03-03 09:42:52,332 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104.
[2025-03-03 09:42:52,332 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 104 states, 103 states have (on average 1.5242718446601942) internal successors, (157), 103 states have internal predecessors, (157), 0 states have call successors, (0), 0 states 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 09:42:52,335 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 157 transitions.
[2025-03-03 09:42:52,336 INFO  L78                 Accepts]: Start accepts. Automaton has 104 states and 157 transitions. Word has length 17
[2025-03-03 09:42:52,336 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:52,336 INFO  L471      AbstractCegarLoop]: Abstraction has 104 states and 157 transitions.
[2025-03-03 09:42:52,336 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 09:42:52,336 INFO  L276                IsEmpty]: Start isEmpty. Operand 104 states and 157 transitions.
[2025-03-03 09:42:52,336 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2025-03-03 09:42:52,336 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:52,337 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:42:52,344 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 09:42:52,537 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:52,537 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:52,538 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:52,538 INFO  L85        PathProgramCache]: Analyzing trace with hash -224807756, now seen corresponding path program 1 times
[2025-03-03 09:42:52,538 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 09:42:52,538 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [969066296]
[2025-03-03 09:42:52,538 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:52,538 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:52,538 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:42:52,540 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 09:42:52,541 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 09:42:52,571 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes.
[2025-03-03 09:42:52,580 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements.
[2025-03-03 09:42:52,580 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:52,580 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:52,581 INFO  L256         TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-03 09:42:52,582 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:42:52,599 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:42:52,599 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:42:52,599 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 09:42:52,600 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969066296]
[2025-03-03 09:42:52,600 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [969066296] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:42:52,600 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:42:52,600 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 09:42:52,600 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910305316]
[2025-03-03 09:42:52,600 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:42:52,600 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:42:52,600 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 09:42:52,600 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:42:52,600 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 09:42:52,600 INFO  L87              Difference]: Start difference. First operand 104 states and 157 transitions. Second operand  has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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 09:42:52,711 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:52,712 INFO  L93              Difference]: Finished difference Result 285 states and 434 transitions.
[2025-03-03 09:42:52,712 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 09:42:52,712 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18
[2025-03-03 09:42:52,712 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:52,714 INFO  L225             Difference]: With dead ends: 285
[2025-03-03 09:42:52,714 INFO  L226             Difference]: Without dead ends: 198
[2025-03-03 09:42:52,714 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:42:52,715 INFO  L435           NwaCegarLoop]: 74 mSDtfsCounter, 41 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:52,715 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 145 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:42:52,718 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 198 states.
[2025-03-03 09:42:52,732 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 181.
[2025-03-03 09:42:52,733 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 181 states, 180 states have (on average 1.511111111111111) internal successors, (272), 180 states have internal predecessors, (272), 0 states have call successors, (0), 0 states 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 09:42:52,734 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 272 transitions.
[2025-03-03 09:42:52,734 INFO  L78                 Accepts]: Start accepts. Automaton has 181 states and 272 transitions. Word has length 18
[2025-03-03 09:42:52,734 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:52,734 INFO  L471      AbstractCegarLoop]: Abstraction has 181 states and 272 transitions.
[2025-03-03 09:42:52,734 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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 09:42:52,734 INFO  L276                IsEmpty]: Start isEmpty. Operand 181 states and 272 transitions.
[2025-03-03 09:42:52,737 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2025-03-03 09:42:52,737 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:52,737 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:42:52,742 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 09:42:52,937 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:52,938 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:52,939 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:52,939 INFO  L85        PathProgramCache]: Analyzing trace with hash 735493395, now seen corresponding path program 1 times
[2025-03-03 09:42:52,939 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 09:42:52,939 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1216390224]
[2025-03-03 09:42:52,939 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:52,939 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:52,939 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:42:52,941 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 09:42:52,941 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 09:42:52,970 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes.
[2025-03-03 09:42:52,977 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-03-03 09:42:52,977 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:52,977 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:52,978 INFO  L256         TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-03-03 09:42:52,980 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:42:52,993 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-03-03 09:42:52,993 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:42:52,993 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 09:42:52,993 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216390224]
[2025-03-03 09:42:52,993 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216390224] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:42:52,993 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:42:52,993 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:42:52,993 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660152612]
[2025-03-03 09:42:52,994 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:42:52,994 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:42:52,994 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 09:42:52,994 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:42:52,994 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:42:52,994 INFO  L87              Difference]: Start difference. First operand 181 states and 272 transitions. Second operand  has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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 09:42:53,001 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:53,001 INFO  L93              Difference]: Finished difference Result 186 states and 276 transitions.
[2025-03-03 09:42:53,001 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:42:53,002 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19
[2025-03-03 09:42:53,002 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:53,002 INFO  L225             Difference]: With dead ends: 186
[2025-03-03 09:42:53,002 INFO  L226             Difference]: Without dead ends: 91
[2025-03-03 09:42:53,003 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:42:53,003 INFO  L435           NwaCegarLoop]: 46 mSDtfsCounter, 40 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:53,003 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 49 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 09:42:53,004 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 91 states.
[2025-03-03 09:42:53,008 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91.
[2025-03-03 09:42:53,009 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 91 states, 90 states have (on average 1.4555555555555555) internal successors, (131), 90 states have internal predecessors, (131), 0 states have call successors, (0), 0 states 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 09:42:53,009 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions.
[2025-03-03 09:42:53,009 INFO  L78                 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 19
[2025-03-03 09:42:53,009 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:53,009 INFO  L471      AbstractCegarLoop]: Abstraction has 91 states and 131 transitions.
[2025-03-03 09:42:53,010 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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 09:42:53,010 INFO  L276                IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions.
[2025-03-03 09:42:53,010 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2025-03-03 09:42:53,010 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:53,010 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]
[2025-03-03 09:42:53,016 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 09:42:53,211 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
[2025-03-03 09:42:53,211 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:53,211 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:53,211 INFO  L85        PathProgramCache]: Analyzing trace with hash 915031114, now seen corresponding path program 1 times
[2025-03-03 09:42:53,212 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 09:42:53,212 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [823036194]
[2025-03-03 09:42:53,212 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:53,212 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:53,212 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:42:53,213 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 09:42:53,214 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 09:42:53,239 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-03-03 09:42:53,246 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-03-03 09:42:53,246 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:53,246 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:53,247 INFO  L256         TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 09:42:53,248 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:42:53,260 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:42:53,260 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:42:53,260 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 09:42:53,260 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823036194]
[2025-03-03 09:42:53,260 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [823036194] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:42:53,260 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:42:53,260 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:42:53,260 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485515469]
[2025-03-03 09:42:53,260 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:42:53,260 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:42:53,260 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 09:42:53,261 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:42:53,261 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:42:53,261 INFO  L87              Difference]: Start difference. First operand 91 states and 131 transitions. Second operand  has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states 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 09:42:53,272 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:53,273 INFO  L93              Difference]: Finished difference Result 118 states and 167 transitions.
[2025-03-03 09:42:53,273 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:42:53,273 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25
[2025-03-03 09:42:53,273 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:53,274 INFO  L225             Difference]: With dead ends: 118
[2025-03-03 09:42:53,274 INFO  L226             Difference]: Without dead ends: 113
[2025-03-03 09:42:53,274 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:42:53,274 INFO  L435           NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:53,274 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 09:42:53,275 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 113 states.
[2025-03-03 09:42:53,281 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113.
[2025-03-03 09:42:53,282 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 113 states, 112 states have (on average 1.4375) internal successors, (161), 112 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 09:42:53,283 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions.
[2025-03-03 09:42:53,283 INFO  L78                 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 25
[2025-03-03 09:42:53,283 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:53,285 INFO  L471      AbstractCegarLoop]: Abstraction has 113 states and 161 transitions.
[2025-03-03 09:42:53,286 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states 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 09:42:53,286 INFO  L276                IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions.
[2025-03-03 09:42:53,286 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2025-03-03 09:42:53,286 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:53,286 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:42:53,292 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 09:42:53,486 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
[2025-03-03 09:42:53,487 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:53,487 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:53,487 INFO  L85        PathProgramCache]: Analyzing trace with hash -881920245, now seen corresponding path program 1 times
[2025-03-03 09:42:53,487 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 09:42:53,487 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [465030368]
[2025-03-03 09:42:53,487 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:53,488 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:53,488 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:42:53,489 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 09:42:53,491 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 09:42:53,519 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-03-03 09:42:53,528 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-03-03 09:42:53,529 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:53,529 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:53,530 INFO  L256         TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-03-03 09:42:53,532 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:42:53,563 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:42:53,564 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:42:53,564 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 09:42:53,564 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465030368]
[2025-03-03 09:42:53,564 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [465030368] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:42:53,564 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:42:53,564 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 09:42:53,564 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240491304]
[2025-03-03 09:42:53,564 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:42:53,564 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 09:42:53,564 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 09:42:53,564 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 09:42:53,564 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:42:53,564 INFO  L87              Difference]: Start difference. First operand 113 states and 161 transitions. Second operand  has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states 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 09:42:53,667 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:53,667 INFO  L93              Difference]: Finished difference Result 218 states and 310 transitions.
[2025-03-03 09:42:53,667 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 09:42:53,667 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25
[2025-03-03 09:42:53,667 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:53,668 INFO  L225             Difference]: With dead ends: 218
[2025-03-03 09:42:53,668 INFO  L226             Difference]: Without dead ends: 170
[2025-03-03 09:42:53,668 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:42:53,669 INFO  L435           NwaCegarLoop]: 87 mSDtfsCounter, 101 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:53,669 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 204 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:42:53,669 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 170 states.
[2025-03-03 09:42:53,673 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 118.
[2025-03-03 09:42:53,674 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 118 states, 117 states have (on average 1.4188034188034189) internal successors, (166), 117 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 09:42:53,674 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions.
[2025-03-03 09:42:53,674 INFO  L78                 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 25
[2025-03-03 09:42:53,674 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:53,674 INFO  L471      AbstractCegarLoop]: Abstraction has 118 states and 166 transitions.
[2025-03-03 09:42:53,674 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states 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 09:42:53,674 INFO  L276                IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions.
[2025-03-03 09:42:53,675 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2025-03-03 09:42:53,675 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:53,675 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]
[2025-03-03 09:42:53,681 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 09:42:53,875 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:53,875 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:53,875 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:53,876 INFO  L85        PathProgramCache]: Analyzing trace with hash -565031190, now seen corresponding path program 1 times
[2025-03-03 09:42:53,876 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 09:42:53,876 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [112004285]
[2025-03-03 09:42:53,876 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:53,876 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:53,876 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:42:53,878 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 09:42:53,879 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 09:42:53,905 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes.
[2025-03-03 09:42:53,913 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements.
[2025-03-03 09:42:53,913 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:53,913 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:53,913 INFO  L256         TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-03-03 09:42:53,915 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:42:53,956 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:42:53,956 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:42:53,956 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 09:42:53,956 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112004285]
[2025-03-03 09:42:53,956 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [112004285] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:42:53,956 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:42:53,956 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-03 09:42:53,956 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109131709]
[2025-03-03 09:42:53,956 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:42:53,956 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 09:42:53,956 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 09:42:53,957 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 09:42:53,957 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-03-03 09:42:53,957 INFO  L87              Difference]: Start difference. First operand 118 states and 166 transitions. Second operand  has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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 09:42:54,152 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:54,152 INFO  L93              Difference]: Finished difference Result 264 states and 375 transitions.
[2025-03-03 09:42:54,152 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-03 09:42:54,153 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 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 26
[2025-03-03 09:42:54,153 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:54,153 INFO  L225             Difference]: With dead ends: 264
[2025-03-03 09:42:54,153 INFO  L226             Difference]: Without dead ends: 216
[2025-03-03 09:42:54,154 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-03-03 09:42:54,154 INFO  L435           NwaCegarLoop]: 119 mSDtfsCounter, 146 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:54,154 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 496 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 09:42:54,155 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 216 states.
[2025-03-03 09:42:54,160 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 163.
[2025-03-03 09:42:54,160 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 163 states, 162 states have (on average 1.4135802469135803) internal successors, (229), 162 states have internal predecessors, (229), 0 states have call successors, (0), 0 states 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 09:42:54,160 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 229 transitions.
[2025-03-03 09:42:54,161 INFO  L78                 Accepts]: Start accepts. Automaton has 163 states and 229 transitions. Word has length 26
[2025-03-03 09:42:54,161 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:54,161 INFO  L471      AbstractCegarLoop]: Abstraction has 163 states and 229 transitions.
[2025-03-03 09:42:54,161 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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 09:42:54,161 INFO  L276                IsEmpty]: Start isEmpty. Operand 163 states and 229 transitions.
[2025-03-03 09:42:54,161 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2025-03-03 09:42:54,161 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:54,161 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]
[2025-03-03 09:42:54,168 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 09:42:54,362 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:54,362 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:54,362 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:54,362 INFO  L85        PathProgramCache]: Analyzing trace with hash 1691879817, now seen corresponding path program 1 times
[2025-03-03 09:42:54,362 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 09:42:54,362 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1854860598]
[2025-03-03 09:42:54,363 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:54,363 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:54,363 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:42:54,364 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 09:42:54,366 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 09:42:54,391 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes.
[2025-03-03 09:42:54,399 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements.
[2025-03-03 09:42:54,399 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:54,399 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:54,400 INFO  L256         TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-03-03 09:42:54,401 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:42:54,439 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:42:54,439 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:42:54,439 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 09:42:54,439 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854860598]
[2025-03-03 09:42:54,440 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854860598] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:42:54,440 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:42:54,440 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 09:42:54,440 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597848204]
[2025-03-03 09:42:54,440 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:42:54,440 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 09:42:54,440 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 09:42:54,440 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 09:42:54,440 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:42:54,440 INFO  L87              Difference]: Start difference. First operand 163 states and 229 transitions. Second operand  has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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 09:42:54,581 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:54,581 INFO  L93              Difference]: Finished difference Result 263 states and 372 transitions.
[2025-03-03 09:42:54,582 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 09:42:54,582 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 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 26
[2025-03-03 09:42:54,582 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:54,583 INFO  L225             Difference]: With dead ends: 263
[2025-03-03 09:42:54,583 INFO  L226             Difference]: Without dead ends: 215
[2025-03-03 09:42:54,583 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:42:54,583 INFO  L435           NwaCegarLoop]: 91 mSDtfsCounter, 118 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:54,583 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 297 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:42:54,584 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 215 states.
[2025-03-03 09:42:54,588 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 158.
[2025-03-03 09:42:54,588 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 158 states, 157 states have (on average 1.4203821656050954) internal successors, (223), 157 states have internal predecessors, (223), 0 states have call successors, (0), 0 states 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 09:42:54,589 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 223 transitions.
[2025-03-03 09:42:54,589 INFO  L78                 Accepts]: Start accepts. Automaton has 158 states and 223 transitions. Word has length 26
[2025-03-03 09:42:54,589 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:54,589 INFO  L471      AbstractCegarLoop]: Abstraction has 158 states and 223 transitions.
[2025-03-03 09:42:54,589 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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 09:42:54,589 INFO  L276                IsEmpty]: Start isEmpty. Operand 158 states and 223 transitions.
[2025-03-03 09:42:54,590 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2025-03-03 09:42:54,590 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:54,590 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 09:42:54,596 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 09:42:54,790 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
[2025-03-03 09:42:54,790 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:54,791 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:54,791 INFO  L85        PathProgramCache]: Analyzing trace with hash 1423691043, now seen corresponding path program 1 times
[2025-03-03 09:42:54,791 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 09:42:54,791 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1918549441]
[2025-03-03 09:42:54,791 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:54,791 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:54,791 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:42:54,792 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 09:42:54,793 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 09:42:54,825 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes.
[2025-03-03 09:42:54,831 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements.
[2025-03-03 09:42:54,832 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:54,832 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:54,832 INFO  L256         TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-03 09:42:54,833 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:42:54,862 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:42:54,862 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 09:42:54,898 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:42:54,899 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 09:42:54,899 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918549441]
[2025-03-03 09:42:54,899 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918549441] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 09:42:54,899 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-03-03 09:42:54,899 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6
[2025-03-03 09:42:54,899 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111007577]
[2025-03-03 09:42:54,899 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-03-03 09:42:54,899 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 09:42:54,899 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 09:42:54,899 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 09:42:54,899 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:42:54,899 INFO  L87              Difference]: Start difference. First operand 158 states and 223 transitions. Second operand  has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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 09:42:55,046 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:55,046 INFO  L93              Difference]: Finished difference Result 602 states and 909 transitions.
[2025-03-03 09:42:55,046 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 09:42:55,046 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 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 09:42:55,046 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:55,048 INFO  L225             Difference]: With dead ends: 602
[2025-03-03 09:42:55,048 INFO  L226             Difference]: Without dead ends: 444
[2025-03-03 09:42:55,048 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42
[2025-03-03 09:42:55,048 INFO  L435           NwaCegarLoop]: 19 mSDtfsCounter, 114 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:55,049 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 60 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:42:55,049 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 444 states.
[2025-03-03 09:42:55,057 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 334.
[2025-03-03 09:42:55,057 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 334 states, 333 states have (on average 1.4804804804804805) internal successors, (493), 333 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:42:55,058 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 493 transitions.
[2025-03-03 09:42:55,058 INFO  L78                 Accepts]: Start accepts. Automaton has 334 states and 493 transitions. Word has length 28
[2025-03-03 09:42:55,058 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:55,058 INFO  L471      AbstractCegarLoop]: Abstraction has 334 states and 493 transitions.
[2025-03-03 09:42:55,059 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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 09:42:55,059 INFO  L276                IsEmpty]: Start isEmpty. Operand 334 states and 493 transitions.
[2025-03-03 09:42:55,060 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2025-03-03 09:42:55,060 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:55,060 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-03 09:42:55,065 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2025-03-03 09:42:55,260 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:55,260 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:55,261 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:55,261 INFO  L85        PathProgramCache]: Analyzing trace with hash 1905812996, now seen corresponding path program 1 times
[2025-03-03 09:42:55,261 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 09:42:55,261 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [901697980]
[2025-03-03 09:42:55,261 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:55,261 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:55,261 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:42:55,263 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:42:55,263 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2025-03-03 09:42:55,288 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes.
[2025-03-03 09:42:55,300 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements.
[2025-03-03 09:42:55,301 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:55,301 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:55,302 INFO  L256         TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-03 09:42:55,303 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:42:55,320 INFO  L134       CoverageAnalysis]: Checked inductivity of 70 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-03-03 09:42:55,320 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:42:55,321 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 09:42:55,321 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901697980]
[2025-03-03 09:42:55,321 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [901697980] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:42:55,321 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:42:55,321 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 09:42:55,321 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098349705]
[2025-03-03 09:42:55,321 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:42:55,321 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:42:55,321 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 09:42:55,322 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:42:55,322 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 09:42:55,322 INFO  L87              Difference]: Start difference. First operand 334 states and 493 transitions. Second operand  has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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 09:42:55,373 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:55,373 INFO  L93              Difference]: Finished difference Result 904 states and 1335 transitions.
[2025-03-03 09:42:55,374 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 09:42:55,374 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 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 64
[2025-03-03 09:42:55,374 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:55,376 INFO  L225             Difference]: With dead ends: 904
[2025-03-03 09:42:55,376 INFO  L226             Difference]: Without dead ends: 592
[2025-03-03 09:42:55,376 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 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 09:42:55,377 INFO  L435           NwaCegarLoop]: 61 mSDtfsCounter, 25 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:55,377 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 144 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 09:42:55,377 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 592 states.
[2025-03-03 09:42:55,395 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 474.
[2025-03-03 09:42:55,396 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 474 states, 473 states have (on average 1.5052854122621564) internal successors, (712), 473 states have internal predecessors, (712), 0 states have call successors, (0), 0 states 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 09:42:55,397 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 712 transitions.
[2025-03-03 09:42:55,398 INFO  L78                 Accepts]: Start accepts. Automaton has 474 states and 712 transitions. Word has length 64
[2025-03-03 09:42:55,398 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:55,398 INFO  L471      AbstractCegarLoop]: Abstraction has 474 states and 712 transitions.
[2025-03-03 09:42:55,398 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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 09:42:55,398 INFO  L276                IsEmpty]: Start isEmpty. Operand 474 states and 712 transitions.
[2025-03-03 09:42:55,399 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2025-03-03 09:42:55,399 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:55,399 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 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]
[2025-03-03 09:42:55,404 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2025-03-03 09:42:55,603 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:55,603 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:55,604 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:55,604 INFO  L85        PathProgramCache]: Analyzing trace with hash 1838806243, now seen corresponding path program 2 times
[2025-03-03 09:42:55,604 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 09:42:55,604 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [656589326]
[2025-03-03 09:42:55,604 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-03-03 09:42:55,604 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:55,604 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:42:55,607 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:42:55,608 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2025-03-03 09:42:55,638 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes.
[2025-03-03 09:42:55,652 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements.
[2025-03-03 09:42:55,652 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-03-03 09:42:55,652 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:55,653 INFO  L256         TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-03-03 09:42:55,655 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:42:55,768 INFO  L134       CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-03-03 09:42:55,768 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 09:42:55,963 INFO  L134       CoverageAnalysis]: Checked inductivity of 70 backedges. 22 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:42:55,963 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 09:42:55,963 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656589326]
[2025-03-03 09:42:55,963 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [656589326] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 09:42:55,963 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-03-03 09:42:55,963 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12
[2025-03-03 09:42:55,963 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279220227]
[2025-03-03 09:42:55,963 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-03-03 09:42:55,963 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-03-03 09:42:55,963 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 09:42:55,964 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-03-03 09:42:55,964 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132
[2025-03-03 09:42:55,964 INFO  L87              Difference]: Start difference. First operand 474 states and 712 transitions. Second operand  has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:42:56,170 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:56,170 INFO  L93              Difference]: Finished difference Result 1053 states and 1613 transitions.
[2025-03-03 09:42:56,171 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-03 09:42:56,171 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64
[2025-03-03 09:42:56,171 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:56,173 INFO  L225             Difference]: With dead ends: 1053
[2025-03-03 09:42:56,173 INFO  L226             Difference]: Without dead ends: 592
[2025-03-03 09:42:56,173 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240
[2025-03-03 09:42:56,174 INFO  L435           NwaCegarLoop]: 20 mSDtfsCounter, 181 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:56,174 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 88 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:42:56,174 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 592 states.
[2025-03-03 09:42:56,191 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 519.
[2025-03-03 09:42:56,192 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 519 states, 518 states have (on average 1.4015444015444016) internal successors, (726), 518 states have internal predecessors, (726), 0 states have call successors, (0), 0 states 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 09:42:56,195 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 726 transitions.
[2025-03-03 09:42:56,196 INFO  L78                 Accepts]: Start accepts. Automaton has 519 states and 726 transitions. Word has length 64
[2025-03-03 09:42:56,196 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:56,196 INFO  L471      AbstractCegarLoop]: Abstraction has 519 states and 726 transitions.
[2025-03-03 09:42:56,196 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:42:56,196 INFO  L276                IsEmpty]: Start isEmpty. Operand 519 states and 726 transitions.
[2025-03-03 09:42:56,197 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2025-03-03 09:42:56,197 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:56,198 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 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 09:42:56,203 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0
[2025-03-03 09:42:56,402 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:56,402 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:56,402 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:56,402 INFO  L85        PathProgramCache]: Analyzing trace with hash -1161600097, now seen corresponding path program 1 times
[2025-03-03 09:42:56,402 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 09:42:56,403 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [919252942]
[2025-03-03 09:42:56,403 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:56,403 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:56,403 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:42:56,404 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:42:56,405 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2025-03-03 09:42:56,442 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes.
[2025-03-03 09:42:56,456 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements.
[2025-03-03 09:42:56,456 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:56,456 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:56,457 INFO  L256         TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-03-03 09:42:56,458 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:42:56,515 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked.
[2025-03-03 09:42:56,516 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 09:42:56,575 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked.
[2025-03-03 09:42:56,575 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 09:42:56,575 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919252942]
[2025-03-03 09:42:56,575 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [919252942] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 09:42:56,575 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-03-03 09:42:56,575 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8
[2025-03-03 09:42:56,575 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066875020]
[2025-03-03 09:42:56,575 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-03-03 09:42:56,576 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 09:42:56,576 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 09:42:56,576 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 09:42:56,576 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2025-03-03 09:42:56,576 INFO  L87              Difference]: Start difference. First operand 519 states and 726 transitions. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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 09:42:56,902 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:56,903 INFO  L93              Difference]: Finished difference Result 1391 states and 1974 transitions.
[2025-03-03 09:42:56,903 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-03-03 09:42:56,903 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 68
[2025-03-03 09:42:56,903 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:56,906 INFO  L225             Difference]: With dead ends: 1391
[2025-03-03 09:42:56,906 INFO  L226             Difference]: Without dead ends: 884
[2025-03-03 09:42:56,906 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182
[2025-03-03 09:42:56,907 INFO  L435           NwaCegarLoop]: 39 mSDtfsCounter, 236 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:56,907 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 139 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 09:42:56,907 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 884 states.
[2025-03-03 09:42:56,925 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 831.
[2025-03-03 09:42:56,926 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 831 states, 830 states have (on average 1.3240963855421686) internal successors, (1099), 830 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states 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 09:42:56,928 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1099 transitions.
[2025-03-03 09:42:56,928 INFO  L78                 Accepts]: Start accepts. Automaton has 831 states and 1099 transitions. Word has length 68
[2025-03-03 09:42:56,928 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:56,928 INFO  L471      AbstractCegarLoop]: Abstraction has 831 states and 1099 transitions.
[2025-03-03 09:42:56,929 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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 09:42:56,929 INFO  L276                IsEmpty]: Start isEmpty. Operand 831 states and 1099 transitions.
[2025-03-03 09:42:56,931 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 70
[2025-03-03 09:42:56,932 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:56,932 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 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 09:42:56,938 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0
[2025-03-03 09:42:57,133 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:57,133 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:57,133 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:57,134 INFO  L85        PathProgramCache]: Analyzing trace with hash -71338400, now seen corresponding path program 1 times
[2025-03-03 09:42:57,134 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 09:42:57,134 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [352678632]
[2025-03-03 09:42:57,134 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:42:57,134 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:57,134 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:42:57,136 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:42:57,138 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2025-03-03 09:42:57,163 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes.
[2025-03-03 09:42:57,176 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements.
[2025-03-03 09:42:57,176 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:42:57,177 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:57,178 INFO  L256         TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-03-03 09:42:57,179 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:42:57,265 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked.
[2025-03-03 09:42:57,265 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 09:42:57,337 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked.
[2025-03-03 09:42:57,337 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 09:42:57,337 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352678632]
[2025-03-03 09:42:57,337 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [352678632] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 09:42:57,337 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-03-03 09:42:57,337 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10
[2025-03-03 09:42:57,337 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901688337]
[2025-03-03 09:42:57,338 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-03-03 09:42:57,338 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-03 09:42:57,338 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 09:42:57,338 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-03 09:42:57,338 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2025-03-03 09:42:57,338 INFO  L87              Difference]: Start difference. First operand 831 states and 1099 transitions. Second operand  has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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 09:42:57,553 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:57,553 INFO  L93              Difference]: Finished difference Result 1225 states and 1572 transitions.
[2025-03-03 09:42:57,553 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-03-03 09:42:57,554 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69
[2025-03-03 09:42:57,554 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:57,556 INFO  L225             Difference]: With dead ends: 1225
[2025-03-03 09:42:57,556 INFO  L226             Difference]: Without dead ends: 1067
[2025-03-03 09:42:57,557 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306
[2025-03-03 09:42:57,557 INFO  L435           NwaCegarLoop]: 57 mSDtfsCounter, 180 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:57,557 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 233 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:42:57,559 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1067 states.
[2025-03-03 09:42:57,580 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 831.
[2025-03-03 09:42:57,581 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 831 states, 830 states have (on average 1.3228915662650602) internal successors, (1098), 830 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states 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 09:42:57,583 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1098 transitions.
[2025-03-03 09:42:57,584 INFO  L78                 Accepts]: Start accepts. Automaton has 831 states and 1098 transitions. Word has length 69
[2025-03-03 09:42:57,584 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:57,584 INFO  L471      AbstractCegarLoop]: Abstraction has 831 states and 1098 transitions.
[2025-03-03 09:42:57,584 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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 09:42:57,584 INFO  L276                IsEmpty]: Start isEmpty. Operand 831 states and 1098 transitions.
[2025-03-03 09:42:57,585 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 70
[2025-03-03 09:42:57,585 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:57,585 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-03 09:42:57,592 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0
[2025-03-03 09:42:57,786 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:57,787 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:57,787 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:57,787 INFO  L85        PathProgramCache]: Analyzing trace with hash 258427361, now seen corresponding path program 2 times
[2025-03-03 09:42:57,788 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 09:42:57,788 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [138718105]
[2025-03-03 09:42:57,788 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-03-03 09:42:57,788 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:57,788 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:42:57,791 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:42:57,794 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2025-03-03 09:42:57,831 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes.
[2025-03-03 09:42:57,849 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements.
[2025-03-03 09:42:57,850 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-03-03 09:42:57,850 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:57,851 INFO  L256         TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-03-03 09:42:57,852 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:42:57,981 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 66 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-03-03 09:42:57,981 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 09:42:58,042 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-03-03 09:42:58,042 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 09:42:58,043 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138718105]
[2025-03-03 09:42:58,043 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [138718105] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 09:42:58,043 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-03-03 09:42:58,043 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9
[2025-03-03 09:42:58,043 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607776353]
[2025-03-03 09:42:58,043 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-03-03 09:42:58,043 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-03 09:42:58,043 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 09:42:58,044 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-03 09:42:58,044 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2025-03-03 09:42:58,044 INFO  L87              Difference]: Start difference. First operand 831 states and 1098 transitions. Second operand  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:42:58,263 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:42:58,263 INFO  L93              Difference]: Finished difference Result 1805 states and 2323 transitions.
[2025-03-03 09:42:58,263 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-03-03 09:42:58,264 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69
[2025-03-03 09:42:58,264 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:42:58,267 INFO  L225             Difference]: With dead ends: 1805
[2025-03-03 09:42:58,267 INFO  L226             Difference]: Without dead ends: 1002
[2025-03-03 09:42:58,270 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272
[2025-03-03 09:42:58,270 INFO  L435           NwaCegarLoop]: 64 mSDtfsCounter, 162 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:42:58,270 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 267 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:42:58,272 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1002 states.
[2025-03-03 09:42:58,295 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 689.
[2025-03-03 09:42:58,296 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 689 states, 688 states have (on average 1.2906976744186047) internal successors, (888), 688 states have internal predecessors, (888), 0 states have call successors, (0), 0 states 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 09:42:58,297 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 888 transitions.
[2025-03-03 09:42:58,298 INFO  L78                 Accepts]: Start accepts. Automaton has 689 states and 888 transitions. Word has length 69
[2025-03-03 09:42:58,298 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:42:58,298 INFO  L471      AbstractCegarLoop]: Abstraction has 689 states and 888 transitions.
[2025-03-03 09:42:58,299 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:42:58,299 INFO  L276                IsEmpty]: Start isEmpty. Operand 689 states and 888 transitions.
[2025-03-03 09:42:58,299 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 70
[2025-03-03 09:42:58,300 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:42:58,300 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 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 09:42:58,309 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0
[2025-03-03 09:42:58,500 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:58,500 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:42:58,501 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:42:58,501 INFO  L85        PathProgramCache]: Analyzing trace with hash 191420608, now seen corresponding path program 3 times
[2025-03-03 09:42:58,501 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 09:42:58,501 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [622572252]
[2025-03-03 09:42:58,501 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-03-03 09:42:58,501 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:42:58,501 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:42:58,503 INFO  L229       MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:42:58,504 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2025-03-03 09:42:58,533 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 5 equivalence classes.
[2025-03-03 09:42:58,550 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 69 of 69 statements.
[2025-03-03 09:42:58,550 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s)
[2025-03-03 09:42:58,550 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:42:58,551 INFO  L256         TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 42 conjuncts are in the unsatisfiable core
[2025-03-03 09:42:58,554 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:43:00,675 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:43:00,676 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 09:43:02,320 INFO  L134       CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:43:02,321 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 09:43:02,321 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622572252]
[2025-03-03 09:43:02,321 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [622572252] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 09:43:02,321 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-03-03 09:43:02,321 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45
[2025-03-03 09:43:02,321 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665022443]
[2025-03-03 09:43:02,321 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-03-03 09:43:02,321 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 45 states
[2025-03-03 09:43:02,321 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 09:43:02,322 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants.
[2025-03-03 09:43:02,322 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1832, Unknown=0, NotChecked=0, Total=1980
[2025-03-03 09:43:02,322 INFO  L87              Difference]: Start difference. First operand 689 states and 888 transitions. Second operand  has 45 states, 45 states have (on average 3.022222222222222) internal successors, (136), 45 states have internal predecessors, (136), 0 states have call successors, (0), 0 states 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 09:43:10,516 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:43:10,516 INFO  L93              Difference]: Finished difference Result 1228 states and 1541 transitions.
[2025-03-03 09:43:10,516 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. 
[2025-03-03 09:43:10,516 INFO  L78                 Accepts]: Start accepts. Automaton has  has 45 states, 45 states have (on average 3.022222222222222) internal successors, (136), 45 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69
[2025-03-03 09:43:10,516 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:43:10,521 INFO  L225             Difference]: With dead ends: 1228
[2025-03-03 09:43:10,521 INFO  L226             Difference]: Without dead ends: 1115
[2025-03-03 09:43:10,525 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2214 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=1937, Invalid=10495, Unknown=0, NotChecked=0, Total=12432
[2025-03-03 09:43:10,526 INFO  L435           NwaCegarLoop]: 260 mSDtfsCounter, 1358 mSDsluCounter, 5498 mSDsCounter, 0 mSdLazyCounter, 3578 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1358 SdHoareTripleChecker+Valid, 5758 SdHoareTripleChecker+Invalid, 3659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 3578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-03-03 09:43:10,526 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1358 Valid, 5758 Invalid, 3659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 3578 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-03-03 09:43:10,527 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1115 states.
[2025-03-03 09:43:10,563 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 837.
[2025-03-03 09:43:10,563 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 837 states, 836 states have (on average 1.2751196172248804) internal successors, (1066), 836 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states 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 09:43:10,564 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1066 transitions.
[2025-03-03 09:43:10,565 INFO  L78                 Accepts]: Start accepts. Automaton has 837 states and 1066 transitions. Word has length 69
[2025-03-03 09:43:10,565 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:43:10,565 INFO  L471      AbstractCegarLoop]: Abstraction has 837 states and 1066 transitions.
[2025-03-03 09:43:10,565 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 45 states, 45 states have (on average 3.022222222222222) internal successors, (136), 45 states have internal predecessors, (136), 0 states have call successors, (0), 0 states 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 09:43:10,565 INFO  L276                IsEmpty]: Start isEmpty. Operand 837 states and 1066 transitions.
[2025-03-03 09:43:10,566 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2025-03-03 09:43:10,566 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:43:10,566 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-03 09:43:10,572 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0
[2025-03-03 09:43:10,766 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:43:10,767 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:43:10,767 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:43:10,767 INFO  L85        PathProgramCache]: Analyzing trace with hash 1207646010, now seen corresponding path program 1 times
[2025-03-03 09:43:10,767 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 09:43:10,767 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [751038615]
[2025-03-03 09:43:10,767 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:43:10,767 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:43:10,767 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:43:10,769 INFO  L229       MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:43:10,770 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process
[2025-03-03 09:43:10,796 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes.
[2025-03-03 09:43:10,812 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements.
[2025-03-03 09:43:10,812 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:43:10,812 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:43:10,813 INFO  L256         TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 44 conjuncts are in the unsatisfiable core
[2025-03-03 09:43:10,815 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:43:12,894 INFO  L134       CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:43:12,895 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 09:43:15,048 INFO  L134       CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:43:15,048 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 09:43:15,048 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751038615]
[2025-03-03 09:43:15,048 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [751038615] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 09:43:15,048 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-03-03 09:43:15,048 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 47
[2025-03-03 09:43:15,048 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991844306]
[2025-03-03 09:43:15,049 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-03-03 09:43:15,049 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 47 states
[2025-03-03 09:43:15,049 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 09:43:15,049 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants.
[2025-03-03 09:43:15,049 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2006, Unknown=0, NotChecked=0, Total=2162
[2025-03-03 09:43:15,050 INFO  L87              Difference]: Start difference. First operand 837 states and 1066 transitions. Second operand  has 47 states, 47 states have (on average 3.0638297872340425) internal successors, (144), 47 states have internal predecessors, (144), 0 states have call successors, (0), 0 states 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 09:43:47,730 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:43:47,730 INFO  L93              Difference]: Finished difference Result 2825 states and 3507 transitions.
[2025-03-03 09:43:47,730 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. 
[2025-03-03 09:43:47,730 INFO  L78                 Accepts]: Start accepts. Automaton has  has 47 states, 47 states have (on average 3.0638297872340425) internal successors, (144), 47 states have internal predecessors, (144), 0 states have call successors, (0), 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 73
[2025-03-03 09:43:47,731 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:43:47,739 INFO  L225             Difference]: With dead ends: 2825
[2025-03-03 09:43:47,739 INFO  L226             Difference]: Without dead ends: 2615
[2025-03-03 09:43:47,747 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18222 ImplicationChecksByTransitivity, 30.0s TimeCoverageRelationStatistics Valid=7334, Invalid=51472, Unknown=0, NotChecked=0, Total=58806
[2025-03-03 09:43:47,747 INFO  L435           NwaCegarLoop]: 553 mSDtfsCounter, 2003 mSDsluCounter, 10718 mSDsCounter, 0 mSdLazyCounter, 6834 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2003 SdHoareTripleChecker+Valid, 11271 SdHoareTripleChecker+Invalid, 7188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 6834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time
[2025-03-03 09:43:47,748 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2003 Valid, 11271 Invalid, 7188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 6834 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time]
[2025-03-03 09:43:47,749 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2615 states.
[2025-03-03 09:43:47,833 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2615 to 1667.
[2025-03-03 09:43:47,834 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1667 states, 1666 states have (on average 1.265906362545018) internal successors, (2109), 1666 states have internal predecessors, (2109), 0 states have call successors, (0), 0 states 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 09:43:47,836 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2109 transitions.
[2025-03-03 09:43:47,837 INFO  L78                 Accepts]: Start accepts. Automaton has 1667 states and 2109 transitions. Word has length 73
[2025-03-03 09:43:47,837 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:43:47,837 INFO  L471      AbstractCegarLoop]: Abstraction has 1667 states and 2109 transitions.
[2025-03-03 09:43:47,837 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 47 states, 47 states have (on average 3.0638297872340425) internal successors, (144), 47 states have internal predecessors, (144), 0 states have call successors, (0), 0 states 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 09:43:47,837 INFO  L276                IsEmpty]: Start isEmpty. Operand 1667 states and 2109 transitions.
[2025-03-03 09:43:47,838 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2025-03-03 09:43:47,839 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:43:47,839 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-03 09:43:47,845 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0
[2025-03-03 09:43:48,039 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:43:48,039 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:43:48,040 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:43:48,040 INFO  L85        PathProgramCache]: Analyzing trace with hash 1975421274, now seen corresponding path program 1 times
[2025-03-03 09:43:48,040 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 09:43:48,040 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [459491386]
[2025-03-03 09:43:48,040 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:43:48,040 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:43:48,040 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:43:48,042 INFO  L229       MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:43:48,043 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process
[2025-03-03 09:43:48,069 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes.
[2025-03-03 09:43:48,085 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements.
[2025-03-03 09:43:48,086 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:43:48,086 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:43:48,087 INFO  L256         TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 42 conjuncts are in the unsatisfiable core
[2025-03-03 09:43:48,089 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:43:50,166 INFO  L134       CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:43:50,166 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 09:43:52,140 INFO  L134       CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:43:52,140 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 09:43:52,140 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459491386]
[2025-03-03 09:43:52,141 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [459491386] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 09:43:52,141 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-03-03 09:43:52,141 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 47
[2025-03-03 09:43:52,141 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012438791]
[2025-03-03 09:43:52,141 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-03-03 09:43:52,141 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 47 states
[2025-03-03 09:43:52,141 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 09:43:52,141 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants.
[2025-03-03 09:43:52,142 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=2017, Unknown=0, NotChecked=0, Total=2162
[2025-03-03 09:43:52,142 INFO  L87              Difference]: Start difference. First operand 1667 states and 2109 transitions. Second operand  has 47 states, 47 states have (on average 3.0638297872340425) internal successors, (144), 47 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)