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


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


Checking for ERROR reachability
Using default analysis
Version 798a7b37
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.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 013fc4a889617293119ec23d82d2fd495e032e9bab1929da87247ff74d1355ed
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 18:26:10,573 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 18:26:10,631 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf
[2025-03-03 18:26:10,638 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 18:26:10,638 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 18:26:10,652 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 18:26:10,653 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 18:26:10,653 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 18:26:10,653 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 18:26:10,654 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 18:26:10,654 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 18:26:10,654 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 18:26:10,654 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 18:26:10,654 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 18:26:10,654 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 18:26:10,655 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 18:26:10,655 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 18:26:10,655 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 18:26:10,655 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 18:26:10,655 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 18:26:10,656 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 18:26:10,656 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 18:26:10,656 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 18:26:10,656 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 18:26:10,656 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 18:26:10,656 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 18:26:10,656 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 18:26:10,656 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 18:26:10,656 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 18:26:10,656 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 18:26:10,656 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 18:26:10,656 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 18:26:10,657 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 18:26:10,657 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 18:26:10,657 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 18:26:10,657 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 18:26:10,657 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 18:26:10,657 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 18:26:10,657 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 18:26:10,657 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 18:26:10,658 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 -> 013fc4a889617293119ec23d82d2fd495e032e9bab1929da87247ff74d1355ed
[2025-03-03 18:26:10,870 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 18:26:10,878 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 18:26:10,880 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 18:26:10,880 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 18:26:10,882 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 18:26:10,882 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c
[2025-03-03 18:26:11,993 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f6685481/0136f90aa4fb48e48e717f6b477799d8/FLAG17bb0a8ca
[2025-03-03 18:26:12,274 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 18:26:12,274 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c
[2025-03-03 18:26:12,285 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f6685481/0136f90aa4fb48e48e717f6b477799d8/FLAG17bb0a8ca
[2025-03-03 18:26:12,300 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f6685481/0136f90aa4fb48e48e717f6b477799d8
[2025-03-03 18:26:12,301 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 18:26:12,302 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 18:26:12,304 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 18:26:12,304 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 18:26:12,307 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 18:26:12,308 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:26:12" (1/1) ...
[2025-03-03 18:26:12,308 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d81f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:12, skipping insertion in model container
[2025-03-03 18:26:12,309 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:26:12" (1/1) ...
[2025-03-03 18:26:12,340 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 18:26:12,450 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.v_non-pipelined-microprocessor.c[1270,1283]
[2025-03-03 18:26:12,577 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 18:26:12,584 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 18:26:12,599 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.v_non-pipelined-microprocessor.c[1270,1283]
[2025-03-03 18:26:12,667 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 18:26:12,680 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 18:26:12,681 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:12 WrapperNode
[2025-03-03 18:26:12,681 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 18:26:12,682 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 18:26:12,682 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 18:26:12,682 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 18:26:12,687 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:12" (1/1) ...
[2025-03-03 18:26:12,711 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:12" (1/1) ...
[2025-03-03 18:26:12,804 INFO  L138                Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1100
[2025-03-03 18:26:12,805 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 18:26:12,806 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 18:26:12,806 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 18:26:12,806 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 18:26:12,812 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:12" (1/1) ...
[2025-03-03 18:26:12,813 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:12" (1/1) ...
[2025-03-03 18:26:12,829 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:12" (1/1) ...
[2025-03-03 18:26:12,872 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-03 18:26:12,875 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:12" (1/1) ...
[2025-03-03 18:26:12,875 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:12" (1/1) ...
[2025-03-03 18:26:12,904 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:12" (1/1) ...
[2025-03-03 18:26:12,911 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:12" (1/1) ...
[2025-03-03 18:26:12,922 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:12" (1/1) ...
[2025-03-03 18:26:12,930 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:12" (1/1) ...
[2025-03-03 18:26:12,949 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 18:26:12,950 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 18:26:12,951 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 18:26:12,951 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 18:26:12,952 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:12" (1/1) ...
[2025-03-03 18:26:12,956 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 18:26:12,966 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:26:12,984 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-03 18:26:12,991 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-03 18:26:13,013 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 18:26:13,013 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 18:26:13,013 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 18:26:13,013 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 18:26:13,218 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 18:26:13,220 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 18:26:14,222 INFO  L?                        ?]: Removed 643 outVars from TransFormulas that were not future-live.
[2025-03-03 18:26:14,223 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 18:26:14,262 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 18:26:14,263 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 18:26:14,263 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:26:14 BoogieIcfgContainer
[2025-03-03 18:26:14,263 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 18:26:14,264 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 18:26:14,264 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 18:26:14,268 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 18:26:14,269 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:26:12" (1/3) ...
[2025-03-03 18:26:14,269 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533b036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:26:14, skipping insertion in model container
[2025-03-03 18:26:14,269 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:26:12" (2/3) ...
[2025-03-03 18:26:14,270 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533b036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:26:14, skipping insertion in model container
[2025-03-03 18:26:14,270 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:26:14" (3/3) ...
[2025-03-03 18:26:14,271 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.v_non-pipelined-microprocessor.c
[2025-03-03 18:26:14,283 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 18:26:14,284 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.v_non-pipelined-microprocessor.c that has 1 procedures, 255 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 18:26:14,329 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 18:26:14,336 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;@578aaab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 18:26:14,336 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 18:26:14,341 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 255 states, 253 states have (on average 1.4980237154150198) internal successors, (379), 254 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:26:14,348 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-03-03 18:26:14,349 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:26:14,350 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]
[2025-03-03 18:26:14,350 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:26:14,355 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:26:14,356 INFO  L85        PathProgramCache]: Analyzing trace with hash -432710360, now seen corresponding path program 1 times
[2025-03-03 18:26:14,361 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:26:14,361 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874644784]
[2025-03-03 18:26:14,362 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:26:14,364 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:26:14,464 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-03-03 18:26:14,861 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-03-03 18:26:14,861 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:26:14,861 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:26:15,831 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:26:15,832 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:26:15,832 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874644784]
[2025-03-03 18:26:15,833 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874644784] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:26:15,833 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:26:15,833 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 18:26:15,834 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186263585]
[2025-03-03 18:26:15,834 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:26:15,837 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 18:26:15,838 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:26:15,852 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 18:26:15,852 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 18:26:15,855 INFO  L87              Difference]: Start difference. First operand  has 255 states, 253 states have (on average 1.4980237154150198) internal successors, (379), 254 states have internal predecessors, (379), 0 states have call successors, (0), 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 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:26:16,071 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:26:16,072 INFO  L93              Difference]: Finished difference Result 477 states and 712 transitions.
[2025-03-03 18:26:16,073 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 18:26:16,074 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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 77
[2025-03-03 18:26:16,075 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:26:16,082 INFO  L225             Difference]: With dead ends: 477
[2025-03-03 18:26:16,082 INFO  L226             Difference]: Without dead ends: 256
[2025-03-03 18:26:16,086 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-03 18:26:16,089 INFO  L435           NwaCegarLoop]: 311 mSDtfsCounter, 311 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 18:26:16,091 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 926 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 18:26:16,103 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 256 states.
[2025-03-03 18:26:16,118 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 255.
[2025-03-03 18:26:16,120 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 255 states, 254 states have (on average 1.4881889763779528) internal successors, (378), 254 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:26:16,123 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 378 transitions.
[2025-03-03 18:26:16,124 INFO  L78                 Accepts]: Start accepts. Automaton has 255 states and 378 transitions. Word has length 77
[2025-03-03 18:26:16,125 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:26:16,125 INFO  L471      AbstractCegarLoop]: Abstraction has 255 states and 378 transitions.
[2025-03-03 18:26:16,125 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:26:16,125 INFO  L276                IsEmpty]: Start isEmpty. Operand 255 states and 378 transitions.
[2025-03-03 18:26:16,126 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2025-03-03 18:26:16,126 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:26:16,126 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]
[2025-03-03 18:26:16,127 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 18:26:16,127 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:26:16,127 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:26:16,127 INFO  L85        PathProgramCache]: Analyzing trace with hash -721546628, now seen corresponding path program 1 times
[2025-03-03 18:26:16,127 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:26:16,127 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561182102]
[2025-03-03 18:26:16,127 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:26:16,128 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:26:16,168 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes.
[2025-03-03 18:26:16,212 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements.
[2025-03-03 18:26:16,213 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:26:16,213 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:26:16,692 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:26:16,692 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:26:16,692 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561182102]
[2025-03-03 18:26:16,692 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561182102] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:26:16,692 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:26:16,692 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 18:26:16,692 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655746788]
[2025-03-03 18:26:16,692 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:26:16,693 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 18:26:16,693 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:26:16,694 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 18:26:16,694 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 18:26:16,694 INFO  L87              Difference]: Start difference. First operand 255 states and 378 transitions. Second operand  has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:26:16,825 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:26:16,825 INFO  L93              Difference]: Finished difference Result 259 states and 382 transitions.
[2025-03-03 18:26:16,826 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 18:26:16,826 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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 78
[2025-03-03 18:26:16,826 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:26:16,827 INFO  L225             Difference]: With dead ends: 259
[2025-03-03 18:26:16,827 INFO  L226             Difference]: Without dead ends: 257
[2025-03-03 18:26:16,827 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 18:26:16,828 INFO  L435           NwaCegarLoop]: 312 mSDtfsCounter, 0 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 18:26:16,828 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 931 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 18:26:16,831 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 257 states.
[2025-03-03 18:26:16,840 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257.
[2025-03-03 18:26:16,843 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 257 states, 256 states have (on average 1.484375) internal successors, (380), 256 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:26:16,844 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 380 transitions.
[2025-03-03 18:26:16,844 INFO  L78                 Accepts]: Start accepts. Automaton has 257 states and 380 transitions. Word has length 78
[2025-03-03 18:26:16,844 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:26:16,845 INFO  L471      AbstractCegarLoop]: Abstraction has 257 states and 380 transitions.
[2025-03-03 18:26:16,845 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:26:16,846 INFO  L276                IsEmpty]: Start isEmpty. Operand 257 states and 380 transitions.
[2025-03-03 18:26:16,847 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2025-03-03 18:26:16,848 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:26:16,848 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]
[2025-03-03 18:26:16,848 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 18:26:16,848 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:26:16,849 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:26:16,849 INFO  L85        PathProgramCache]: Analyzing trace with hash -888429666, now seen corresponding path program 1 times
[2025-03-03 18:26:16,849 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:26:16,850 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220630116]
[2025-03-03 18:26:16,850 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:26:16,850 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:26:16,893 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes.
[2025-03-03 18:26:16,935 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements.
[2025-03-03 18:26:16,937 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:26:16,937 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:26:17,158 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:26:17,159 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:26:17,159 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220630116]
[2025-03-03 18:26:17,159 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220630116] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:26:17,159 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:26:17,159 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 18:26:17,159 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541025985]
[2025-03-03 18:26:17,159 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:26:17,159 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 18:26:17,160 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:26:17,160 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 18:26:17,160 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 18:26:17,160 INFO  L87              Difference]: Start difference. First operand 257 states and 380 transitions. Second operand  has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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 18:26:17,289 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:26:17,290 INFO  L93              Difference]: Finished difference Result 482 states and 713 transitions.
[2025-03-03 18:26:17,291 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 18:26:17,291 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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 79
[2025-03-03 18:26:17,291 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:26:17,292 INFO  L225             Difference]: With dead ends: 482
[2025-03-03 18:26:17,294 INFO  L226             Difference]: Without dead ends: 259
[2025-03-03 18:26:17,294 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 18:26:17,295 INFO  L435           NwaCegarLoop]: 312 mSDtfsCounter, 0 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 18:26:17,297 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 928 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 18:26:17,298 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 259 states.
[2025-03-03 18:26:17,303 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259.
[2025-03-03 18:26:17,304 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 259 states, 258 states have (on average 1.4806201550387597) internal successors, (382), 258 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:26:17,306 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 382 transitions.
[2025-03-03 18:26:17,307 INFO  L78                 Accepts]: Start accepts. Automaton has 259 states and 382 transitions. Word has length 79
[2025-03-03 18:26:17,308 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:26:17,308 INFO  L471      AbstractCegarLoop]: Abstraction has 259 states and 382 transitions.
[2025-03-03 18:26:17,308 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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 18:26:17,309 INFO  L276                IsEmpty]: Start isEmpty. Operand 259 states and 382 transitions.
[2025-03-03 18:26:17,309 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2025-03-03 18:26:17,311 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:26:17,312 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]
[2025-03-03 18:26:17,312 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 18:26:17,312 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:26:17,312 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:26:17,312 INFO  L85        PathProgramCache]: Analyzing trace with hash 865264734, now seen corresponding path program 1 times
[2025-03-03 18:26:17,312 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:26:17,312 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996329317]
[2025-03-03 18:26:17,312 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:26:17,312 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:26:17,346 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes.
[2025-03-03 18:26:17,823 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements.
[2025-03-03 18:26:17,823 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:26:17,823 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:26:22,905 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:26:22,906 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:26:22,906 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996329317]
[2025-03-03 18:26:22,907 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996329317] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:26:22,907 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:26:22,907 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-03-03 18:26:22,907 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71844003]
[2025-03-03 18:26:22,907 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:26:22,907 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-03-03 18:26:22,908 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:26:22,909 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-03-03 18:26:22,909 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182
[2025-03-03 18:26:22,909 INFO  L87              Difference]: Start difference. First operand 259 states and 382 transitions. Second operand  has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:27:38,018 WARN  L286               SmtUtils]: Spent 1.16m on a formula simplification. DAG size of input: 58 DAG size of output: 55 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2025-03-03 18:27:39,919 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:27:39,919 INFO  L93              Difference]: Finished difference Result 770 states and 1130 transitions.
[2025-03-03 18:27:39,920 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-03-03 18:27:39,920 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 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 80
[2025-03-03 18:27:39,920 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:27:39,922 INFO  L225             Difference]: With dead ends: 770
[2025-03-03 18:27:39,922 INFO  L226             Difference]: Without dead ends: 545
[2025-03-03 18:27:39,922 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 74.3s TimeCoverageRelationStatistics Valid=87, Invalid=464, Unknown=1, NotChecked=0, Total=552
[2025-03-03 18:27:39,923 INFO  L435           NwaCegarLoop]: 224 mSDtfsCounter, 958 mSDsluCounter, 2336 mSDsCounter, 0 mSdLazyCounter, 4256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 2560 SdHoareTripleChecker+Invalid, 4256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time
[2025-03-03 18:27:39,923 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 2560 Invalid, 4256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4256 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time]
[2025-03-03 18:27:39,926 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 545 states.
[2025-03-03 18:27:39,933 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 313.
[2025-03-03 18:27:39,934 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 313 states, 312 states have (on average 1.4807692307692308) internal successors, (462), 312 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:27:39,935 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 462 transitions.
[2025-03-03 18:27:39,935 INFO  L78                 Accepts]: Start accepts. Automaton has 313 states and 462 transitions. Word has length 80
[2025-03-03 18:27:39,935 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:27:39,935 INFO  L471      AbstractCegarLoop]: Abstraction has 313 states and 462 transitions.
[2025-03-03 18:27:39,935 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:27:39,935 INFO  L276                IsEmpty]: Start isEmpty. Operand 313 states and 462 transitions.
[2025-03-03 18:27:39,936 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2025-03-03 18:27:39,936 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:27:39,936 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]
[2025-03-03 18:27:39,936 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 18:27:39,936 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:27:39,937 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:27:39,937 INFO  L85        PathProgramCache]: Analyzing trace with hash 1295189857, now seen corresponding path program 1 times
[2025-03-03 18:27:39,937 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:27:39,937 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381236658]
[2025-03-03 18:27:39,937 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:27:39,937 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:27:39,973 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes.
[2025-03-03 18:27:39,996 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements.
[2025-03-03 18:27:39,996 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:27:39,996 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:27:40,205 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:27:40,205 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:27:40,205 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381236658]
[2025-03-03 18:27:40,206 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381236658] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:27:40,206 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:27:40,206 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 18:27:40,206 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107387164]
[2025-03-03 18:27:40,206 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:27:40,207 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 18:27:40,207 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:27:40,207 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 18:27:40,207 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 18:27:40,208 INFO  L87              Difference]: Start difference. First operand 313 states and 462 transitions. Second operand  has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:27:40,397 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:27:40,397 INFO  L93              Difference]: Finished difference Result 784 states and 1155 transitions.
[2025-03-03 18:27:40,397 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 18:27:40,397 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 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 81
[2025-03-03 18:27:40,398 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:27:40,400 INFO  L225             Difference]: With dead ends: 784
[2025-03-03 18:27:40,400 INFO  L226             Difference]: Without dead ends: 505
[2025-03-03 18:27:40,401 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-03 18:27:40,401 INFO  L435           NwaCegarLoop]: 303 mSDtfsCounter, 216 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 18:27:40,402 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1166 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 18:27:40,403 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 505 states.
[2025-03-03 18:27:40,412 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 339.
[2025-03-03 18:27:40,414 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 339 states, 338 states have (on average 1.4763313609467457) internal successors, (499), 338 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:27:40,415 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 499 transitions.
[2025-03-03 18:27:40,415 INFO  L78                 Accepts]: Start accepts. Automaton has 339 states and 499 transitions. Word has length 81
[2025-03-03 18:27:40,416 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:27:40,416 INFO  L471      AbstractCegarLoop]: Abstraction has 339 states and 499 transitions.
[2025-03-03 18:27:40,416 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:27:40,416 INFO  L276                IsEmpty]: Start isEmpty. Operand 339 states and 499 transitions.
[2025-03-03 18:27:40,416 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2025-03-03 18:27:40,416 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:27:40,416 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]
[2025-03-03 18:27:40,416 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 18:27:40,416 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:27:40,417 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:27:40,417 INFO  L85        PathProgramCache]: Analyzing trace with hash -1056885771, now seen corresponding path program 1 times
[2025-03-03 18:27:40,417 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:27:40,417 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959019531]
[2025-03-03 18:27:40,417 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:27:40,417 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:27:40,448 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes.
[2025-03-03 18:27:40,661 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements.
[2025-03-03 18:27:40,661 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:27:40,662 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:27:40,896 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:27:40,896 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:27:40,896 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959019531]
[2025-03-03 18:27:40,897 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959019531] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:27:40,897 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:27:40,897 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 18:27:40,897 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043898682]
[2025-03-03 18:27:40,897 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:27:40,897 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 18:27:40,897 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:27:40,897 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 18:27:40,897 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-03 18:27:40,898 INFO  L87              Difference]: Start difference. First operand 339 states and 499 transitions. Second operand  has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:27:41,426 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:27:41,426 INFO  L93              Difference]: Finished difference Result 639 states and 942 transitions.
[2025-03-03 18:27:41,426 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 18:27:41,427 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 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 81
[2025-03-03 18:27:41,427 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:27:41,428 INFO  L225             Difference]: With dead ends: 639
[2025-03-03 18:27:41,428 INFO  L226             Difference]: Without dead ends: 360
[2025-03-03 18:27:41,429 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2025-03-03 18:27:41,429 INFO  L435           NwaCegarLoop]: 162 mSDtfsCounter, 370 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 18:27:41,429 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 628 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 18:27:41,430 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 360 states.
[2025-03-03 18:27:41,435 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 341.
[2025-03-03 18:27:41,436 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 341 states, 340 states have (on average 1.473529411764706) internal successors, (501), 340 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:27:41,438 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 501 transitions.
[2025-03-03 18:27:41,438 INFO  L78                 Accepts]: Start accepts. Automaton has 341 states and 501 transitions. Word has length 81
[2025-03-03 18:27:41,438 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:27:41,438 INFO  L471      AbstractCegarLoop]: Abstraction has 341 states and 501 transitions.
[2025-03-03 18:27:41,438 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:27:41,438 INFO  L276                IsEmpty]: Start isEmpty. Operand 341 states and 501 transitions.
[2025-03-03 18:27:41,439 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2025-03-03 18:27:41,439 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:27:41,439 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]
[2025-03-03 18:27:41,439 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 18:27:41,439 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:27:41,439 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:27:41,441 INFO  L85        PathProgramCache]: Analyzing trace with hash 1434578786, now seen corresponding path program 1 times
[2025-03-03 18:27:41,441 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:27:41,441 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632344854]
[2025-03-03 18:27:41,442 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:27:41,442 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:27:41,471 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes.
[2025-03-03 18:27:41,727 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements.
[2025-03-03 18:27:41,728 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:27:41,728 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:27:42,223 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:27:42,224 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:27:42,224 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632344854]
[2025-03-03 18:27:42,224 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632344854] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:27:42,224 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:27:42,224 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-03 18:27:42,224 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478197203]
[2025-03-03 18:27:42,224 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:27:42,224 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-03 18:27:42,224 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:27:42,225 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-03 18:27:42,225 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2025-03-03 18:27:42,225 INFO  L87              Difference]: Start difference. First operand 341 states and 501 transitions. Second operand  has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:27:43,374 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:27:43,375 INFO  L93              Difference]: Finished difference Result 858 states and 1257 transitions.
[2025-03-03 18:27:43,375 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-03 18:27:43,375 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 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 81
[2025-03-03 18:27:43,375 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:27:43,377 INFO  L225             Difference]: With dead ends: 858
[2025-03-03 18:27:43,377 INFO  L226             Difference]: Without dead ends: 577
[2025-03-03 18:27:43,378 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182
[2025-03-03 18:27:43,378 INFO  L435           NwaCegarLoop]: 205 mSDtfsCounter, 872 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 1948 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-03 18:27:43,379 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 1387 Invalid, 1950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1948 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-03 18:27:43,381 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 577 states.
[2025-03-03 18:27:43,387 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 379.
[2025-03-03 18:27:43,388 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 379 states, 378 states have (on average 1.4735449735449735) internal successors, (557), 378 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:27:43,389 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 557 transitions.
[2025-03-03 18:27:43,389 INFO  L78                 Accepts]: Start accepts. Automaton has 379 states and 557 transitions. Word has length 81
[2025-03-03 18:27:43,389 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:27:43,390 INFO  L471      AbstractCegarLoop]: Abstraction has 379 states and 557 transitions.
[2025-03-03 18:27:43,390 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:27:43,390 INFO  L276                IsEmpty]: Start isEmpty. Operand 379 states and 557 transitions.
[2025-03-03 18:27:43,390 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2025-03-03 18:27:43,391 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:27:43,391 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]
[2025-03-03 18:27:43,391 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 18:27:43,391 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:27:43,391 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:27:43,391 INFO  L85        PathProgramCache]: Analyzing trace with hash -339643152, now seen corresponding path program 1 times
[2025-03-03 18:27:43,392 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:27:43,392 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344981648]
[2025-03-03 18:27:43,392 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:27:43,392 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:27:43,427 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes.
[2025-03-03 18:27:43,718 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements.
[2025-03-03 18:27:43,719 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:27:43,719 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:27:44,862 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:27:44,863 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:27:44,863 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344981648]
[2025-03-03 18:27:44,863 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344981648] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:27:44,863 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:27:44,863 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 18:27:44,863 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463222713]
[2025-03-03 18:27:44,864 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:27:44,864 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 18:27:44,864 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:27:44,864 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 18:27:44,864 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 18:27:44,864 INFO  L87              Difference]: Start difference. First operand 379 states and 557 transitions. Second operand  has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:27:45,191 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:27:45,191 INFO  L93              Difference]: Finished difference Result 624 states and 918 transitions.
[2025-03-03 18:27:45,192 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 18:27:45,192 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 81
[2025-03-03 18:27:45,192 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:27:45,193 INFO  L225             Difference]: With dead ends: 624
[2025-03-03 18:27:45,193 INFO  L226             Difference]: Without dead ends: 305
[2025-03-03 18:27:45,193 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 18:27:45,194 INFO  L435           NwaCegarLoop]: 161 mSDtfsCounter, 342 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 18:27:45,194 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 321 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 18:27:45,195 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 305 states.
[2025-03-03 18:27:45,199 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 279.
[2025-03-03 18:27:45,200 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 279 states, 278 states have (on average 1.4676258992805755) internal successors, (408), 278 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:27:45,200 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 408 transitions.
[2025-03-03 18:27:45,200 INFO  L78                 Accepts]: Start accepts. Automaton has 279 states and 408 transitions. Word has length 81
[2025-03-03 18:27:45,201 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:27:45,201 INFO  L471      AbstractCegarLoop]: Abstraction has 279 states and 408 transitions.
[2025-03-03 18:27:45,201 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 18:27:45,201 INFO  L276                IsEmpty]: Start isEmpty. Operand 279 states and 408 transitions.
[2025-03-03 18:27:45,202 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 83
[2025-03-03 18:27:45,202 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:27:45,202 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]
[2025-03-03 18:27:45,202 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 18:27:45,202 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:27:45,202 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:27:45,203 INFO  L85        PathProgramCache]: Analyzing trace with hash 1753130823, now seen corresponding path program 1 times
[2025-03-03 18:27:45,203 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:27:45,203 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695991417]
[2025-03-03 18:27:45,203 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:27:45,203 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:27:45,230 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes.
[2025-03-03 18:27:45,417 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements.
[2025-03-03 18:27:45,417 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:27:45,417 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat