./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label21.c --full-output --architecture 32bit


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


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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cddd396d9051dbeeab842f0229e49128c7a3af364245c973ac8bbf7d2e9e624d
[2025-03-03 09:50:45,629 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 09:50:45,636 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 09:50:45,638 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 09:50:45,639 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 09:50:45,639 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 09:50:45,641 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label21.c
[2025-03-03 09:50:46,773 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49afb6efe/64fbf29898c94b08aff01767b6e98804/FLAG84546b5c9
[2025-03-03 09:50:47,085 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 09:50:47,087 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label21.c
[2025-03-03 09:50:47,100 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49afb6efe/64fbf29898c94b08aff01767b6e98804/FLAG84546b5c9
[2025-03-03 09:50:47,341 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49afb6efe/64fbf29898c94b08aff01767b6e98804
[2025-03-03 09:50:47,343 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 09:50:47,344 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 09:50:47,345 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 09:50:47,345 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 09:50:47,349 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 09:50:47,350 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:47,350 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52f53cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47, skipping insertion in model container
[2025-03-03 09:50:47,350 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:47,398 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 09:50:47,687 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/eca-rers2012/Problem03_label21.c[61500,61513]
[2025-03-03 09:50:47,711 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 09:50:47,720 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 09:50:47,830 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/eca-rers2012/Problem03_label21.c[61500,61513]
[2025-03-03 09:50:47,840 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 09:50:47,853 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 09:50:47,854 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47 WrapperNode
[2025-03-03 09:50:47,854 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 09:50:47,855 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 09:50:47,855 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 09:50:47,855 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 09:50:47,859 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:47,882 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:47,965 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769
[2025-03-03 09:50:47,965 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 09:50:47,966 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 09:50:47,966 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 09:50:47,966 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 09:50:47,972 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:47,972 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:47,981 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:48,017 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-03 09:50:48,018 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:48,018 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:48,061 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:48,065 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:48,111 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:48,119 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:48,131 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 09:50:48,133 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 09:50:48,133 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 09:50:48,133 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 09:50:48,134 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:48,138 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 09:50:48,147 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:50:48,160 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-03 09:50:48,167 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-03 09:50:48,182 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 09:50:48,182 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 09:50:48,182 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 09:50:48,182 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 09:50:48,249 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 09:50:48,251 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 09:50:49,737 INFO  L?                        ?]: Removed 147 outVars from TransFormulas that were not future-live.
[2025-03-03 09:50:49,737 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 09:50:49,753 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 09:50:49,754 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 09:50:49,755 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:50:49 BoogieIcfgContainer
[2025-03-03 09:50:49,755 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 09:50:49,756 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 09:50:49,756 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 09:50:49,759 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 09:50:49,760 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:50:47" (1/3) ...
[2025-03-03 09:50:49,760 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d0d830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:50:49, skipping insertion in model container
[2025-03-03 09:50:49,760 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (2/3) ...
[2025-03-03 09:50:49,760 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d0d830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:50:49, skipping insertion in model container
[2025-03-03 09:50:49,760 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:50:49" (3/3) ...
[2025-03-03 09:50:49,761 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem03_label21.c
[2025-03-03 09:50:49,771 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 09:50:49,777 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label21.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 09:50:49,825 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 09:50:49,833 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;@17f89984, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 09:50:49,834 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 09:50:49,838 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:49,848 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 203
[2025-03-03 09:50:49,849 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:49,850 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]
[2025-03-03 09:50:49,851 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:49,855 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:49,856 INFO  L85        PathProgramCache]: Analyzing trace with hash 2056013211, now seen corresponding path program 1 times
[2025-03-03 09:50:49,861 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:49,863 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487092415]
[2025-03-03 09:50:49,863 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:49,863 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:49,975 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes.
[2025-03-03 09:50:50,120 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements.
[2025-03-03 09:50:50,120 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:50,120 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:50,627 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:50:50,628 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:50,628 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487092415]
[2025-03-03 09:50:50,629 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487092415] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:50,629 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:50:50,629 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:50:50,630 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266628]
[2025-03-03 09:50:50,631 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:50,634 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:50,635 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:50,652 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:50,653 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:50:50,656 INFO  L87              Difference]: Start difference. First operand  has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:51,507 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:51,508 INFO  L93              Difference]: Finished difference Result 857 states and 1495 transitions.
[2025-03-03 09:50:51,509 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:51,510 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 202
[2025-03-03 09:50:51,511 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:51,523 INFO  L225             Difference]: With dead ends: 857
[2025-03-03 09:50:51,524 INFO  L226             Difference]: Without dead ends: 462
[2025-03-03 09:50:51,526 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:50:51,530 INFO  L435           NwaCegarLoop]: 149 mSDtfsCounter, 86 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:51,531 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 187 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 09:50:51,545 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 462 states.
[2025-03-03 09:50:51,566 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 460.
[2025-03-03 09:50:51,567 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 460 states, 459 states have (on average 1.5381263616557734) internal successors, (706), 459 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:51,570 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 706 transitions.
[2025-03-03 09:50:51,571 INFO  L78                 Accepts]: Start accepts. Automaton has 460 states and 706 transitions. Word has length 202
[2025-03-03 09:50:51,571 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:51,572 INFO  L471      AbstractCegarLoop]: Abstraction has 460 states and 706 transitions.
[2025-03-03 09:50:51,572 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:51,572 INFO  L276                IsEmpty]: Start isEmpty. Operand 460 states and 706 transitions.
[2025-03-03 09:50:51,574 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 211
[2025-03-03 09:50:51,574 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:51,574 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-03-03 09:50:51,575 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 09:50:51,575 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:51,575 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:51,575 INFO  L85        PathProgramCache]: Analyzing trace with hash -1961101967, now seen corresponding path program 1 times
[2025-03-03 09:50:51,575 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:51,575 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616982509]
[2025-03-03 09:50:51,575 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:51,575 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:51,611 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes.
[2025-03-03 09:50:51,624 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements.
[2025-03-03 09:50:51,624 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:51,624 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:51,736 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:50:51,737 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:51,737 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616982509]
[2025-03-03 09:50:51,737 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616982509] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:51,737 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:50:51,737 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:50:51,737 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259103968]
[2025-03-03 09:50:51,737 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:51,738 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:51,738 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:51,738 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:51,739 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:50:51,740 INFO  L87              Difference]: Start difference. First operand 460 states and 706 transitions. Second operand  has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:52,439 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:52,439 INFO  L93              Difference]: Finished difference Result 1344 states and 2079 transitions.
[2025-03-03 09:50:52,439 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:52,440 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 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 210
[2025-03-03 09:50:52,440 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:52,443 INFO  L225             Difference]: With dead ends: 1344
[2025-03-03 09:50:52,443 INFO  L226             Difference]: Without dead ends: 886
[2025-03-03 09:50:52,444 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:50:52,445 INFO  L435           NwaCegarLoop]: 78 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:52,445 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 93 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 09:50:52,446 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 886 states.
[2025-03-03 09:50:52,470 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 870.
[2025-03-03 09:50:52,472 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 870 states, 869 states have (on average 1.5120828538550057) internal successors, (1314), 869 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:52,478 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1314 transitions.
[2025-03-03 09:50:52,481 INFO  L78                 Accepts]: Start accepts. Automaton has 870 states and 1314 transitions. Word has length 210
[2025-03-03 09:50:52,481 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:52,481 INFO  L471      AbstractCegarLoop]: Abstraction has 870 states and 1314 transitions.
[2025-03-03 09:50:52,481 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:52,482 INFO  L276                IsEmpty]: Start isEmpty. Operand 870 states and 1314 transitions.
[2025-03-03 09:50:52,488 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 223
[2025-03-03 09:50:52,489 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:52,489 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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]
[2025-03-03 09:50:52,489 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 09:50:52,489 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:52,490 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:52,490 INFO  L85        PathProgramCache]: Analyzing trace with hash 1369981834, now seen corresponding path program 1 times
[2025-03-03 09:50:52,490 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:52,490 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32790148]
[2025-03-03 09:50:52,490 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:52,490 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:52,526 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes.
[2025-03-03 09:50:52,532 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements.
[2025-03-03 09:50:52,533 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:52,533 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:52,849 INFO  L134       CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-03-03 09:50:52,850 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:52,850 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32790148]
[2025-03-03 09:50:52,850 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32790148] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:50:52,850 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439621352]
[2025-03-03 09:50:52,850 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:52,850 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:50:52,850 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:50:52,854 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:50:52,855 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-03 09:50:52,922 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes.
[2025-03-03 09:50:52,984 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements.
[2025-03-03 09:50:52,984 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:52,984 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:52,989 INFO  L256         TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 09:50:52,997 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:50:53,045 INFO  L134       CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2025-03-03 09:50:53,046 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:50:53,046 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439621352] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:53,046 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:50:53,046 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4
[2025-03-03 09:50:53,046 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916904899]
[2025-03-03 09:50:53,046 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:53,048 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:53,049 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:53,049 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:53,051 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:50:53,051 INFO  L87              Difference]: Start difference. First operand 870 states and 1314 transitions. Second operand  has 3 states, 3 states have (on average 71.0) internal successors, (213), 2 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:53,333 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:53,334 INFO  L93              Difference]: Finished difference Result 2601 states and 3933 transitions.
[2025-03-03 09:50:53,334 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:53,334 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 71.0) internal successors, (213), 2 states have internal predecessors, (213), 0 states have call successors, (0), 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 222
[2025-03-03 09:50:53,335 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:53,341 INFO  L225             Difference]: With dead ends: 2601
[2025-03-03 09:50:53,341 INFO  L226             Difference]: Without dead ends: 1733
[2025-03-03 09:50:53,343 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:50:53,343 INFO  L435           NwaCegarLoop]: 313 mSDtfsCounter, 360 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:53,344 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 601 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 09:50:53,346 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1733 states.
[2025-03-03 09:50:53,401 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1729.
[2025-03-03 09:50:53,404 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1729 states, 1728 states have (on average 1.5127314814814814) internal successors, (2614), 1728 states have internal predecessors, (2614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:53,410 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2614 transitions.
[2025-03-03 09:50:53,410 INFO  L78                 Accepts]: Start accepts. Automaton has 1729 states and 2614 transitions. Word has length 222
[2025-03-03 09:50:53,410 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:53,410 INFO  L471      AbstractCegarLoop]: Abstraction has 1729 states and 2614 transitions.
[2025-03-03 09:50:53,411 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 71.0) internal successors, (213), 2 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:53,411 INFO  L276                IsEmpty]: Start isEmpty. Operand 1729 states and 2614 transitions.
[2025-03-03 09:50:53,415 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 225
[2025-03-03 09:50:53,415 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:53,415 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:50:53,424 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-03 09:50:53,620 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:50:53,620 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:53,621 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:53,621 INFO  L85        PathProgramCache]: Analyzing trace with hash 2118524517, now seen corresponding path program 1 times
[2025-03-03 09:50:53,621 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:53,621 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670956422]
[2025-03-03 09:50:53,621 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:53,621 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:53,653 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes.
[2025-03-03 09:50:53,659 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements.
[2025-03-03 09:50:53,659 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:53,659 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:53,861 INFO  L134       CoverageAnalysis]: Checked inductivity of 40 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:50:53,861 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:53,862 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670956422]
[2025-03-03 09:50:53,862 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670956422] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:50:53,862 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396775400]
[2025-03-03 09:50:53,862 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:53,862 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:50:53,862 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:50:53,864 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:50:53,866 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-03 09:50:53,919 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes.
[2025-03-03 09:50:53,975 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements.
[2025-03-03 09:50:53,976 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:53,976 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:53,978 INFO  L256         TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 09:50:53,985 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:50:54,012 INFO  L134       CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 09:50:54,013 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:50:54,013 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [396775400] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:54,013 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:50:54,014 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2025-03-03 09:50:54,014 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367815051]
[2025-03-03 09:50:54,014 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:54,014 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:54,014 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:54,014 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:54,015 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:50:54,015 INFO  L87              Difference]: Start difference. First operand 1729 states and 2614 transitions. Second operand  has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:54,741 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:54,741 INFO  L93              Difference]: Finished difference Result 5088 states and 7710 transitions.
[2025-03-03 09:50:54,741 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:54,742 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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 224
[2025-03-03 09:50:54,743 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:54,753 INFO  L225             Difference]: With dead ends: 5088
[2025-03-03 09:50:54,753 INFO  L226             Difference]: Without dead ends: 3361
[2025-03-03 09:50:54,756 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:50:54,758 INFO  L435           NwaCegarLoop]: 387 mSDtfsCounter, 231 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:54,759 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 415 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 09:50:54,765 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3361 states.
[2025-03-03 09:50:54,830 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3361 to 3357.
[2025-03-03 09:50:54,835 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3357 states, 3356 states have (on average 1.3367103694874851) internal successors, (4486), 3356 states have internal predecessors, (4486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:54,845 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 4486 transitions.
[2025-03-03 09:50:54,846 INFO  L78                 Accepts]: Start accepts. Automaton has 3357 states and 4486 transitions. Word has length 224
[2025-03-03 09:50:54,846 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:54,846 INFO  L471      AbstractCegarLoop]: Abstraction has 3357 states and 4486 transitions.
[2025-03-03 09:50:54,846 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:54,846 INFO  L276                IsEmpty]: Start isEmpty. Operand 3357 states and 4486 transitions.
[2025-03-03 09:50:54,853 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2025-03-03 09:50:54,853 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:54,853 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:50:54,860 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-03-03 09:50:55,054 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3
[2025-03-03 09:50:55,054 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:55,056 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:55,057 INFO  L85        PathProgramCache]: Analyzing trace with hash -746910730, now seen corresponding path program 1 times
[2025-03-03 09:50:55,057 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:55,057 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488324806]
[2025-03-03 09:50:55,057 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:55,057 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:55,083 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes.
[2025-03-03 09:50:55,088 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements.
[2025-03-03 09:50:55,089 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:55,089 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:55,215 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:50:55,216 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:55,216 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488324806]
[2025-03-03 09:50:55,216 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488324806] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:55,216 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:50:55,216 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:50:55,216 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849251150]
[2025-03-03 09:50:55,216 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:55,216 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:55,216 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:55,217 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:55,217 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:50:55,217 INFO  L87              Difference]: Start difference. First operand 3357 states and 4486 transitions. Second operand  has 3 states, 3 states have (on average 75.0) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:55,883 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:55,883 INFO  L93              Difference]: Finished difference Result 9985 states and 13348 transitions.
[2025-03-03 09:50:55,884 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:55,884 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 75.0) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 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 225
[2025-03-03 09:50:55,884 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:55,901 INFO  L225             Difference]: With dead ends: 9985
[2025-03-03 09:50:55,902 INFO  L226             Difference]: Without dead ends: 6630
[2025-03-03 09:50:55,905 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:50:55,906 INFO  L435           NwaCegarLoop]: 141 mSDtfsCounter, 241 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:55,906 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 174 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 09:50:55,911 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6630 states.
[2025-03-03 09:50:56,001 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6630 to 6626.
[2025-03-03 09:50:56,010 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6626 states, 6625 states have (on average 1.2849811320754716) internal successors, (8513), 6625 states have internal predecessors, (8513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:56,028 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6626 states to 6626 states and 8513 transitions.
[2025-03-03 09:50:56,029 INFO  L78                 Accepts]: Start accepts. Automaton has 6626 states and 8513 transitions. Word has length 225
[2025-03-03 09:50:56,029 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:56,029 INFO  L471      AbstractCegarLoop]: Abstraction has 6626 states and 8513 transitions.
[2025-03-03 09:50:56,029 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 75.0) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:56,029 INFO  L276                IsEmpty]: Start isEmpty. Operand 6626 states and 8513 transitions.
[2025-03-03 09:50:56,038 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 238
[2025-03-03 09:50:56,038 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:56,038 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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]
[2025-03-03 09:50:56,038 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 09:50:56,039 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:56,039 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:56,039 INFO  L85        PathProgramCache]: Analyzing trace with hash -1092143305, now seen corresponding path program 1 times
[2025-03-03 09:50:56,039 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:56,039 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611960557]
[2025-03-03 09:50:56,039 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:56,040 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:56,064 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes.
[2025-03-03 09:50:56,072 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements.
[2025-03-03 09:50:56,072 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:56,072 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:56,149 INFO  L134       CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2025-03-03 09:50:56,149 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:56,149 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611960557]
[2025-03-03 09:50:56,150 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611960557] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:56,150 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:50:56,150 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:50:56,150 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800600976]
[2025-03-03 09:50:56,150 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:56,150 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:56,150 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:56,151 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:56,151 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:50:56,151 INFO  L87              Difference]: Start difference. First operand 6626 states and 8513 transitions. Second operand  has 3 states, 3 states have (on average 75.0) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:56,498 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:56,498 INFO  L93              Difference]: Finished difference Result 13186 states and 16938 transitions.
[2025-03-03 09:50:56,498 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:56,499 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 75.0) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 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 237
[2025-03-03 09:50:56,499 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:56,517 INFO  L225             Difference]: With dead ends: 13186
[2025-03-03 09:50:56,518 INFO  L226             Difference]: Without dead ends: 6562
[2025-03-03 09:50:56,525 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:50:56,526 INFO  L435           NwaCegarLoop]: 31 mSDtfsCounter, 321 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:56,527 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 31 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 09:50:56,533 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6562 states.
[2025-03-03 09:50:56,640 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6562 to 6562.
[2025-03-03 09:50:56,648 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6562 states, 6561 states have (on average 1.2563633592440178) internal successors, (8243), 6561 states have internal predecessors, (8243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:56,718 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6562 states to 6562 states and 8243 transitions.
[2025-03-03 09:50:56,719 INFO  L78                 Accepts]: Start accepts. Automaton has 6562 states and 8243 transitions. Word has length 237
[2025-03-03 09:50:56,719 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:56,719 INFO  L471      AbstractCegarLoop]: Abstraction has 6562 states and 8243 transitions.
[2025-03-03 09:50:56,719 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 75.0) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:56,719 INFO  L276                IsEmpty]: Start isEmpty. Operand 6562 states and 8243 transitions.
[2025-03-03 09:50:56,727 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 241
[2025-03-03 09:50:56,728 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:56,728 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:50:56,728 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 09:50:56,728 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:56,729 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:56,729 INFO  L85        PathProgramCache]: Analyzing trace with hash -161781827, now seen corresponding path program 1 times
[2025-03-03 09:50:56,729 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:56,729 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043577488]
[2025-03-03 09:50:56,729 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:56,729 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:56,754 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes.
[2025-03-03 09:50:56,762 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements.
[2025-03-03 09:50:56,762 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:56,762 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:57,523 INFO  L134       CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:50:57,523 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:57,523 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043577488]
[2025-03-03 09:50:57,523 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043577488] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:50:57,523 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170257726]
[2025-03-03 09:50:57,523 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:57,523 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:50:57,523 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:50:57,529 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:50:57,530 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-03 09:50:57,608 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes.
[2025-03-03 09:50:57,671 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements.
[2025-03-03 09:50:57,671 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:57,671 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:57,673 INFO  L256         TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-03 09:50:57,680 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:50:57,900 INFO  L134       CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 09:50:57,901 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:50:57,902 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [170257726] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:57,902 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:50:57,902 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-03 09:50:57,902 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607680042]
[2025-03-03 09:50:57,902 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:57,902 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:57,903 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:57,903 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:57,903 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:50:57,903 INFO  L87              Difference]: Start difference. First operand 6562 states and 8243 transitions. Second operand  has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:58,567 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:58,567 INFO  L93              Difference]: Finished difference Result 19228 states and 24222 transitions.
[2025-03-03 09:50:58,567 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:58,568 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 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 240
[2025-03-03 09:50:58,568 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:58,610 INFO  L225             Difference]: With dead ends: 19228
[2025-03-03 09:50:58,610 INFO  L226             Difference]: Without dead ends: 12668
[2025-03-03 09:50:58,619 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:50:58,620 INFO  L435           NwaCegarLoop]: 325 mSDtfsCounter, 42 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:58,620 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 346 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 09:50:58,632 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12668 states.
[2025-03-03 09:50:58,803 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12668 to 12660.
[2025-03-03 09:50:58,824 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12660 states, 12659 states have (on average 1.22529425705032) internal successors, (15511), 12659 states have internal predecessors, (15511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:58,926 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12660 states to 12660 states and 15511 transitions.
[2025-03-03 09:50:58,926 INFO  L78                 Accepts]: Start accepts. Automaton has 12660 states and 15511 transitions. Word has length 240
[2025-03-03 09:50:58,927 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:58,927 INFO  L471      AbstractCegarLoop]: Abstraction has 12660 states and 15511 transitions.
[2025-03-03 09:50:58,927 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:58,928 INFO  L276                IsEmpty]: Start isEmpty. Operand 12660 states and 15511 transitions.
[2025-03-03 09:50:58,941 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 257
[2025-03-03 09:50:58,941 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:58,941 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:50:58,948 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-03-03 09:50:59,142 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:50:59,143 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:59,144 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:59,144 INFO  L85        PathProgramCache]: Analyzing trace with hash -1432782564, now seen corresponding path program 1 times
[2025-03-03 09:50:59,144 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:59,145 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298421171]
[2025-03-03 09:50:59,145 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:59,145 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:59,182 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes.
[2025-03-03 09:50:59,189 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements.
[2025-03-03 09:50:59,189 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:59,189 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:59,336 INFO  L134       CoverageAnalysis]: Checked inductivity of 64 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2025-03-03 09:50:59,336 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:59,336 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298421171]
[2025-03-03 09:50:59,336 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298421171] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:59,336 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:50:59,336 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:50:59,336 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159912242]
[2025-03-03 09:50:59,336 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:59,337 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:59,337 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:59,338 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:59,338 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:50:59,338 INFO  L87              Difference]: Start difference. First operand 12660 states and 15511 transitions. Second operand  has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:59,991 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:59,991 INFO  L93              Difference]: Finished difference Result 31440 states and 38408 transitions.
[2025-03-03 09:50:59,991 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:59,992 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 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 256
[2025-03-03 09:50:59,992 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:00,024 INFO  L225             Difference]: With dead ends: 31440
[2025-03-03 09:51:00,025 INFO  L226             Difference]: Without dead ends: 18782
[2025-03-03 09:51:00,042 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:51:00,043 INFO  L435           NwaCegarLoop]: 93 mSDtfsCounter, 196 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:00,043 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 106 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 09:51:00,059 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18782 states.
[2025-03-03 09:51:00,311 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18782 to 18780.
[2025-03-03 09:51:00,338 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18780 states, 18779 states have (on average 1.2089568134618456) internal successors, (22703), 18779 states have internal predecessors, (22703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:00,361 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18780 states to 18780 states and 22703 transitions.
[2025-03-03 09:51:00,362 INFO  L78                 Accepts]: Start accepts. Automaton has 18780 states and 22703 transitions. Word has length 256
[2025-03-03 09:51:00,362 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:00,362 INFO  L471      AbstractCegarLoop]: Abstraction has 18780 states and 22703 transitions.
[2025-03-03 09:51:00,363 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:00,363 INFO  L276                IsEmpty]: Start isEmpty. Operand 18780 states and 22703 transitions.
[2025-03-03 09:51:00,385 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 264
[2025-03-03 09:51:00,385 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:00,386 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 09:51:00,386 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 09:51:00,386 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:00,386 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:00,387 INFO  L85        PathProgramCache]: Analyzing trace with hash 1314655969, now seen corresponding path program 2 times
[2025-03-03 09:51:00,387 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:00,387 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796937666]
[2025-03-03 09:51:00,387 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-03-03 09:51:00,387 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:00,419 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 263 statements into 2 equivalence classes.
[2025-03-03 09:51:00,442 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 263 of 263 statements.
[2025-03-03 09:51:00,443 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-03-03 09:51:00,443 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:00,812 INFO  L134       CoverageAnalysis]: Checked inductivity of 88 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2025-03-03 09:51:00,812 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:00,812 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796937666]
[2025-03-03 09:51:00,813 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796937666] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:51:00,813 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:51:00,813 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 09:51:00,813 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364109671]
[2025-03-03 09:51:00,813 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:51:00,813 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 09:51:00,814 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:00,815 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 09:51:00,815 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:51:00,815 INFO  L87              Difference]: Start difference. First operand 18780 states and 22703 transitions. Second operand  has 5 states, 5 states have (on average 49.8) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:02,224 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:02,224 INFO  L93              Difference]: Finished difference Result 52663 states and 65323 transitions.
[2025-03-03 09:51:02,225 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 09:51:02,225 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 49.8) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 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 263
[2025-03-03 09:51:02,225 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:02,281 INFO  L225             Difference]: With dead ends: 52663
[2025-03-03 09:51:02,281 INFO  L226             Difference]: Without dead ends: 33885
[2025-03-03 09:51:02,302 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-03-03 09:51:02,303 INFO  L435           NwaCegarLoop]: 29 mSDtfsCounter, 1043 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 478 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 1528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 478 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:02,303 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1043 Valid, 58 Invalid, 1528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [478 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-03 09:51:02,327 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 33885 states.
[2025-03-03 09:51:02,787 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 33885 to 27505.
[2025-03-03 09:51:02,822 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 27505 states, 27504 states have (on average 1.1823371146015125) internal successors, (32519), 27504 states have internal predecessors, (32519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:02,863 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27505 states to 27505 states and 32519 transitions.
[2025-03-03 09:51:02,864 INFO  L78                 Accepts]: Start accepts. Automaton has 27505 states and 32519 transitions. Word has length 263
[2025-03-03 09:51:02,864 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:02,864 INFO  L471      AbstractCegarLoop]: Abstraction has 27505 states and 32519 transitions.
[2025-03-03 09:51:02,865 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 49.8) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:02,865 INFO  L276                IsEmpty]: Start isEmpty. Operand 27505 states and 32519 transitions.
[2025-03-03 09:51:02,904 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 304
[2025-03-03 09:51:02,904 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:02,904 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:51:02,904 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-03 09:51:02,904 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:02,905 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:02,905 INFO  L85        PathProgramCache]: Analyzing trace with hash 1418907404, now seen corresponding path program 1 times
[2025-03-03 09:51:02,905 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:02,905 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868274348]
[2025-03-03 09:51:02,905 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:02,905 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:02,954 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes.
[2025-03-03 09:51:02,972 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements.
[2025-03-03 09:51:02,973 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:02,973 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:03,139 INFO  L134       CoverageAnalysis]: Checked inductivity of 125 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked.
[2025-03-03 09:51:03,139 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:03,139 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868274348]
[2025-03-03 09:51:03,139 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868274348] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:51:03,140 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:51:03,140 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:51:03,140 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377910113]
[2025-03-03 09:51:03,141 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:51:03,141 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:51:03,142 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:03,142 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:51:03,142 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:51:03,142 INFO  L87              Difference]: Start difference. First operand 27505 states and 32519 transitions. Second operand  has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 2 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:03,923 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:03,923 INFO  L93              Difference]: Finished difference Result 70092 states and 82665 transitions.
[2025-03-03 09:51:03,924 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:51:03,924 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 2 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 303
[2025-03-03 09:51:03,924 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:03,974 INFO  L225             Difference]: With dead ends: 70092
[2025-03-03 09:51:03,975 INFO  L226             Difference]: Without dead ends: 42589
[2025-03-03 09:51:03,998 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:51:03,999 INFO  L435           NwaCegarLoop]: 135 mSDtfsCounter, 157 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:03,999 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 150 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 09:51:04,030 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 42589 states.
[2025-03-03 09:51:04,400 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 42589 to 42583.
[2025-03-03 09:51:04,434 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 42583 states, 42582 states have (on average 1.1758489502606735) internal successors, (50070), 42582 states have internal predecessors, (50070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:04,477 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 42583 states to 42583 states and 50070 transitions.
[2025-03-03 09:51:04,478 INFO  L78                 Accepts]: Start accepts. Automaton has 42583 states and 50070 transitions. Word has length 303
[2025-03-03 09:51:04,478 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:04,478 INFO  L471      AbstractCegarLoop]: Abstraction has 42583 states and 50070 transitions.
[2025-03-03 09:51:04,479 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 2 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:04,479 INFO  L276                IsEmpty]: Start isEmpty. Operand 42583 states and 50070 transitions.
[2025-03-03 09:51:04,505 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 305
[2025-03-03 09:51:04,506 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:04,506 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:51:04,506 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 09:51:04,506 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:04,507 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:04,507 INFO  L85        PathProgramCache]: Analyzing trace with hash 1132517311, now seen corresponding path program 1 times
[2025-03-03 09:51:04,507 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:04,507 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399011075]
[2025-03-03 09:51:04,507 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:04,507 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:04,536 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes.
[2025-03-03 09:51:04,540 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements.
[2025-03-03 09:51:04,541 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:04,541 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:04,770 INFO  L134       CoverageAnalysis]: Checked inductivity of 128 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked.
[2025-03-03 09:51:04,770 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:04,770 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399011075]
[2025-03-03 09:51:04,770 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399011075] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:51:04,770 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:51:04,770 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:51:04,771 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829435439]
[2025-03-03 09:51:04,771 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:51:04,771 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:51:04,771 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:04,771 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:51:04,771 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:51:04,772 INFO  L87              Difference]: Start difference. First operand 42583 states and 50070 transitions. Second operand  has 3 states, 3 states have (on average 77.0) internal successors, (231), 2 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:05,532 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:05,533 INFO  L93              Difference]: Finished difference Result 106352 states and 124601 transitions.
[2025-03-03 09:51:05,533 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:51:05,533 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 77.0) internal successors, (231), 2 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 304
[2025-03-03 09:51:05,534 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:05,617 INFO  L225             Difference]: With dead ends: 106352
[2025-03-03 09:51:05,617 INFO  L226             Difference]: Without dead ends: 63771
[2025-03-03 09:51:05,654 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:51:05,655 INFO  L435           NwaCegarLoop]: 146 mSDtfsCounter, 203 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:05,655 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 159 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:51:05,703 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 63771 states.
[2025-03-03 09:51:06,333 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 63771 to 63769.
[2025-03-03 09:51:06,383 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 63769 states, 63768 states have (on average 1.1661962112658386) internal successors, (74366), 63768 states have internal predecessors, (74366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:06,453 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 63769 states to 63769 states and 74366 transitions.
[2025-03-03 09:51:06,455 INFO  L78                 Accepts]: Start accepts. Automaton has 63769 states and 74366 transitions. Word has length 304
[2025-03-03 09:51:06,455 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:06,455 INFO  L471      AbstractCegarLoop]: Abstraction has 63769 states and 74366 transitions.
[2025-03-03 09:51:06,455 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 77.0) internal successors, (231), 2 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:06,455 INFO  L276                IsEmpty]: Start isEmpty. Operand 63769 states and 74366 transitions.
[2025-03-03 09:51:06,493 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 311
[2025-03-03 09:51:06,494 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:06,494 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:51:06,494 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 09:51:06,494 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:06,494 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:06,495 INFO  L85        PathProgramCache]: Analyzing trace with hash 1706437287, now seen corresponding path program 1 times
[2025-03-03 09:51:06,495 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:06,495 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654283265]
[2025-03-03 09:51:06,495 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:06,496 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:06,525 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes.
[2025-03-03 09:51:06,537 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements.
[2025-03-03 09:51:06,537 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:06,537 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:07,681 INFO  L134       CoverageAnalysis]: Checked inductivity of 145 backedges. 113 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked.
[2025-03-03 09:51:07,682 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:07,682 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654283265]
[2025-03-03 09:51:07,682 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654283265] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:51:07,682 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941953689]
[2025-03-03 09:51:07,682 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:07,682 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:51:07,682 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:51:07,684 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:51:07,686 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-03-03 09:51:07,760 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes.
[2025-03-03 09:51:07,836 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements.
[2025-03-03 09:51:07,836 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:07,836 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:07,839 INFO  L256         TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 09:51:07,843 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:51:07,930 INFO  L134       CoverageAnalysis]: Checked inductivity of 145 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked.
[2025-03-03 09:51:07,931 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:51:07,931 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941953689] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:51:07,931 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:51:07,931 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5
[2025-03-03 09:51:07,932 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057006288]
[2025-03-03 09:51:07,932 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:51:07,932 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:51:07,932 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:07,933 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:51:07,933 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:51:07,933 INFO  L87              Difference]: Start difference. First operand 63769 states and 74366 transitions. Second operand  has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 2 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:08,714 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:08,714 INFO  L93              Difference]: Finished difference Result 162152 states and 190045 transitions.
[2025-03-03 09:51:08,715 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:51:08,715 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 2 states have internal predecessors, (280), 0 states have call successors, (0), 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 310
[2025-03-03 09:51:08,715 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:08,832 INFO  L225             Difference]: With dead ends: 162152
[2025-03-03 09:51:08,832 INFO  L226             Difference]: Without dead ends: 98385
[2025-03-03 09:51:08,876 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:51:08,877 INFO  L435           NwaCegarLoop]: 111 mSDtfsCounter, 152 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:08,877 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 138 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:51:08,947 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 98385 states.
[2025-03-03 09:51:09,703 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 98385 to 89156.
[2025-03-03 09:51:09,764 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 89156 states, 89155 states have (on average 1.1800684201671248) internal successors, (105209), 89155 states have internal predecessors, (105209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:09,863 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 89156 states to 89156 states and 105209 transitions.
[2025-03-03 09:51:09,865 INFO  L78                 Accepts]: Start accepts. Automaton has 89156 states and 105209 transitions. Word has length 310
[2025-03-03 09:51:09,865 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:09,865 INFO  L471      AbstractCegarLoop]: Abstraction has 89156 states and 105209 transitions.
[2025-03-03 09:51:09,865 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 2 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:09,865 INFO  L276                IsEmpty]: Start isEmpty. Operand 89156 states and 105209 transitions.
[2025-03-03 09:51:09,913 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 312
[2025-03-03 09:51:09,913 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:09,914 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:51:09,920 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2025-03-03 09:51:10,114 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:51:10,115 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:10,115 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:10,115 INFO  L85        PathProgramCache]: Analyzing trace with hash 1456009092, now seen corresponding path program 1 times
[2025-03-03 09:51:10,115 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:10,115 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997374223]
[2025-03-03 09:51:10,115 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:10,115 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:10,143 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes.
[2025-03-03 09:51:10,149 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements.
[2025-03-03 09:51:10,150 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:10,150 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:10,469 INFO  L134       CoverageAnalysis]: Checked inductivity of 148 backedges. 68 proven. 6 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked.
[2025-03-03 09:51:10,469 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:10,469 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997374223]
[2025-03-03 09:51:10,469 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997374223] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:51:10,469 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608009119]
[2025-03-03 09:51:10,469 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:10,470 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:51:10,470 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:51:10,472 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:51:10,474 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-03-03 09:51:10,540 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes.
[2025-03-03 09:51:10,601 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements.
[2025-03-03 09:51:10,601 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:10,601 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:10,604 INFO  L256         TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-03 09:51:10,607 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:51:10,677 INFO  L134       CoverageAnalysis]: Checked inductivity of 148 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 09:51:10,677 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:51:10,677 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [608009119] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:51:10,677 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:51:10,677 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-03-03 09:51:10,677 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841500944]
[2025-03-03 09:51:10,677 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:51:10,678 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:51:10,678 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:10,678 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:51:10,679 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:51:10,679 INFO  L87              Difference]: Start difference. First operand 89156 states and 105209 transitions. Second operand  has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:11,420 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:11,421 INFO  L93              Difference]: Finished difference Result 174042 states and 204853 transitions.
[2025-03-03 09:51:11,421 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:51:11,421 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 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 311
[2025-03-03 09:51:11,421 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:11,508 INFO  L225             Difference]: With dead ends: 174042
[2025-03-03 09:51:11,508 INFO  L226             Difference]: Without dead ends: 84888
[2025-03-03 09:51:11,558 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 09:51:11,559 INFO  L435           NwaCegarLoop]: 291 mSDtfsCounter, 177 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:11,559 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 305 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 09:51:11,605 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 84888 states.
[2025-03-03 09:51:12,409 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 84888 to 62540.
[2025-03-03 09:51:12,453 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 62540 states, 62539 states have (on average 1.1480835958361981) internal successors, (71800), 62539 states have internal predecessors, (71800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:12,521 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 62540 states to 62540 states and 71800 transitions.
[2025-03-03 09:51:12,523 INFO  L78                 Accepts]: Start accepts. Automaton has 62540 states and 71800 transitions. Word has length 311
[2025-03-03 09:51:12,523 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:12,523 INFO  L471      AbstractCegarLoop]: Abstraction has 62540 states and 71800 transitions.
[2025-03-03 09:51:12,523 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:12,524 INFO  L276                IsEmpty]: Start isEmpty. Operand 62540 states and 71800 transitions.
[2025-03-03 09:51:12,558 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 344
[2025-03-03 09:51:12,558 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:12,559 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:51:12,566 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2025-03-03 09:51:12,764 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2025-03-03 09:51:12,764 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:12,765 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:12,765 INFO  L85        PathProgramCache]: Analyzing trace with hash 884810622, now seen corresponding path program 1 times
[2025-03-03 09:51:12,765 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:12,765 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288547325]
[2025-03-03 09:51:12,765 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:12,765 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:12,890 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes.
[2025-03-03 09:51:12,898 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements.
[2025-03-03 09:51:12,899 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:12,899 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:13,929 INFO  L134       CoverageAnalysis]: Checked inductivity of 247 backedges. 110 proven. 6 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked.
[2025-03-03 09:51:13,929 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:13,929 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288547325]
[2025-03-03 09:51:13,929 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288547325] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:51:13,930 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047066821]
[2025-03-03 09:51:13,930 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:13,930 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:51:13,930 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:51:13,932 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:51:13,932 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-03-03 09:51:13,996 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes.
[2025-03-03 09:51:14,058 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements.
[2025-03-03 09:51:14,059 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:14,059 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:14,061 INFO  L256         TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-03-03 09:51:14,065 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:51:14,355 INFO  L134       CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked.
[2025-03-03 09:51:14,355 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 09:51:14,654 INFO  L134       CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked.
[2025-03-03 09:51:14,654 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047066821] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 09:51:14,654 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 09:51:14,654 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6
[2025-03-03 09:51:14,654 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824645923]
[2025-03-03 09:51:14,654 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 09:51:14,655 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 09:51:14,655 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:14,655 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 09:51:14,655 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-03-03 09:51:14,656 INFO  L87              Difference]: Start difference. First operand 62540 states and 71800 transitions. Second operand  has 7 states, 7 states have (on average 74.57142857142857) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:16,739 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:16,739 INFO  L93              Difference]: Finished difference Result 179436 states and 205705 transitions.
[2025-03-03 09:51:16,740 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-03 09:51:16,742 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 74.57142857142857) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 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 343
[2025-03-03 09:51:16,742 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:16,897 INFO  L225             Difference]: With dead ends: 179436
[2025-03-03 09:51:16,897 INFO  L226             Difference]: Without dead ends: 116898
[2025-03-03 09:51:16,952 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 683 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2025-03-03 09:51:16,953 INFO  L435           NwaCegarLoop]: 47 mSDtfsCounter, 1475 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2182 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 2597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 2182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:16,953 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 184 Invalid, 2597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 2182 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-03 09:51:17,039 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 116898 states.
[2025-03-03 09:51:18,329 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 116898 to 114226.
[2025-03-03 09:51:18,417 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 114226 states, 114225 states have (on average 1.1416064784416722) internal successors, (130400), 114225 states have internal predecessors, (130400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:18,545 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 114226 states to 114226 states and 130400 transitions.
[2025-03-03 09:51:18,547 INFO  L78                 Accepts]: Start accepts. Automaton has 114226 states and 130400 transitions. Word has length 343
[2025-03-03 09:51:18,548 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:18,548 INFO  L471      AbstractCegarLoop]: Abstraction has 114226 states and 130400 transitions.
[2025-03-03 09:51:18,548 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 74.57142857142857) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:18,548 INFO  L276                IsEmpty]: Start isEmpty. Operand 114226 states and 130400 transitions.
[2025-03-03 09:51:18,598 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 346
[2025-03-03 09:51:18,598 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:18,598 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:51:18,604 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-03-03 09:51:18,799 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:51:18,799 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:18,799 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:18,799 INFO  L85        PathProgramCache]: Analyzing trace with hash -119114314, now seen corresponding path program 1 times
[2025-03-03 09:51:18,800 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:18,800 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173045471]
[2025-03-03 09:51:18,800 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:18,800 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:18,835 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes.
[2025-03-03 09:51:18,842 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements.
[2025-03-03 09:51:18,843 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:18,843 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:19,218 INFO  L134       CoverageAnalysis]: Checked inductivity of 250 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked.
[2025-03-03 09:51:19,219 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:19,219 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173045471]
[2025-03-03 09:51:19,219 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173045471] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:51:19,219 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475179268]
[2025-03-03 09:51:19,219 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:19,219 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:51:19,219 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:51:19,221 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:51:19,221 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-03-03 09:51:19,282 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes.
[2025-03-03 09:51:19,347 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements.
[2025-03-03 09:51:19,347 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:19,347 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:19,349 INFO  L256         TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-03-03 09:51:19,353 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:51:19,429 INFO  L134       CoverageAnalysis]: Checked inductivity of 250 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked.
[2025-03-03 09:51:19,429 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:51:19,429 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475179268] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:51:19,429 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:51:19,429 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-03-03 09:51:19,430 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544179396]
[2025-03-03 09:51:19,430 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:51:19,430 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:51:19,430 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:19,430 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:51:19,430 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:51:19,431 INFO  L87              Difference]: Start difference. First operand 114226 states and 130400 transitions. Second operand  has 4 states, 4 states have (on average 59.75) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:20,872 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:20,872 INFO  L93              Difference]: Finished difference Result 337244 states and 384416 transitions.
[2025-03-03 09:51:20,872 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 09:51:20,872 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 59.75) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 345
[2025-03-03 09:51:20,873 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:21,150 INFO  L225             Difference]: With dead ends: 337244
[2025-03-03 09:51:21,150 INFO  L226             Difference]: Without dead ends: 224644
[2025-03-03 09:51:21,251 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 343 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 09:51:21,251 INFO  L435           NwaCegarLoop]: 81 mSDtfsCounter, 518 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:21,252 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 328 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 09:51:21,420 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 224644 states.
[2025-03-03 09:51:23,265 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 224644 to 216498.
[2025-03-03 09:51:24,162 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 216498 states, 216497 states have (on average 1.1348840861536187) internal successors, (245699), 216497 states have internal predecessors, (245699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:24,509 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 216498 states to 216498 states and 245699 transitions.
[2025-03-03 09:51:24,513 INFO  L78                 Accepts]: Start accepts. Automaton has 216498 states and 245699 transitions. Word has length 345
[2025-03-03 09:51:24,513 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:24,513 INFO  L471      AbstractCegarLoop]: Abstraction has 216498 states and 245699 transitions.
[2025-03-03 09:51:24,514 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 59.75) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:24,514 INFO  L276                IsEmpty]: Start isEmpty. Operand 216498 states and 245699 transitions.
[2025-03-03 09:51:24,592 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 346
[2025-03-03 09:51:24,596 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:24,596 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-03 09:51:24,603 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2025-03-03 09:51:24,796 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:51:24,797 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:24,797 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:24,797 INFO  L85        PathProgramCache]: Analyzing trace with hash 7026386, now seen corresponding path program 1 times
[2025-03-03 09:51:24,797 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:24,797 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890320078]
[2025-03-03 09:51:24,797 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:24,797 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:24,845 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes.
[2025-03-03 09:51:24,858 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements.
[2025-03-03 09:51:24,858 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:24,858 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:25,164 INFO  L134       CoverageAnalysis]: Checked inductivity of 230 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked.
[2025-03-03 09:51:25,164 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:25,164 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890320078]
[2025-03-03 09:51:25,164 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890320078] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:51:25,164 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:51:25,164 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:51:25,164 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189670063]
[2025-03-03 09:51:25,164 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:51:25,164 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:51:25,165 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:25,165 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:51:25,165 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 09:51:25,165 INFO  L87              Difference]: Start difference. First operand 216498 states and 245699 transitions. Second operand  has 4 states, 4 states have (on average 66.75) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:27,572 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:27,572 INFO  L93              Difference]: Finished difference Result 584020 states and 661643 transitions.
[2025-03-03 09:51:27,572 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 09:51:27,573 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 66.75) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 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 345
[2025-03-03 09:51:27,573 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:28,158 INFO  L225             Difference]: With dead ends: 584020
[2025-03-03 09:51:28,158 INFO  L226             Difference]: Without dead ends: 369148
[2025-03-03 09:51:28,276 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 09:51:28,277 INFO  L435           NwaCegarLoop]: 212 mSDtfsCounter, 448 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:28,277 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 431 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 09:51:28,577 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 369148 states.
[2025-03-03 09:51:32,832 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 369148 to 359174.
[2025-03-03 09:51:33,067 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 359174 states, 359173 states have (on average 1.1203681791225955) internal successors, (402406), 359173 states have internal predecessors, (402406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:33,887 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 359174 states to 359174 states and 402406 transitions.
[2025-03-03 09:51:33,892 INFO  L78                 Accepts]: Start accepts. Automaton has 359174 states and 402406 transitions. Word has length 345
[2025-03-03 09:51:33,892 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:33,892 INFO  L471      AbstractCegarLoop]: Abstraction has 359174 states and 402406 transitions.
[2025-03-03 09:51:33,892 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 66.75) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:33,892 INFO  L276                IsEmpty]: Start isEmpty. Operand 359174 states and 402406 transitions.
[2025-03-03 09:51:33,943 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 346
[2025-03-03 09:51:33,943 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:33,944 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:51:33,944 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-03 09:51:33,944 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:33,944 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:33,944 INFO  L85        PathProgramCache]: Analyzing trace with hash 1155809393, now seen corresponding path program 1 times
[2025-03-03 09:51:33,944 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:33,944 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73115938]
[2025-03-03 09:51:33,945 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:33,945 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:33,975 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes.
[2025-03-03 09:51:33,984 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements.
[2025-03-03 09:51:33,984 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:33,984 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:34,145 INFO  L134       CoverageAnalysis]: Checked inductivity of 205 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked.
[2025-03-03 09:51:34,145 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:34,145 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73115938]
[2025-03-03 09:51:34,145 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73115938] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:51:34,145 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:51:34,145 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:51:34,146 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079573594]
[2025-03-03 09:51:34,146 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:51:34,146 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:51:34,146 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:34,146 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:51:34,146 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 09:51:34,146 INFO  L87              Difference]: Start difference. First operand 359174 states and 402406 transitions. Second operand  has 4 states, 4 states have (on average 76.5) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:37,316 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:37,316 INFO  L93              Difference]: Finished difference Result 766610 states and 859644 transitions.
[2025-03-03 09:51:37,316 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 09:51:37,317 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 76.5) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 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 345
[2025-03-03 09:51:37,317 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:37,970 INFO  L225             Difference]: With dead ends: 766610
[2025-03-03 09:51:37,970 INFO  L226             Difference]: Without dead ends: 409062
[2025-03-03 09:51:38,078 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 09:51:38,078 INFO  L435           NwaCegarLoop]: 101 mSDtfsCounter, 466 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:38,078 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 122 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 09:51:38,370 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 409062 states.
[2025-03-03 09:51:42,992 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 409062 to 371310.
[2025-03-03 09:51:43,206 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 371310 states, 371309 states have (on average 1.1034933168870131) internal successors, (409737), 371309 states have internal predecessors, (409737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:43,620 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 371310 states to 371310 states and 409737 transitions.
[2025-03-03 09:51:43,626 INFO  L78                 Accepts]: Start accepts. Automaton has 371310 states and 409737 transitions. Word has length 345
[2025-03-03 09:51:43,626 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:43,626 INFO  L471      AbstractCegarLoop]: Abstraction has 371310 states and 409737 transitions.
[2025-03-03 09:51:43,626 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 76.5) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:43,626 INFO  L276                IsEmpty]: Start isEmpty. Operand 371310 states and 409737 transitions.
[2025-03-03 09:51:43,691 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 374
[2025-03-03 09:51:43,691 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:43,691 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:51:43,691 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-03 09:51:43,691 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:43,692 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:43,692 INFO  L85        PathProgramCache]: Analyzing trace with hash -339578955, now seen corresponding path program 1 times
[2025-03-03 09:51:43,692 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:43,692 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434248633]
[2025-03-03 09:51:43,692 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:43,692 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:44,070 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes.
[2025-03-03 09:51:44,085 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements.
[2025-03-03 09:51:44,085 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:44,085 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:44,204 INFO  L134       CoverageAnalysis]: Checked inductivity of 242 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked.
[2025-03-03 09:51:44,204 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:44,205 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434248633]
[2025-03-03 09:51:44,205 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434248633] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:51:44,205 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:51:44,205 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:51:44,205 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790740466]
[2025-03-03 09:51:44,205 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:51:44,205 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:51:44,205 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:44,205 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:51:44,205 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:51:44,206 INFO  L87              Difference]: Start difference. First operand 371310 states and 409737 transitions. Second operand  has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 2 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:47,874 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:47,874 INFO  L93              Difference]: Finished difference Result 1089104 states and 1202502 transitions.
[2025-03-03 09:51:47,874 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:51:47,874 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 2 states have internal predecessors, (329), 0 states have call successors, (0), 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 373
[2025-03-03 09:51:47,875 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:48,919 INFO  L225             Difference]: With dead ends: 1089104
[2025-03-03 09:51:48,919 INFO  L226             Difference]: Without dead ends: 719420
[2025-03-03 09:51:49,085 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:51:49,086 INFO  L435           NwaCegarLoop]: 270 mSDtfsCounter, 210 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:49,086 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 523 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 09:51:49,644 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 719420 states.