./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/psyco/psyco_security.c --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version e2fb8bed
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/psyco/psyco_security.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 c03d27deb00d6c25e1f99c43455f6da27475e88a721be2a7236bfffedf5da1e8
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 02:26:01,856 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 02:26:01,900 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 02:26:01,905 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 02:26:01,905 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 02:26:01,933 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 02:26:01,934 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 02:26:01,934 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 02:26:01,934 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 02:26:01,934 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 02:26:01,935 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 02:26:01,935 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 02:26:01,935 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 02:26:01,935 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 02:26:01,935 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 02:26:01,935 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 02:26:01,936 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 02:26:01,936 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 02:26:01,936 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 02:26:01,936 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 02:26:01,936 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 02:26:01,936 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 02:26:01,936 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 02:26:01,936 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 02:26:01,936 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 02:26:01,936 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 02:26:01,936 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 02:26:01,936 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 02:26:01,936 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 02:26:01,936 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 02:26:01,936 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 02:26:01,936 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 02:26:01,936 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 02:26:01,936 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 02:26:01,936 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 02:26:01,936 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 02:26:01,936 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 02:26:01,936 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 02:26:01,937 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 02:26:01,937 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 02:26:01,937 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 02:26:01,937 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 02:26:01,937 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 02:26:01,937 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 -> c03d27deb00d6c25e1f99c43455f6da27475e88a721be2a7236bfffedf5da1e8
[2025-03-08 02:26:02,166 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 02:26:02,171 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 02:26:02,174 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 02:26:02,175 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 02:26:02,175 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 02:26:02,176 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/psyco/psyco_security.c
[2025-03-08 02:26:03,310 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a52faf3f2/3c0586b443834c12b52f1aaf9400b235/FLAG9f2163e60
[2025-03-08 02:26:03,512 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 02:26:03,512 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_security.c
[2025-03-08 02:26:03,519 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a52faf3f2/3c0586b443834c12b52f1aaf9400b235/FLAG9f2163e60
[2025-03-08 02:26:03,871 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a52faf3f2/3c0586b443834c12b52f1aaf9400b235
[2025-03-08 02:26:03,873 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 02:26:03,874 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 02:26:03,875 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 02:26:03,875 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 02:26:03,878 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 02:26:03,878 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:26:03" (1/1) ...
[2025-03-08 02:26:03,879 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e563c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:03, skipping insertion in model container
[2025-03-08 02:26:03,879 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:26:03" (1/1) ...
[2025-03-08 02:26:03,895 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 02:26:04,007 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/psyco/psyco_security.c[12744,12757]
[2025-03-08 02:26:04,011 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 02:26:04,023 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 02:26:04,052 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/psyco/psyco_security.c[12744,12757]
[2025-03-08 02:26:04,053 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 02:26:04,064 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 02:26:04,064 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:04 WrapperNode
[2025-03-08 02:26:04,065 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 02:26:04,066 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 02:26:04,066 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 02:26:04,066 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 02:26:04,072 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:04" (1/1) ...
[2025-03-08 02:26:04,079 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:04" (1/1) ...
[2025-03-08 02:26:04,099 INFO  L138                Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 287
[2025-03-08 02:26:04,102 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 02:26:04,102 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 02:26:04,102 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 02:26:04,102 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 02:26:04,111 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:04" (1/1) ...
[2025-03-08 02:26:04,111 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:04" (1/1) ...
[2025-03-08 02:26:04,112 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:04" (1/1) ...
[2025-03-08 02:26:04,123 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-08 02:26:04,123 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:04" (1/1) ...
[2025-03-08 02:26:04,123 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:04" (1/1) ...
[2025-03-08 02:26:04,125 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:04" (1/1) ...
[2025-03-08 02:26:04,128 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:04" (1/1) ...
[2025-03-08 02:26:04,129 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:04" (1/1) ...
[2025-03-08 02:26:04,129 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:04" (1/1) ...
[2025-03-08 02:26:04,133 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 02:26:04,134 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 02:26:04,135 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 02:26:04,135 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 02:26:04,136 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:04" (1/1) ...
[2025-03-08 02:26:04,139 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 02:26:04,147 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 02:26:04,159 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 02:26:04,161 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 02:26:04,175 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 02:26:04,176 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 02:26:04,176 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 02:26:04,176 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 02:26:04,216 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 02:26:04,218 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 02:26:04,493 INFO  L?                        ?]: Removed 53 outVars from TransFormulas that were not future-live.
[2025-03-08 02:26:04,494 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 02:26:04,504 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 02:26:04,505 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 02:26:04,505 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:26:04 BoogieIcfgContainer
[2025-03-08 02:26:04,506 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 02:26:04,507 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 02:26:04,508 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 02:26:04,510 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 02:26:04,511 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:26:03" (1/3) ...
[2025-03-08 02:26:04,511 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63562971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:26:04, skipping insertion in model container
[2025-03-08 02:26:04,512 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:04" (2/3) ...
[2025-03-08 02:26:04,512 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63562971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:26:04, skipping insertion in model container
[2025-03-08 02:26:04,512 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:26:04" (3/3) ...
[2025-03-08 02:26:04,513 INFO  L128   eAbstractionObserver]: Analyzing ICFG psyco_security.c
[2025-03-08 02:26:04,522 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 02:26:04,524 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG psyco_security.c that has 1 procedures, 76 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 02:26:04,567 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 02:26:04,577 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;@26fa1fa9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 02:26:04,578 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 02:26:04,581 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 76 states, 74 states have (on average 1.945945945945946) internal successors, (144), 75 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:26:04,584 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2025-03-08 02:26:04,584 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:26:04,585 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:26:04,585 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:26:04,589 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:26:04,589 INFO  L85        PathProgramCache]: Analyzing trace with hash -991831641, now seen corresponding path program 1 times
[2025-03-08 02:26:04,594 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:26:04,594 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239472249]
[2025-03-08 02:26:04,595 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:26:04,595 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:26:04,645 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes.
[2025-03-08 02:26:04,654 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements.
[2025-03-08 02:26:04,654 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:26:04,654 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:26:04,685 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 02:26:04,686 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:26:04,686 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239472249]
[2025-03-08 02:26:04,687 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239472249] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:26:04,687 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:26:04,687 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 02:26:04,688 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709249549]
[2025-03-08 02:26:04,689 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:26:04,692 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 02:26:04,692 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:26:04,706 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 02:26:04,707 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 02:26:04,709 INFO  L87              Difference]: Start difference. First operand  has 76 states, 74 states have (on average 1.945945945945946) internal successors, (144), 75 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:26:04,726 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:26:04,727 INFO  L93              Difference]: Finished difference Result 150 states and 286 transitions.
[2025-03-08 02:26:04,728 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 02:26:04,729 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7
[2025-03-08 02:26:04,729 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:26:04,734 INFO  L225             Difference]: With dead ends: 150
[2025-03-08 02:26:04,734 INFO  L226             Difference]: Without dead ends: 72
[2025-03-08 02:26:04,737 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 02:26:04,740 INFO  L435           NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 02:26:04,741 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 02:26:04,750 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 72 states.
[2025-03-08 02:26:04,760 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72.
[2025-03-08 02:26:04,762 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 72 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 71 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:26:04,764 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 107 transitions.
[2025-03-08 02:26:04,765 INFO  L78                 Accepts]: Start accepts. Automaton has 72 states and 107 transitions. Word has length 7
[2025-03-08 02:26:04,765 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:26:04,767 INFO  L471      AbstractCegarLoop]: Abstraction has 72 states and 107 transitions.
[2025-03-08 02:26:04,767 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:26:04,767 INFO  L276                IsEmpty]: Start isEmpty. Operand 72 states and 107 transitions.
[2025-03-08 02:26:04,767 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2025-03-08 02:26:04,767 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:26:04,767 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:26:04,768 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-08 02:26:04,768 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:26:04,769 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:26:04,769 INFO  L85        PathProgramCache]: Analyzing trace with hash -663900093, now seen corresponding path program 1 times
[2025-03-08 02:26:04,770 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:26:04,770 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680272917]
[2025-03-08 02:26:04,770 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:26:04,770 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:26:04,777 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes.
[2025-03-08 02:26:04,782 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements.
[2025-03-08 02:26:04,782 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:26:04,782 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:26:04,814 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 02:26:04,814 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:26:04,815 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680272917]
[2025-03-08 02:26:04,815 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680272917] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:26:04,815 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:26:04,815 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:26:04,815 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653427237]
[2025-03-08 02:26:04,815 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:26:04,816 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:26:04,816 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:26:04,816 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:26:04,816 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:26:04,817 INFO  L87              Difference]: Start difference. First operand 72 states and 107 transitions. Second operand  has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:26:04,862 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:26:04,863 INFO  L93              Difference]: Finished difference Result 143 states and 214 transitions.
[2025-03-08 02:26:04,863 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:26:04,863 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8
[2025-03-08 02:26:04,863 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:26:04,864 INFO  L225             Difference]: With dead ends: 143
[2025-03-08 02:26:04,864 INFO  L226             Difference]: Without dead ends: 73
[2025-03-08 02:26:04,864 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:26:04,864 INFO  L435           NwaCegarLoop]: 106 mSDtfsCounter, 4 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 02:26:04,865 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 186 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 02:26:04,865 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 73 states.
[2025-03-08 02:26:04,868 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73.
[2025-03-08 02:26:04,869 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 73 states, 72 states have (on average 1.5) internal successors, (108), 72 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:26:04,869 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 108 transitions.
[2025-03-08 02:26:04,869 INFO  L78                 Accepts]: Start accepts. Automaton has 73 states and 108 transitions. Word has length 8
[2025-03-08 02:26:04,869 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:26:04,869 INFO  L471      AbstractCegarLoop]: Abstraction has 73 states and 108 transitions.
[2025-03-08 02:26:04,869 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:26:04,870 INFO  L276                IsEmpty]: Start isEmpty. Operand 73 states and 108 transitions.
[2025-03-08 02:26:04,870 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2025-03-08 02:26:04,870 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:26:04,870 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:26:04,870 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 02:26:04,870 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:26:04,870 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:26:04,870 INFO  L85        PathProgramCache]: Analyzing trace with hash -1171916928, now seen corresponding path program 1 times
[2025-03-08 02:26:04,870 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:26:04,871 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046880611]
[2025-03-08 02:26:04,871 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:26:04,871 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:26:04,875 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes.
[2025-03-08 02:26:04,880 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements.
[2025-03-08 02:26:04,880 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:26:04,880 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:26:04,928 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 02:26:04,928 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:26:04,928 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046880611]
[2025-03-08 02:26:04,928 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046880611] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:26:04,928 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:26:04,929 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:26:04,929 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643091878]
[2025-03-08 02:26:04,929 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:26:04,929 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:26:04,930 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:26:04,930 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:26:04,930 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:26:04,931 INFO  L87              Difference]: Start difference. First operand 73 states and 108 transitions. Second operand  has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:26:04,983 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:26:04,983 INFO  L93              Difference]: Finished difference Result 149 states and 221 transitions.
[2025-03-08 02:26:04,984 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:26:04,984 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12
[2025-03-08 02:26:04,984 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:26:04,985 INFO  L225             Difference]: With dead ends: 149
[2025-03-08 02:26:04,985 INFO  L226             Difference]: Without dead ends: 78
[2025-03-08 02:26:04,985 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:26:04,985 INFO  L435           NwaCegarLoop]: 104 mSDtfsCounter, 21 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 02:26:04,985 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 169 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 02:26:04,986 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 78 states.
[2025-03-08 02:26:04,990 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76.
[2025-03-08 02:26:04,991 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 76 states, 75 states have (on average 1.48) internal successors, (111), 75 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:26:04,992 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 111 transitions.
[2025-03-08 02:26:04,992 INFO  L78                 Accepts]: Start accepts. Automaton has 76 states and 111 transitions. Word has length 12
[2025-03-08 02:26:04,992 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:26:04,992 INFO  L471      AbstractCegarLoop]: Abstraction has 76 states and 111 transitions.
[2025-03-08 02:26:04,992 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:26:04,992 INFO  L276                IsEmpty]: Start isEmpty. Operand 76 states and 111 transitions.
[2025-03-08 02:26:04,992 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2025-03-08 02:26:04,992 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:26:04,992 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:26:04,992 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 02:26:04,992 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:26:04,993 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:26:04,993 INFO  L85        PathProgramCache]: Analyzing trace with hash 1866425156, now seen corresponding path program 1 times
[2025-03-08 02:26:04,993 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:26:04,993 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655017356]
[2025-03-08 02:26:04,993 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:26:04,993 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:26:05,001 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes.
[2025-03-08 02:26:05,007 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements.
[2025-03-08 02:26:05,007 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:26:05,007 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:26:05,066 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 02:26:05,066 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:26:05,066 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655017356]
[2025-03-08 02:26:05,066 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655017356] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:26:05,067 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:26:05,067 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 02:26:05,067 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870491519]
[2025-03-08 02:26:05,067 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:26:05,067 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 02:26:05,067 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:26:05,067 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 02:26:05,067 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 02:26:05,067 INFO  L87              Difference]: Start difference. First operand 76 states and 111 transitions. Second operand  has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:26:05,221 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:26:05,221 INFO  L93              Difference]: Finished difference Result 238 states and 347 transitions.
[2025-03-08 02:26:05,222 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 02:26:05,222 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15
[2025-03-08 02:26:05,222 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:26:05,223 INFO  L225             Difference]: With dead ends: 238
[2025-03-08 02:26:05,223 INFO  L226             Difference]: Without dead ends: 152
[2025-03-08 02:26:05,224 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-08 02:26:05,224 INFO  L435           NwaCegarLoop]: 151 mSDtfsCounter, 85 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 02:26:05,224 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 339 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 02:26:05,225 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 152 states.
[2025-03-08 02:26:05,231 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 120.
[2025-03-08 02:26:05,235 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 120 states, 119 states have (on average 1.5546218487394958) internal successors, (185), 119 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:26:05,235 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 185 transitions.
[2025-03-08 02:26:05,235 INFO  L78                 Accepts]: Start accepts. Automaton has 120 states and 185 transitions. Word has length 15
[2025-03-08 02:26:05,235 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:26:05,236 INFO  L471      AbstractCegarLoop]: Abstraction has 120 states and 185 transitions.
[2025-03-08 02:26:05,236 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:26:05,238 INFO  L276                IsEmpty]: Start isEmpty. Operand 120 states and 185 transitions.
[2025-03-08 02:26:05,238 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2025-03-08 02:26:05,238 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:26:05,238 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:26:05,238 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 02:26:05,238 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:26:05,238 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:26:05,239 INFO  L85        PathProgramCache]: Analyzing trace with hash -73023953, now seen corresponding path program 1 times
[2025-03-08 02:26:05,239 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:26:05,239 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572040337]
[2025-03-08 02:26:05,239 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:26:05,239 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:26:05,243 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes.
[2025-03-08 02:26:05,247 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements.
[2025-03-08 02:26:05,247 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:26:05,247 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:26:05,296 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-03-08 02:26:05,296 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:26:05,296 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572040337]
[2025-03-08 02:26:05,296 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572040337] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:26:05,297 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:26:05,297 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:26:05,297 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591871948]
[2025-03-08 02:26:05,297 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:26:05,297 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:26:05,297 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:26:05,297 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:26:05,297 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:26:05,297 INFO  L87              Difference]: Start difference. First operand 120 states and 185 transitions. Second operand  has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:26:05,327 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:26:05,327 INFO  L93              Difference]: Finished difference Result 217 states and 332 transitions.
[2025-03-08 02:26:05,327 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:26:05,328 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18
[2025-03-08 02:26:05,328 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:26:05,328 INFO  L225             Difference]: With dead ends: 217
[2025-03-08 02:26:05,329 INFO  L226             Difference]: Without dead ends: 99
[2025-03-08 02:26:05,330 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:26:05,331 INFO  L435           NwaCegarLoop]: 97 mSDtfsCounter, 28 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 02:26:05,331 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 147 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 02:26:05,331 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 99 states.
[2025-03-08 02:26:05,337 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97.
[2025-03-08 02:26:05,339 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 97 states, 96 states have (on average 1.4583333333333333) internal successors, (140), 96 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:26:05,343 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 140 transitions.
[2025-03-08 02:26:05,343 INFO  L78                 Accepts]: Start accepts. Automaton has 97 states and 140 transitions. Word has length 18
[2025-03-08 02:26:05,343 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:26:05,343 INFO  L471      AbstractCegarLoop]: Abstraction has 97 states and 140 transitions.
[2025-03-08 02:26:05,343 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:26:05,343 INFO  L276                IsEmpty]: Start isEmpty. Operand 97 states and 140 transitions.
[2025-03-08 02:26:05,343 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-03-08 02:26:05,343 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:26:05,343 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:26:05,343 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 02:26:05,343 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:26:05,344 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:26:05,344 INFO  L85        PathProgramCache]: Analyzing trace with hash -748259890, now seen corresponding path program 1 times
[2025-03-08 02:26:05,344 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:26:05,344 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320976410]
[2025-03-08 02:26:05,344 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:26:05,344 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:26:05,352 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-03-08 02:26:05,356 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-03-08 02:26:05,358 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:26:05,358 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:26:05,383 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-03-08 02:26:05,383 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:26:05,383 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320976410]
[2025-03-08 02:26:05,383 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320976410] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:26:05,383 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:26:05,384 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:26:05,384 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473438219]
[2025-03-08 02:26:05,384 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:26:05,384 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:26:05,384 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:26:05,385 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:26:05,385 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:26:05,385 INFO  L87              Difference]: Start difference. First operand 97 states and 140 transitions. Second operand  has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:26:05,418 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:26:05,418 INFO  L93              Difference]: Finished difference Result 175 states and 254 transitions.
[2025-03-08 02:26:05,419 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:26:05,419 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20
[2025-03-08 02:26:05,419 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:26:05,419 INFO  L225             Difference]: With dead ends: 175
[2025-03-08 02:26:05,419 INFO  L226             Difference]: Without dead ends: 80
[2025-03-08 02:26:05,420 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:26:05,420 INFO  L435           NwaCegarLoop]: 80 mSDtfsCounter, 27 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 02:26:05,420 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 118 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 02:26:05,421 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 80 states.
[2025-03-08 02:26:05,423 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78.
[2025-03-08 02:26:05,424 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 78 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 77 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:26:05,424 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 111 transitions.
[2025-03-08 02:26:05,424 INFO  L78                 Accepts]: Start accepts. Automaton has 78 states and 111 transitions. Word has length 20
[2025-03-08 02:26:05,424 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:26:05,424 INFO  L471      AbstractCegarLoop]: Abstraction has 78 states and 111 transitions.
[2025-03-08 02:26:05,424 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:26:05,424 INFO  L276                IsEmpty]: Start isEmpty. Operand 78 states and 111 transitions.
[2025-03-08 02:26:05,425 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2025-03-08 02:26:05,425 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:26:05,425 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:26:05,425 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 02:26:05,425 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:26:05,425 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:26:05,425 INFO  L85        PathProgramCache]: Analyzing trace with hash 2115486016, now seen corresponding path program 1 times
[2025-03-08 02:26:05,426 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:26:05,426 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514481162]
[2025-03-08 02:26:05,426 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:26:05,426 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:26:05,434 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes.
[2025-03-08 02:26:05,436 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements.
[2025-03-08 02:26:05,436 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:26:05,436 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:26:05,457 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-03-08 02:26:05,457 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:26:05,457 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514481162]
[2025-03-08 02:26:05,458 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514481162] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:26:05,458 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:26:05,458 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:26:05,458 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555940549]
[2025-03-08 02:26:05,458 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:26:05,458 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:26:05,458 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:26:05,459 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:26:05,459 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:26:05,459 INFO  L87              Difference]: Start difference. First operand 78 states and 111 transitions. Second operand  has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:26:05,480 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:26:05,480 INFO  L93              Difference]: Finished difference Result 122 states and 175 transitions.
[2025-03-08 02:26:05,480 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:26:05,481 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22
[2025-03-08 02:26:05,481 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:26:05,481 INFO  L225             Difference]: With dead ends: 122
[2025-03-08 02:26:05,481 INFO  L226             Difference]: Without dead ends: 60
[2025-03-08 02:26:05,482 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:26:05,483 INFO  L435           NwaCegarLoop]: 73 mSDtfsCounter, 14 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 02:26:05,483 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 109 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 02:26:05,483 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 60 states.
[2025-03-08 02:26:05,487 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60.
[2025-03-08 02:26:05,487 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 60 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 59 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:26:05,487 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions.
[2025-03-08 02:26:05,488 INFO  L78                 Accepts]: Start accepts. Automaton has 60 states and 78 transitions. Word has length 22
[2025-03-08 02:26:05,488 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:26:05,488 INFO  L471      AbstractCegarLoop]: Abstraction has 60 states and 78 transitions.
[2025-03-08 02:26:05,488 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:26:05,489 INFO  L276                IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions.
[2025-03-08 02:26:05,489 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2025-03-08 02:26:05,489 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:26:05,489 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:26:05,492 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 02:26:05,493 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:26:05,493 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:26:05,493 INFO  L85        PathProgramCache]: Analyzing trace with hash -1734401796, now seen corresponding path program 1 times
[2025-03-08 02:26:05,493 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:26:05,493 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678645311]
[2025-03-08 02:26:05,493 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:26:05,493 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:26:05,497 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-03-08 02:26:05,503 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-03-08 02:26:05,506 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:26:05,506 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:26:05,528 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-03-08 02:26:05,528 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:26:05,528 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678645311]
[2025-03-08 02:26:05,528 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678645311] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:26:05,528 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:26:05,528 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:26:05,528 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040939294]
[2025-03-08 02:26:05,528 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:26:05,529 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:26:05,529 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:26:05,529 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:26:05,529 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:26:05,529 INFO  L87              Difference]: Start difference. First operand 60 states and 78 transitions. Second operand  has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:26:05,546 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:26:05,546 INFO  L93              Difference]: Finished difference Result 98 states and 130 transitions.
[2025-03-08 02:26:05,546 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:26:05,546 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25
[2025-03-08 02:26:05,547 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:26:05,547 INFO  L225             Difference]: With dead ends: 98
[2025-03-08 02:26:05,547 INFO  L226             Difference]: Without dead ends: 0
[2025-03-08 02:26:05,548 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:26:05,548 INFO  L435           NwaCegarLoop]: 65 mSDtfsCounter, 12 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 02:26:05,549 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 98 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 02:26:05,549 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-03-08 02:26:05,549 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-03-08 02:26:05,550 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:26:05,550 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-03-08 02:26:05,550 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25
[2025-03-08 02:26:05,550 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:26:05,550 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-03-08 02:26:05,550 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:26:05,550 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-03-08 02:26:05,551 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-03-08 02:26:05,554 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-08 02:26:05,555 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 02:26:05,557 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:26:05,559 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-03-08 02:26:05,582 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-08 02:26:05,596 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:26:05 BoogieIcfgContainer
[2025-03-08 02:26:05,596 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-08 02:26:05,596 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-08 02:26:05,597 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-08 02:26:05,597 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-08 02:26:05,597 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:26:04" (3/4) ...
[2025-03-08 02:26:05,599 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-03-08 02:26:05,606 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges
[2025-03-08 02:26:05,607 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-03-08 02:26:05,607 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-03-08 02:26:05,607 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-03-08 02:26:05,664 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-08 02:26:05,664 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-08 02:26:05,664 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-08 02:26:05,665 INFO  L158              Benchmark]: Toolchain (without parser) took 1791.23ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 62.3MB in the end (delta: 51.2MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB.
[2025-03-08 02:26:05,665 INFO  L158              Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 02:26:05,665 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 191.15ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 100.7MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-08 02:26:05,665 INFO  L158              Benchmark]: Boogie Procedure Inliner took 35.58ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.0MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-08 02:26:05,665 INFO  L158              Benchmark]: Boogie Preprocessor took 31.18ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 02:26:05,665 INFO  L158              Benchmark]: IcfgBuilder took 371.79ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 77.2MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-03-08 02:26:05,666 INFO  L158              Benchmark]: TraceAbstraction took 1088.79ms. Allocated memory is still 142.6MB. Free memory was 76.8MB in the beginning and 70.1MB in the end (delta: 6.7MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB.
[2025-03-08 02:26:05,666 INFO  L158              Benchmark]: Witness Printer took 67.93ms. Allocated memory is still 142.6MB. Free memory was 70.1MB in the beginning and 62.3MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-08 02:26:05,667 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 191.15ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 100.7MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 35.58ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.0MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 31.18ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 371.79ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 77.2MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * TraceAbstraction took 1088.79ms. Allocated memory is still 142.6MB. Free memory was 76.8MB in the beginning and 70.1MB in the end (delta: 6.7MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB.
 * Witness Printer took 67.93ms. Allocated memory is still 142.6MB. Free memory was 70.1MB in the beginning and 62.3MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 391]: a call to reach_error is unreachable
    For all program executions holds that a call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 76 locations, 144 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 191 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 191 mSDsluCounter, 1284 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 490 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 260 IncrementalHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 794 mSDtfsCounter, 260 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=4, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 38 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 200 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 20/20 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 24]: Location Invariant
    Derived location invariant: (((((this_state == 3) && (4 <= q)) || ((2 == q) && (this_state == 0))) || (q == 0)) || ((3 == q) && (this_state == 2)))
RESULT: Ultimate proved your program to be correct!
[2025-03-08 02:26:05,680 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE