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


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


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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7fa1bdae56b6efd47000ddaf165b6bdba81ba7fc55edf9236eb8f83ebd1d8c6f
[2025-03-08 09:08:54,304 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 09:08:54,311 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 09:08:54,312 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 09:08:54,313 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 09:08:54,313 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 09:08:54,315 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.peg_solitaire.4.prop1-back-serstep.c
[2025-03-08 09:08:55,422 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67bc46cb1/79fa739279664de79bb9c47a4bb79cbf/FLAG9f7576e71
[2025-03-08 09:08:55,735 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 09:08:55,735 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.peg_solitaire.4.prop1-back-serstep.c
[2025-03-08 09:08:55,757 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67bc46cb1/79fa739279664de79bb9c47a4bb79cbf/FLAG9f7576e71
[2025-03-08 09:08:55,770 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67bc46cb1/79fa739279664de79bb9c47a4bb79cbf
[2025-03-08 09:08:55,772 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 09:08:55,774 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 09:08:55,775 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 09:08:55,775 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 09:08:55,779 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 09:08:55,779 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:08:55" (1/1) ...
[2025-03-08 09:08:55,780 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@747f5cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:08:55, skipping insertion in model container
[2025-03-08 09:08:55,780 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:08:55" (1/1) ...
[2025-03-08 09:08:55,831 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 09:08:55,975 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.peg_solitaire.4.prop1-back-serstep.c[1181,1194]
[2025-03-08 09:08:56,351 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 09:08:56,360 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 09:08:56,367 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.peg_solitaire.4.prop1-back-serstep.c[1181,1194]
[2025-03-08 09:08:56,607 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 09:08:56,618 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 09:08:56,619 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:08:56 WrapperNode
[2025-03-08 09:08:56,619 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 09:08:56,620 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 09:08:56,621 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 09:08:56,621 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 09:08:56,625 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:08:56" (1/1) ...
[2025-03-08 09:08:56,693 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:08:56" (1/1) ...
[2025-03-08 09:08:57,501 INFO  L138                Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 11502
[2025-03-08 09:08:57,502 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 09:08:57,502 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 09:08:57,503 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 09:08:57,503 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 09:08:57,508 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:08:56" (1/1) ...
[2025-03-08 09:08:57,509 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:08:56" (1/1) ...
[2025-03-08 09:08:57,704 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:08:56" (1/1) ...
[2025-03-08 09:08:57,880 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-08 09:08:57,880 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:08:56" (1/1) ...
[2025-03-08 09:08:57,881 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:08:56" (1/1) ...
[2025-03-08 09:08:58,109 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:08:56" (1/1) ...
[2025-03-08 09:08:58,146 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:08:56" (1/1) ...
[2025-03-08 09:08:58,198 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:08:56" (1/1) ...
[2025-03-08 09:08:58,237 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:08:56" (1/1) ...
[2025-03-08 09:08:58,409 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 09:08:58,410 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 09:08:58,410 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 09:08:58,410 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 09:08:58,411 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:08:56" (1/1) ...
[2025-03-08 09:08:58,415 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 09:08:58,423 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 09:08:58,435 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 09:08:58,437 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 09:08:58,455 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 09:08:58,455 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 09:08:58,456 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 09:08:58,456 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 09:08:59,031 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 09:08:59,033 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 09:09:09,504 INFO  L?                        ?]: Removed 6723 outVars from TransFormulas that were not future-live.
[2025-03-08 09:09:09,505 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 09:09:09,808 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 09:09:09,808 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 09:09:09,809 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:09:09 BoogieIcfgContainer
[2025-03-08 09:09:09,809 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 09:09:09,811 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 09:09:09,814 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 09:09:09,818 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 09:09:09,818 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:08:55" (1/3) ...
[2025-03-08 09:09:09,818 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbba10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:09:09, skipping insertion in model container
[2025-03-08 09:09:09,818 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:08:56" (2/3) ...
[2025-03-08 09:09:09,818 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbba10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:09:09, skipping insertion in model container
[2025-03-08 09:09:09,818 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:09:09" (3/3) ...
[2025-03-08 09:09:09,823 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.peg_solitaire.4.prop1-back-serstep.c
[2025-03-08 09:09:09,846 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 09:09:09,848 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.peg_solitaire.4.prop1-back-serstep.c that has 1 procedures, 3578 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 09:09:09,989 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 09:09:10,003 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;@593aeedf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 09:09:10,004 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 09:09:10,019 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 3578 states, 3576 states have (on average 1.4997203579418346) internal successors, (5363), 3577 states have internal predecessors, (5363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:09:10,053 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 294
[2025-03-08 09:09:10,054 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:09:10,058 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:09:10,058 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:09:10,068 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:09:10,069 INFO  L85        PathProgramCache]: Analyzing trace with hash 1391638474, now seen corresponding path program 1 times
[2025-03-08 09:09:10,074 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:09:10,077 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198664920]
[2025-03-08 09:09:10,077 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:09:10,078 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:09:10,246 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes.
[2025-03-08 09:09:10,454 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements.
[2025-03-08 09:09:10,455 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:09:10,455 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:09:11,302 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:09:11,303 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:09:11,303 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198664920]
[2025-03-08 09:09:11,303 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198664920] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:09:11,304 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:09:11,304 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 09:09:11,305 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989007485]
[2025-03-08 09:09:11,305 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:09:11,308 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 09:09:11,308 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:09:11,321 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 09:09:11,321 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:09:11,328 INFO  L87              Difference]: Start difference. First operand  has 3578 states, 3576 states have (on average 1.4997203579418346) internal successors, (5363), 3577 states have internal predecessors, (5363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 4 states, 4 states have (on average 73.25) internal successors, (293), 4 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:09:12,861 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:09:12,862 INFO  L93              Difference]: Finished difference Result 7037 states and 10551 transitions.
[2025-03-08 09:09:12,862 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 09:09:12,863 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 73.25) internal successors, (293), 4 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 293
[2025-03-08 09:09:12,866 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:09:12,886 INFO  L225             Difference]: With dead ends: 7037
[2025-03-08 09:09:12,887 INFO  L226             Difference]: Without dead ends: 3577
[2025-03-08 09:09:12,893 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:09:12,895 INFO  L435           NwaCegarLoop]: 4465 mSDtfsCounter, 0 mSDsluCounter, 8925 mSDsCounter, 0 mSdLazyCounter, 2686 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13390 SdHoareTripleChecker+Invalid, 2686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-08 09:09:12,895 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13390 Invalid, 2686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2686 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-08 09:09:12,909 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3577 states.
[2025-03-08 09:09:12,989 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3577 to 3577.
[2025-03-08 09:09:12,995 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3577 states, 3576 states have (on average 1.4991610738255035) internal successors, (5361), 3576 states have internal predecessors, (5361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:09:13,006 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 5361 transitions.
[2025-03-08 09:09:13,008 INFO  L78                 Accepts]: Start accepts. Automaton has 3577 states and 5361 transitions. Word has length 293
[2025-03-08 09:09:13,010 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:09:13,010 INFO  L471      AbstractCegarLoop]: Abstraction has 3577 states and 5361 transitions.
[2025-03-08 09:09:13,011 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 73.25) internal successors, (293), 4 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:09:13,011 INFO  L276                IsEmpty]: Start isEmpty. Operand 3577 states and 5361 transitions.
[2025-03-08 09:09:13,016 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 295
[2025-03-08 09:09:13,016 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:09:13,016 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:09:13,017 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-08 09:09:13,017 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:09:13,017 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:09:13,018 INFO  L85        PathProgramCache]: Analyzing trace with hash 195804115, now seen corresponding path program 1 times
[2025-03-08 09:09:13,018 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:09:13,018 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798774188]
[2025-03-08 09:09:13,019 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:09:13,019 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:09:13,076 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes.
[2025-03-08 09:09:13,115 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements.
[2025-03-08 09:09:13,115 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:09:13,115 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:09:13,442 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:09:13,442 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:09:13,442 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798774188]
[2025-03-08 09:09:13,442 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798774188] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:09:13,442 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:09:13,442 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 09:09:13,443 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406224724]
[2025-03-08 09:09:13,443 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:09:13,443 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 09:09:13,443 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:09:13,444 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 09:09:13,444 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:09:13,444 INFO  L87              Difference]: Start difference. First operand 3577 states and 5361 transitions. Second operand  has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:09:14,736 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:09:14,736 INFO  L93              Difference]: Finished difference Result 7038 states and 10549 transitions.
[2025-03-08 09:09:14,736 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 09:09:14,737 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 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 294
[2025-03-08 09:09:14,737 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:09:14,747 INFO  L225             Difference]: With dead ends: 7038
[2025-03-08 09:09:14,747 INFO  L226             Difference]: Without dead ends: 3579
[2025-03-08 09:09:14,751 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:09:14,752 INFO  L435           NwaCegarLoop]: 4465 mSDtfsCounter, 0 mSDsluCounter, 8922 mSDsCounter, 0 mSdLazyCounter, 2689 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13387 SdHoareTripleChecker+Invalid, 2689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-08 09:09:14,752 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13387 Invalid, 2689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2689 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-08 09:09:14,756 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3579 states.
[2025-03-08 09:09:14,797 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3579 to 3579.
[2025-03-08 09:09:14,802 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3579 states, 3578 states have (on average 1.4988820570150923) internal successors, (5363), 3578 states have internal predecessors, (5363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:09:14,810 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3579 states to 3579 states and 5363 transitions.
[2025-03-08 09:09:14,810 INFO  L78                 Accepts]: Start accepts. Automaton has 3579 states and 5363 transitions. Word has length 294
[2025-03-08 09:09:14,810 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:09:14,810 INFO  L471      AbstractCegarLoop]: Abstraction has 3579 states and 5363 transitions.
[2025-03-08 09:09:14,811 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:09:14,811 INFO  L276                IsEmpty]: Start isEmpty. Operand 3579 states and 5363 transitions.
[2025-03-08 09:09:14,813 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 296
[2025-03-08 09:09:14,813 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:09:14,813 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:09:14,813 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 09:09:14,813 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:09:14,816 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:09:14,817 INFO  L85        PathProgramCache]: Analyzing trace with hash -588492571, now seen corresponding path program 1 times
[2025-03-08 09:09:14,817 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:09:14,817 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363229671]
[2025-03-08 09:09:14,817 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:09:14,817 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:09:14,873 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes.
[2025-03-08 09:09:14,969 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements.
[2025-03-08 09:09:14,969 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:09:14,969 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:09:15,315 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:09:15,316 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:09:15,316 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363229671]
[2025-03-08 09:09:15,316 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363229671] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:09:15,316 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:09:15,316 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:09:15,316 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075237032]
[2025-03-08 09:09:15,317 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:09:15,317 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:09:15,318 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:09:15,318 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:09:15,318 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:09:15,318 INFO  L87              Difference]: Start difference. First operand 3579 states and 5363 transitions. Second operand  has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:09:17,282 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:09:17,282 INFO  L93              Difference]: Finished difference Result 10487 states and 15718 transitions.
[2025-03-08 09:09:17,283 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:09:17,283 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 295
[2025-03-08 09:09:17,284 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:09:17,302 INFO  L225             Difference]: With dead ends: 10487
[2025-03-08 09:09:17,302 INFO  L226             Difference]: Without dead ends: 7026
[2025-03-08 09:09:17,307 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:09:17,307 INFO  L435           NwaCegarLoop]: 4463 mSDtfsCounter, 5056 mSDsluCounter, 13238 mSDsCounter, 0 mSdLazyCounter, 3560 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5056 SdHoareTripleChecker+Valid, 17701 SdHoareTripleChecker+Invalid, 3560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-03-08 09:09:17,308 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [5056 Valid, 17701 Invalid, 3560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3560 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-03-08 09:09:17,314 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7026 states.
[2025-03-08 09:09:17,367 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7026 to 4033.
[2025-03-08 09:09:17,372 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4033 states, 4032 states have (on average 1.4987599206349207) internal successors, (6043), 4032 states have internal predecessors, (6043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:09:17,377 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4033 states to 4033 states and 6043 transitions.
[2025-03-08 09:09:17,377 INFO  L78                 Accepts]: Start accepts. Automaton has 4033 states and 6043 transitions. Word has length 295
[2025-03-08 09:09:17,378 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:09:17,378 INFO  L471      AbstractCegarLoop]: Abstraction has 4033 states and 6043 transitions.
[2025-03-08 09:09:17,378 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:09:17,378 INFO  L276                IsEmpty]: Start isEmpty. Operand 4033 states and 6043 transitions.
[2025-03-08 09:09:17,479 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 2025
[2025-03-08 09:09:17,479 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:09:17,481 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:09:17,481 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 09:09:17,482 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:09:17,483 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:09:17,484 INFO  L85        PathProgramCache]: Analyzing trace with hash 1122634925, now seen corresponding path program 1 times
[2025-03-08 09:09:17,484 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:09:17,484 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033087430]
[2025-03-08 09:09:17,484 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:09:17,484 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:09:18,205 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2024 statements into 1 equivalence classes.
[2025-03-08 09:09:19,726 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2024 of 2024 statements.
[2025-03-08 09:09:19,726 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:09:19,726 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:09:24,510 INFO  L134       CoverageAnalysis]: Checked inductivity of 232 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked.
[2025-03-08 09:09:24,510 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:09:24,510 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033087430]
[2025-03-08 09:09:24,510 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033087430] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:09:24,510 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:09:24,510 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:09:24,510 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205558790]
[2025-03-08 09:09:24,510 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:09:24,512 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:09:24,512 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:09:24,515 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:09:24,516 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:09:24,517 INFO  L87              Difference]: Start difference. First operand 4033 states and 6043 transitions. Second operand  has 5 states, 5 states have (on average 359.8) internal successors, (1799), 5 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:09:25,583 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:09:25,584 INFO  L93              Difference]: Finished difference Result 7498 states and 11235 transitions.
[2025-03-08 09:09:25,587 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 09:09:25,587 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 359.8) internal successors, (1799), 5 states have internal predecessors, (1799), 0 states have call successors, (0), 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 2024
[2025-03-08 09:09:25,590 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:09:25,601 INFO  L225             Difference]: With dead ends: 7498
[2025-03-08 09:09:25,601 INFO  L226             Difference]: Without dead ends: 4037
[2025-03-08 09:09:25,605 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-08 09:09:25,607 INFO  L435           NwaCegarLoop]: 4465 mSDtfsCounter, 0 mSDsluCounter, 8922 mSDsCounter, 0 mSdLazyCounter, 2690 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13387 SdHoareTripleChecker+Invalid, 2691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-08 09:09:25,608 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13387 Invalid, 2691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2690 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-08 09:09:25,614 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4037 states.
[2025-03-08 09:09:25,664 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4037 to 4033.
[2025-03-08 09:09:25,673 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4033 states, 4032 states have (on average 1.4987599206349207) internal successors, (6043), 4032 states have internal predecessors, (6043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:09:25,684 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4033 states to 4033 states and 6043 transitions.
[2025-03-08 09:09:25,684 INFO  L78                 Accepts]: Start accepts. Automaton has 4033 states and 6043 transitions. Word has length 2024
[2025-03-08 09:09:25,687 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:09:25,688 INFO  L471      AbstractCegarLoop]: Abstraction has 4033 states and 6043 transitions.
[2025-03-08 09:09:25,691 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 359.8) internal successors, (1799), 5 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:09:25,691 INFO  L276                IsEmpty]: Start isEmpty. Operand 4033 states and 6043 transitions.
[2025-03-08 09:09:25,747 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 2026
[2025-03-08 09:09:25,747 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:09:25,748 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:09:25,748 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 09:09:25,748 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:09:25,749 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:09:25,750 INFO  L85        PathProgramCache]: Analyzing trace with hash -1964655248, now seen corresponding path program 1 times
[2025-03-08 09:09:25,750 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:09:25,750 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760003107]
[2025-03-08 09:09:25,750 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:09:25,750 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:09:26,113 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2025 statements into 1 equivalence classes.
[2025-03-08 09:09:53,908 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2025 of 2025 statements.
[2025-03-08 09:09:53,909 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:09:53,909 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:09:56,929 INFO  L134       CoverageAnalysis]: Checked inductivity of 232 backedges. 58 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:09:56,930 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:09:56,930 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760003107]
[2025-03-08 09:09:56,930 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760003107] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 09:09:56,930 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896856151]
[2025-03-08 09:09:56,930 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:09:56,931 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 09:09:56,931 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 09:09:56,938 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 09:09:56,939 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-08 09:09:58,387 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2025 statements into 1 equivalence classes.
[2025-03-08 09:09:59,570 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2025 of 2025 statements.
[2025-03-08 09:09:59,570 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:09:59,570 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:09:59,631 INFO  L256         TraceCheckSpWp]: Trace formula consists of 11423 conjuncts, 33 conjuncts are in the unsatisfiable core
[2025-03-08 09:09:59,683 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 09:10:05,928 INFO  L134       CoverageAnalysis]: Checked inductivity of 232 backedges. 4 proven. 228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:10:05,929 INFO  L312         TraceCheckSpWp]: Computing backward predicates...