./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-15.i --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version c00e63dc
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-15.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 8d0fc821ea522a8aee21b189e90103df9d9f6db3ffb0f3b85fd1234b07bd51ee
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 21:55:18,432 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 21:55:18,493 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-02-05 21:55:18,498 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 21:55:18,500 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 21:55:18,524 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 21:55:18,524 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 21:55:18,525 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 21:55:18,525 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 21:55:18,526 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 21:55:18,526 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 21:55:18,526 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 21:55:18,526 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 21:55:18,526 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 21:55:18,526 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 21:55:18,526 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 21:55:18,527 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 21:55:18,527 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 21:55:18,527 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 21:55:18,527 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 21:55:18,527 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 21:55:18,527 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 21:55:18,527 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 21:55:18,527 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 21:55:18,527 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 21:55:18,527 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 21:55:18,527 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 21:55:18,527 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 21:55:18,528 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 21:55:18,528 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 21:55:18,528 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 21:55:18,528 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 21:55:18,528 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 21:55:18,528 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 21:55:18,528 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 21:55:18,528 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 21:55:18,528 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 21:55:18,528 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 21:55:18,528 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 21:55:18,529 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 21:55:18,529 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 21:55:18,529 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 21:55:18,529 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 21:55:18,529 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-jdk21/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 -> 8d0fc821ea522a8aee21b189e90103df9d9f6db3ffb0f3b85fd1234b07bd51ee
[2025-02-05 21:55:18,761 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 21:55:18,776 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 21:55:18,778 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 21:55:18,779 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 21:55:18,779 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 21:55:18,780 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-15.i
[2025-02-05 21:55:19,983 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b67ce874c/6baf21113bb84c94a8a516817a719043/FLAG3db24aedb
[2025-02-05 21:55:20,212 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 21:55:20,212 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-15.i
[2025-02-05 21:55:20,229 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b67ce874c/6baf21113bb84c94a8a516817a719043/FLAG3db24aedb
[2025-02-05 21:55:20,242 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b67ce874c/6baf21113bb84c94a8a516817a719043
[2025-02-05 21:55:20,243 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 21:55:20,244 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 21:55:20,246 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 21:55:20,246 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 21:55:20,249 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 21:55:20,249 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:55:20" (1/1) ...
[2025-02-05 21:55:20,250 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@476cee48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:20, skipping insertion in model container
[2025-02-05 21:55:20,250 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:55:20" (1/1) ...
[2025-02-05 21:55:20,280 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 21:55:20,386 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-15.i[916,929]
[2025-02-05 21:55:20,523 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 21:55:20,535 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 21:55:20,548 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-15.i[916,929]
[2025-02-05 21:55:20,616 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 21:55:20,641 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 21:55:20,642 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:20 WrapperNode
[2025-02-05 21:55:20,642 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 21:55:20,642 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 21:55:20,642 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 21:55:20,643 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 21:55:20,650 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:20" (1/1) ...
[2025-02-05 21:55:20,667 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:20" (1/1) ...
[2025-02-05 21:55:20,722 INFO  L138                Inliner]: procedures = 26, calls = 118, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 805
[2025-02-05 21:55:20,723 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 21:55:20,723 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 21:55:20,723 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 21:55:20,723 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 21:55:20,731 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:20" (1/1) ...
[2025-02-05 21:55:20,731 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:20" (1/1) ...
[2025-02-05 21:55:20,741 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:20" (1/1) ...
[2025-02-05 21:55:20,780 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-02-05 21:55:20,780 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:20" (1/1) ...
[2025-02-05 21:55:20,780 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:20" (1/1) ...
[2025-02-05 21:55:20,803 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:20" (1/1) ...
[2025-02-05 21:55:20,807 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:20" (1/1) ...
[2025-02-05 21:55:20,816 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:20" (1/1) ...
[2025-02-05 21:55:20,820 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:20" (1/1) ...
[2025-02-05 21:55:20,826 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 21:55:20,827 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 21:55:20,827 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 21:55:20,827 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 21:55:20,828 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:20" (1/1) ...
[2025-02-05 21:55:20,831 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 21:55:20,840 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 21:55:20,852 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-05 21:55:20,866 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-05 21:55:20,878 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 21:55:20,878 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-02-05 21:55:20,879 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-02-05 21:55:20,879 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 21:55:20,879 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 21:55:20,879 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 21:55:20,966 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 21:55:20,968 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 21:55:21,881 INFO  L?                        ?]: Removed 18 outVars from TransFormulas that were not future-live.
[2025-02-05 21:55:21,882 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 21:55:21,938 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 21:55:21,941 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 21:55:21,942 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:55:21 BoogieIcfgContainer
[2025-02-05 21:55:21,942 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 21:55:21,944 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 21:55:21,944 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 21:55:21,948 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 21:55:21,948 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:55:20" (1/3) ...
[2025-02-05 21:55:21,948 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1386ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:55:21, skipping insertion in model container
[2025-02-05 21:55:21,949 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:20" (2/3) ...
[2025-02-05 21:55:21,949 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1386ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:55:21, skipping insertion in model container
[2025-02-05 21:55:21,949 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:55:21" (3/3) ...
[2025-02-05 21:55:21,950 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-15.i
[2025-02-05 21:55:21,959 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 21:55:21,962 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-15.i that has 2 procedures, 343 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 21:55:22,013 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 21:55:22,022 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;@3aff61b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 21:55:22,022 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 21:55:22,028 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 343 states, 235 states have (on average 1.6085106382978724) internal successors, (378), 236 states have internal predecessors, (378), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105)
[2025-02-05 21:55:22,055 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 675
[2025-02-05 21:55:22,056 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:55:22,057 INFO  L218           NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:55:22,057 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:55:22,062 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:55:22,062 INFO  L85        PathProgramCache]: Analyzing trace with hash -1112230739, now seen corresponding path program 1 times
[2025-02-05 21:55:22,067 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:55:22,068 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164018238]
[2025-02-05 21:55:22,068 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:55:22,070 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:55:22,153 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 674 statements into 1 equivalence classes.
[2025-02-05 21:55:22,183 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 674 of 674 statements.
[2025-02-05 21:55:22,184 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:55:22,184 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:55:22,521 INFO  L134       CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 21632 trivial. 0 not checked.
[2025-02-05 21:55:22,522 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:55:22,522 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164018238]
[2025-02-05 21:55:22,522 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164018238] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 21:55:22,522 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31272220]
[2025-02-05 21:55:22,522 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:55:22,522 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 21:55:22,523 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 21:55:22,526 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 21:55:22,527 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-02-05 21:55:22,690 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 674 statements into 1 equivalence classes.
[2025-02-05 21:55:22,856 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 674 of 674 statements.
[2025-02-05 21:55:22,856 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:55:22,857 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:55:22,866 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1531 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-02-05 21:55:22,886 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 21:55:22,953 INFO  L134       CoverageAnalysis]: Checked inductivity of 21840 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 21632 trivial. 0 not checked.
[2025-02-05 21:55:22,953 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 21:55:22,953 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [31272220] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:55:22,953 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 21:55:22,954 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-02-05 21:55:22,955 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895926947]
[2025-02-05 21:55:22,955 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:55:22,961 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-02-05 21:55:22,961 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:55:22,977 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-02-05 21:55:22,977 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-05 21:55:22,980 INFO  L87              Difference]: Start difference. First operand  has 343 states, 235 states have (on average 1.6085106382978724) internal successors, (378), 236 states have internal predecessors, (378), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) Second operand  has 2 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 2 states have call successors, (105), 2 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 2 states have call successors, (105)
[2025-02-05 21:55:23,079 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:55:23,079 INFO  L93              Difference]: Finished difference Result 680 states and 1276 transitions.
[2025-02-05 21:55:23,080 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-02-05 21:55:23,081 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 2 states have call successors, (105), 2 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 2 states have call successors, (105) Word has length 674
[2025-02-05 21:55:23,081 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:55:23,088 INFO  L225             Difference]: With dead ends: 680
[2025-02-05 21:55:23,088 INFO  L226             Difference]: Without dead ends: 340
[2025-02-05 21:55:23,092 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 675 GetRequests, 675 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-02-05 21:55:23,093 INFO  L435           NwaCegarLoop]: 573 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 21:55:23,094 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 573 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 21:55:23,104 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 340 states.
[2025-02-05 21:55:23,144 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340.
[2025-02-05 21:55:23,145 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 340 states, 233 states have (on average 1.6008583690987124) internal successors, (373), 233 states have internal predecessors, (373), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105)
[2025-02-05 21:55:23,151 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 583 transitions.
[2025-02-05 21:55:23,153 INFO  L78                 Accepts]: Start accepts. Automaton has 340 states and 583 transitions. Word has length 674
[2025-02-05 21:55:23,154 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:55:23,154 INFO  L471      AbstractCegarLoop]: Abstraction has 340 states and 583 transitions.
[2025-02-05 21:55:23,155 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 2 states have call successors, (105), 2 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 2 states have call successors, (105)
[2025-02-05 21:55:23,155 INFO  L276                IsEmpty]: Start isEmpty. Operand 340 states and 583 transitions.
[2025-02-05 21:55:23,188 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 675
[2025-02-05 21:55:23,188 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:55:23,189 INFO  L218           NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:55:23,199 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-02-05 21:55:23,390 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-02-05 21:55:23,390 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:55:23,392 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:55:23,392 INFO  L85        PathProgramCache]: Analyzing trace with hash -239666100, now seen corresponding path program 1 times
[2025-02-05 21:55:23,392 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:55:23,393 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092805279]
[2025-02-05 21:55:23,393 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:55:23,393 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:55:23,444 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 674 statements into 1 equivalence classes.
[2025-02-05 21:55:23,501 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 674 of 674 statements.
[2025-02-05 21:55:23,501 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:55:23,501 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:55:23,988 INFO  L134       CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked.
[2025-02-05 21:55:23,989 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:55:23,989 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092805279]
[2025-02-05 21:55:23,989 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092805279] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:55:23,989 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:55:23,989 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 21:55:23,989 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884273304]
[2025-02-05 21:55:23,989 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:55:23,990 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 21:55:23,990 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:55:23,993 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 21:55:23,993 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 21:55:23,993 INFO  L87              Difference]: Start difference. First operand 340 states and 583 transitions. Second operand  has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105)
[2025-02-05 21:55:24,112 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:55:24,114 INFO  L93              Difference]: Finished difference Result 887 states and 1532 transitions.
[2025-02-05 21:55:24,115 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 21:55:24,115 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 674
[2025-02-05 21:55:24,117 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:55:24,123 INFO  L225             Difference]: With dead ends: 887
[2025-02-05 21:55:24,123 INFO  L226             Difference]: Without dead ends: 550
[2025-02-05 21:55:24,125 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-02-05 21:55:24,125 INFO  L435           NwaCegarLoop]: 647 mSDtfsCounter, 352 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 21:55:24,126 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1202 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 21:55:24,127 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 550 states.
[2025-02-05 21:55:24,186 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 547.
[2025-02-05 21:55:24,190 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 547 states, 413 states have (on average 1.6561743341404358) internal successors, (684), 414 states have internal predecessors, (684), 131 states have call successors, (131), 2 states have call predecessors, (131), 2 states have return successors, (131), 130 states have call predecessors, (131), 131 states have call successors, (131)
[2025-02-05 21:55:24,193 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 946 transitions.
[2025-02-05 21:55:24,194 INFO  L78                 Accepts]: Start accepts. Automaton has 547 states and 946 transitions. Word has length 674
[2025-02-05 21:55:24,195 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:55:24,197 INFO  L471      AbstractCegarLoop]: Abstraction has 547 states and 946 transitions.
[2025-02-05 21:55:24,198 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105)
[2025-02-05 21:55:24,198 INFO  L276                IsEmpty]: Start isEmpty. Operand 547 states and 946 transitions.
[2025-02-05 21:55:24,205 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 675
[2025-02-05 21:55:24,206 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:55:24,206 INFO  L218           NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:55:24,207 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 21:55:24,207 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:55:24,208 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:55:24,208 INFO  L85        PathProgramCache]: Analyzing trace with hash -1608959635, now seen corresponding path program 1 times
[2025-02-05 21:55:24,208 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:55:24,209 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591385690]
[2025-02-05 21:55:24,209 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:55:24,210 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:55:24,263 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 674 statements into 1 equivalence classes.
[2025-02-05 21:55:24,328 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 674 of 674 statements.
[2025-02-05 21:55:24,330 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:55:24,330 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:55:24,644 INFO  L134       CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked.
[2025-02-05 21:55:24,644 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:55:24,645 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591385690]
[2025-02-05 21:55:24,647 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591385690] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:55:24,647 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:55:24,647 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 21:55:24,647 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640225902]
[2025-02-05 21:55:24,647 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:55:24,648 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 21:55:24,649 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:55:24,649 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 21:55:24,649 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 21:55:24,650 INFO  L87              Difference]: Start difference. First operand 547 states and 946 transitions. Second operand  has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105)
[2025-02-05 21:55:24,734 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:55:24,735 INFO  L93              Difference]: Finished difference Result 1635 states and 2832 transitions.
[2025-02-05 21:55:24,735 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 21:55:24,735 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 674
[2025-02-05 21:55:24,737 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:55:24,747 INFO  L225             Difference]: With dead ends: 1635
[2025-02-05 21:55:24,748 INFO  L226             Difference]: Without dead ends: 1091
[2025-02-05 21:55:24,750 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-02-05 21:55:24,752 INFO  L435           NwaCegarLoop]: 741 mSDtfsCounter, 385 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 21:55:24,752 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1303 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 21:55:24,755 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1091 states.
[2025-02-05 21:55:24,873 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1089.
[2025-02-05 21:55:24,875 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1089 states, 822 states have (on average 1.6569343065693432) internal successors, (1362), 824 states have internal predecessors, (1362), 262 states have call successors, (262), 4 states have call predecessors, (262), 4 states have return successors, (262), 260 states have call predecessors, (262), 262 states have call successors, (262)
[2025-02-05 21:55:24,880 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1886 transitions.
[2025-02-05 21:55:24,881 INFO  L78                 Accepts]: Start accepts. Automaton has 1089 states and 1886 transitions. Word has length 674
[2025-02-05 21:55:24,881 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:55:24,882 INFO  L471      AbstractCegarLoop]: Abstraction has 1089 states and 1886 transitions.
[2025-02-05 21:55:24,883 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105)
[2025-02-05 21:55:24,883 INFO  L276                IsEmpty]: Start isEmpty. Operand 1089 states and 1886 transitions.
[2025-02-05 21:55:24,888 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 676
[2025-02-05 21:55:24,888 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:55:24,888 INFO  L218           NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:55:24,888 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 21:55:24,889 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:55:24,889 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:55:24,890 INFO  L85        PathProgramCache]: Analyzing trace with hash 1059795931, now seen corresponding path program 1 times
[2025-02-05 21:55:24,890 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:55:24,890 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276062388]
[2025-02-05 21:55:24,890 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:55:24,890 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:55:24,923 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 675 statements into 1 equivalence classes.
[2025-02-05 21:55:24,956 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 675 of 675 statements.
[2025-02-05 21:55:24,957 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:55:24,957 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:55:25,483 INFO  L134       CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked.
[2025-02-05 21:55:25,483 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:55:25,483 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276062388]
[2025-02-05 21:55:25,483 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276062388] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:55:25,483 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:55:25,483 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 21:55:25,483 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622391399]
[2025-02-05 21:55:25,484 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:55:25,484 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 21:55:25,484 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:55:25,485 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 21:55:25,485 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 21:55:25,485 INFO  L87              Difference]: Start difference. First operand 1089 states and 1886 transitions. Second operand  has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105)
[2025-02-05 21:55:26,153 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:55:26,153 INFO  L93              Difference]: Finished difference Result 2721 states and 4713 transitions.
[2025-02-05 21:55:26,153 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 21:55:26,154 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 675
[2025-02-05 21:55:26,155 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:55:26,164 INFO  L225             Difference]: With dead ends: 2721
[2025-02-05 21:55:26,164 INFO  L226             Difference]: Without dead ends: 2177
[2025-02-05 21:55:26,166 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 21:55:26,167 INFO  L435           NwaCegarLoop]: 1124 mSDtfsCounter, 744 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 2027 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 21:55:26,167 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 2027 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 21:55:26,168 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2177 states.
[2025-02-05 21:55:26,304 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2177 to 2173.
[2025-02-05 21:55:26,308 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2173 states, 1640 states have (on average 1.6573170731707316) internal successors, (2718), 1644 states have internal predecessors, (2718), 524 states have call successors, (524), 8 states have call predecessors, (524), 8 states have return successors, (524), 520 states have call predecessors, (524), 524 states have call successors, (524)
[2025-02-05 21:55:26,317 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2173 states to 2173 states and 3766 transitions.
[2025-02-05 21:55:26,318 INFO  L78                 Accepts]: Start accepts. Automaton has 2173 states and 3766 transitions. Word has length 675
[2025-02-05 21:55:26,319 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:55:26,319 INFO  L471      AbstractCegarLoop]: Abstraction has 2173 states and 3766 transitions.
[2025-02-05 21:55:26,319 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105)
[2025-02-05 21:55:26,319 INFO  L276                IsEmpty]: Start isEmpty. Operand 2173 states and 3766 transitions.
[2025-02-05 21:55:26,324 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 676
[2025-02-05 21:55:26,324 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:55:26,324 INFO  L218           NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:55:26,324 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 21:55:26,325 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:55:26,325 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:55:26,325 INFO  L85        PathProgramCache]: Analyzing trace with hash 1397420107, now seen corresponding path program 1 times
[2025-02-05 21:55:26,325 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:55:26,325 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546239679]
[2025-02-05 21:55:26,326 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:55:26,326 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:55:26,352 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 675 statements into 1 equivalence classes.
[2025-02-05 21:55:26,377 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 675 of 675 statements.
[2025-02-05 21:55:26,378 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:55:26,378 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:55:26,490 INFO  L134       CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked.
[2025-02-05 21:55:26,490 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:55:26,490 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546239679]
[2025-02-05 21:55:26,490 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546239679] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:55:26,491 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:55:26,491 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 21:55:26,491 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476715758]
[2025-02-05 21:55:26,491 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:55:26,491 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 21:55:26,491 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:55:26,492 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 21:55:26,492 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 21:55:26,492 INFO  L87              Difference]: Start difference. First operand 2173 states and 3766 transitions. Second operand  has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105)
[2025-02-05 21:55:26,596 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:55:26,596 INFO  L93              Difference]: Finished difference Result 4351 states and 7545 transitions.
[2025-02-05 21:55:26,596 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 21:55:26,597 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 675
[2025-02-05 21:55:26,597 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:55:26,607 INFO  L225             Difference]: With dead ends: 4351
[2025-02-05 21:55:26,607 INFO  L226             Difference]: Without dead ends: 2181
[2025-02-05 21:55:26,611 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-02-05 21:55:26,611 INFO  L435           NwaCegarLoop]: 572 mSDtfsCounter, 0 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 21:55:26,612 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1137 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 21:55:26,613 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2181 states.
[2025-02-05 21:55:26,720 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 2181.
[2025-02-05 21:55:26,724 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2181 states, 1648 states have (on average 1.654126213592233) internal successors, (2726), 1652 states have internal predecessors, (2726), 524 states have call successors, (524), 8 states have call predecessors, (524), 8 states have return successors, (524), 520 states have call predecessors, (524), 524 states have call successors, (524)
[2025-02-05 21:55:26,732 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 3774 transitions.
[2025-02-05 21:55:26,735 INFO  L78                 Accepts]: Start accepts. Automaton has 2181 states and 3774 transitions. Word has length 675
[2025-02-05 21:55:26,735 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:55:26,736 INFO  L471      AbstractCegarLoop]: Abstraction has 2181 states and 3774 transitions.
[2025-02-05 21:55:26,736 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105)
[2025-02-05 21:55:26,736 INFO  L276                IsEmpty]: Start isEmpty. Operand 2181 states and 3774 transitions.
[2025-02-05 21:55:26,740 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 677
[2025-02-05 21:55:26,741 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:55:26,741 INFO  L218           NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:55:26,741 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 21:55:26,741 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:55:26,742 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:55:26,742 INFO  L85        PathProgramCache]: Analyzing trace with hash -858925554, now seen corresponding path program 1 times
[2025-02-05 21:55:26,742 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:55:26,742 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817973534]
[2025-02-05 21:55:26,742 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:55:26,742 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:55:26,768 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 676 statements into 1 equivalence classes.
[2025-02-05 21:55:26,791 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 676 of 676 statements.
[2025-02-05 21:55:26,791 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:55:26,791 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:55:26,934 INFO  L134       CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked.
[2025-02-05 21:55:26,935 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:55:26,935 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817973534]
[2025-02-05 21:55:26,935 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817973534] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:55:26,935 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:55:26,935 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 21:55:26,935 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078798372]
[2025-02-05 21:55:26,935 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:55:26,936 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 21:55:26,936 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:55:26,936 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 21:55:26,936 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 21:55:26,937 INFO  L87              Difference]: Start difference. First operand 2181 states and 3774 transitions. Second operand  has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105)
[2025-02-05 21:55:27,061 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:55:27,062 INFO  L93              Difference]: Finished difference Result 5865 states and 10120 transitions.
[2025-02-05 21:55:27,062 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 21:55:27,062 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 676
[2025-02-05 21:55:27,063 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:55:27,079 INFO  L225             Difference]: With dead ends: 5865
[2025-02-05 21:55:27,079 INFO  L226             Difference]: Without dead ends: 3687
[2025-02-05 21:55:27,085 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-02-05 21:55:27,085 INFO  L435           NwaCegarLoop]: 839 mSDtfsCounter, 368 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 21:55:27,085 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 1389 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 21:55:27,087 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3687 states.
[2025-02-05 21:55:27,338 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3687 to 3681.
[2025-02-05 21:55:27,344 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3681 states, 2812 states have (on average 1.647226173541963) internal successors, (4632), 2824 states have internal predecessors, (4632), 852 states have call successors, (852), 16 states have call predecessors, (852), 16 states have return successors, (852), 840 states have call predecessors, (852), 852 states have call successors, (852)
[2025-02-05 21:55:27,360 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 6336 transitions.
[2025-02-05 21:55:27,363 INFO  L78                 Accepts]: Start accepts. Automaton has 3681 states and 6336 transitions. Word has length 676
[2025-02-05 21:55:27,364 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:55:27,364 INFO  L471      AbstractCegarLoop]: Abstraction has 3681 states and 6336 transitions.
[2025-02-05 21:55:27,364 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105)
[2025-02-05 21:55:27,365 INFO  L276                IsEmpty]: Start isEmpty. Operand 3681 states and 6336 transitions.
[2025-02-05 21:55:27,373 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 677
[2025-02-05 21:55:27,373 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:55:27,374 INFO  L218           NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:55:27,374 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 21:55:27,374 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:55:27,375 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:55:27,375 INFO  L85        PathProgramCache]: Analyzing trace with hash -1465829647, now seen corresponding path program 1 times
[2025-02-05 21:55:27,375 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:55:27,375 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814083982]
[2025-02-05 21:55:27,375 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:55:27,375 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:55:27,408 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 676 statements into 1 equivalence classes.
[2025-02-05 21:55:27,436 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 676 of 676 statements.
[2025-02-05 21:55:27,437 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:55:27,437 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:55:27,585 INFO  L134       CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked.
[2025-02-05 21:55:27,586 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:55:27,586 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814083982]
[2025-02-05 21:55:27,586 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814083982] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:55:27,586 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:55:27,586 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 21:55:27,586 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075881086]
[2025-02-05 21:55:27,586 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:55:27,587 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 21:55:27,587 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:55:27,588 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 21:55:27,588 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 21:55:27,588 INFO  L87              Difference]: Start difference. First operand 3681 states and 6336 transitions. Second operand  has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105)
[2025-02-05 21:55:27,815 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:55:27,816 INFO  L93              Difference]: Finished difference Result 9869 states and 16830 transitions.
[2025-02-05 21:55:27,816 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 21:55:27,816 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 676
[2025-02-05 21:55:27,817 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:55:27,843 INFO  L225             Difference]: With dead ends: 9869
[2025-02-05 21:55:27,844 INFO  L226             Difference]: Without dead ends: 6191
[2025-02-05 21:55:27,851 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-02-05 21:55:27,852 INFO  L435           NwaCegarLoop]: 572 mSDtfsCounter, 337 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 21:55:27,852 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1133 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 21:55:27,856 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6191 states.
[2025-02-05 21:55:28,223 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6191 to 6185.
[2025-02-05 21:55:28,233 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6185 states, 4520 states have (on average 1.595575221238938) internal successors, (7212), 4548 states have internal predecessors, (7212), 1632 states have call successors, (1632), 32 states have call predecessors, (1632), 32 states have return successors, (1632), 1604 states have call predecessors, (1632), 1632 states have call successors, (1632)
[2025-02-05 21:55:28,256 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6185 states to 6185 states and 10476 transitions.
[2025-02-05 21:55:28,262 INFO  L78                 Accepts]: Start accepts. Automaton has 6185 states and 10476 transitions. Word has length 676
[2025-02-05 21:55:28,263 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:55:28,263 INFO  L471      AbstractCegarLoop]: Abstraction has 6185 states and 10476 transitions.
[2025-02-05 21:55:28,263 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105)
[2025-02-05 21:55:28,263 INFO  L276                IsEmpty]: Start isEmpty. Operand 6185 states and 10476 transitions.
[2025-02-05 21:55:28,270 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 677
[2025-02-05 21:55:28,270 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:55:28,271 INFO  L218           NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:55:28,271 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 21:55:28,271 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:55:28,271 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:55:28,272 INFO  L85        PathProgramCache]: Analyzing trace with hash -1254478734, now seen corresponding path program 1 times
[2025-02-05 21:55:28,272 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:55:28,272 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237838210]
[2025-02-05 21:55:28,272 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:55:28,272 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:55:28,298 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 676 statements into 1 equivalence classes.
[2025-02-05 21:55:28,319 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 676 of 676 statements.
[2025-02-05 21:55:28,320 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:55:28,320 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:55:28,425 INFO  L134       CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked.
[2025-02-05 21:55:28,425 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:55:28,426 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237838210]
[2025-02-05 21:55:28,426 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237838210] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:55:28,426 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:55:28,426 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 21:55:28,426 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338717234]
[2025-02-05 21:55:28,426 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:55:28,427 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 21:55:28,427 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:55:28,427 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 21:55:28,427 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 21:55:28,427 INFO  L87              Difference]: Start difference. First operand 6185 states and 10476 transitions. Second operand  has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105)
[2025-02-05 21:55:28,788 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:55:28,788 INFO  L93              Difference]: Finished difference Result 15985 states and 26822 transitions.
[2025-02-05 21:55:28,788 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 21:55:28,789 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 676
[2025-02-05 21:55:28,790 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:55:28,835 INFO  L225             Difference]: With dead ends: 15985
[2025-02-05 21:55:28,836 INFO  L226             Difference]: Without dead ends: 9803
[2025-02-05 21:55:28,853 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-02-05 21:55:28,853 INFO  L435           NwaCegarLoop]: 570 mSDtfsCounter, 228 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 21:55:28,853 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1128 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 21:55:28,860 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9803 states.
[2025-02-05 21:55:29,513 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9803 to 9793.
[2025-02-05 21:55:29,525 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9793 states, 6768 states have (on average 1.5277777777777777) internal successors, (10340), 6828 states have internal predecessors, (10340), 2960 states have call successors, (2960), 64 states have call predecessors, (2960), 64 states have return successors, (2960), 2900 states have call predecessors, (2960), 2960 states have call successors, (2960)
[2025-02-05 21:55:29,572 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9793 states to 9793 states and 16260 transitions.
[2025-02-05 21:55:29,581 INFO  L78                 Accepts]: Start accepts. Automaton has 9793 states and 16260 transitions. Word has length 676
[2025-02-05 21:55:29,582 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:55:29,584 INFO  L471      AbstractCegarLoop]: Abstraction has 9793 states and 16260 transitions.
[2025-02-05 21:55:29,585 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105)
[2025-02-05 21:55:29,585 INFO  L276                IsEmpty]: Start isEmpty. Operand 9793 states and 16260 transitions.
[2025-02-05 21:55:29,601 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 677
[2025-02-05 21:55:29,601 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:55:29,602 INFO  L218           NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:55:29,602 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 21:55:29,602 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:55:29,603 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:55:29,603 INFO  L85        PathProgramCache]: Analyzing trace with hash 2121130160, now seen corresponding path program 1 times
[2025-02-05 21:55:29,603 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:55:29,603 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628572196]
[2025-02-05 21:55:29,604 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:55:29,604 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:55:29,641 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 676 statements into 1 equivalence classes.
[2025-02-05 21:55:29,668 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 676 of 676 statements.
[2025-02-05 21:55:29,668 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:55:29,668 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:55:29,813 INFO  L134       CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked.
[2025-02-05 21:55:29,813 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:55:29,813 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628572196]
[2025-02-05 21:55:29,813 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628572196] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:55:29,813 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:55:29,813 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 21:55:29,813 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847625453]
[2025-02-05 21:55:29,814 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:55:29,814 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 21:55:29,814 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:55:29,815 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 21:55:29,815 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 21:55:29,816 INFO  L87              Difference]: Start difference. First operand 9793 states and 16260 transitions. Second operand  has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105)
[2025-02-05 21:55:30,361 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:55:30,361 INFO  L93              Difference]: Finished difference Result 27645 states and 45686 transitions.
[2025-02-05 21:55:30,362 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 21:55:30,362 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 676
[2025-02-05 21:55:30,363 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:55:30,454 INFO  L225             Difference]: With dead ends: 27645
[2025-02-05 21:55:30,454 INFO  L226             Difference]: Without dead ends: 17855
[2025-02-05 21:55:30,495 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-02-05 21:55:30,496 INFO  L435           NwaCegarLoop]: 572 mSDtfsCounter, 474 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 21:55:30,497 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 1134 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 21:55:30,512 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 17855 states.
[2025-02-05 21:55:31,405 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 17855 to 10385.
[2025-02-05 21:55:31,418 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10385 states, 7360 states have (on average 1.5331521739130434) internal successors, (11284), 7420 states have internal predecessors, (11284), 2960 states have call successors, (2960), 64 states have call predecessors, (2960), 64 states have return successors, (2960), 2900 states have call predecessors, (2960), 2960 states have call successors, (2960)
[2025-02-05 21:55:31,446 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10385 states to 10385 states and 17204 transitions.
[2025-02-05 21:55:31,460 INFO  L78                 Accepts]: Start accepts. Automaton has 10385 states and 17204 transitions. Word has length 676
[2025-02-05 21:55:31,461 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:55:31,461 INFO  L471      AbstractCegarLoop]: Abstraction has 10385 states and 17204 transitions.
[2025-02-05 21:55:31,461 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105)
[2025-02-05 21:55:31,461 INFO  L276                IsEmpty]: Start isEmpty. Operand 10385 states and 17204 transitions.
[2025-02-05 21:55:31,470 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 677
[2025-02-05 21:55:31,471 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:55:31,471 INFO  L218           NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:55:31,471 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 21:55:31,471 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:55:31,472 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:55:31,472 INFO  L85        PathProgramCache]: Analyzing trace with hash 1276658289, now seen corresponding path program 1 times
[2025-02-05 21:55:31,472 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:55:31,472 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323296155]
[2025-02-05 21:55:31,472 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:55:31,472 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:55:31,499 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 676 statements into 1 equivalence classes.
[2025-02-05 21:55:31,519 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 676 of 676 statements.
[2025-02-05 21:55:31,519 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:55:31,519 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:55:31,623 INFO  L134       CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked.
[2025-02-05 21:55:31,624 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:55:31,624 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323296155]
[2025-02-05 21:55:31,624 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323296155] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:55:31,624 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:55:31,624 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 21:55:31,624 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383859354]
[2025-02-05 21:55:31,624 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:55:31,624 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 21:55:31,624 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:55:31,625 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 21:55:31,625 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 21:55:31,625 INFO  L87              Difference]: Start difference. First operand 10385 states and 17204 transitions. Second operand  has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105)
[2025-02-05 21:55:32,389 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:55:32,389 INFO  L93              Difference]: Finished difference Result 28209 states and 46608 transitions.
[2025-02-05 21:55:32,390 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 21:55:32,390 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 676
[2025-02-05 21:55:32,391 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:55:32,472 INFO  L225             Difference]: With dead ends: 28209
[2025-02-05 21:55:32,472 INFO  L226             Difference]: Without dead ends: 17827
[2025-02-05 21:55:32,506 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-02-05 21:55:32,507 INFO  L435           NwaCegarLoop]: 845 mSDtfsCounter, 350 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 21:55:32,507 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1407 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 21:55:32,522 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 17827 states.
[2025-02-05 21:55:33,656 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 17827 to 17793.
[2025-02-05 21:55:33,676 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 17793 states, 12976 states have (on average 1.5331381011097411) internal successors, (19894), 13100 states have internal predecessors, (19894), 4688 states have call successors, (4688), 128 states have call predecessors, (4688), 128 states have return successors, (4688), 4564 states have call predecessors, (4688), 4688 states have call successors, (4688)
[2025-02-05 21:55:33,723 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17793 states to 17793 states and 29270 transitions.
[2025-02-05 21:55:33,740 INFO  L78                 Accepts]: Start accepts. Automaton has 17793 states and 29270 transitions. Word has length 676
[2025-02-05 21:55:33,741 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:55:33,741 INFO  L471      AbstractCegarLoop]: Abstraction has 17793 states and 29270 transitions.
[2025-02-05 21:55:33,741 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105)
[2025-02-05 21:55:33,741 INFO  L276                IsEmpty]: Start isEmpty. Operand 17793 states and 29270 transitions.
[2025-02-05 21:55:33,757 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 677
[2025-02-05 21:55:33,757 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:55:33,757 INFO  L218           NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:55:33,757 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 21:55:33,758 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:55:33,758 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:55:33,759 INFO  L85        PathProgramCache]: Analyzing trace with hash -1664999310, now seen corresponding path program 1 times
[2025-02-05 21:55:33,759 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:55:33,759 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888310952]
[2025-02-05 21:55:33,759 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:55:33,759 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:55:33,784 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 676 statements into 1 equivalence classes.
[2025-02-05 21:55:33,807 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 676 of 676 statements.
[2025-02-05 21:55:33,807 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:55:33,807 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:55:34,006 INFO  L134       CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked.
[2025-02-05 21:55:34,006 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:55:34,006 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888310952]
[2025-02-05 21:55:34,006 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888310952] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:55:34,006 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:55:34,007 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 21:55:34,007 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409699279]
[2025-02-05 21:55:34,007 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:55:34,007 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 21:55:34,007 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:55:34,008 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 21:55:34,008 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 21:55:34,008 INFO  L87              Difference]: Start difference. First operand 17793 states and 29270 transitions. Second operand  has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105)
[2025-02-05 21:55:34,515 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:55:34,515 INFO  L93              Difference]: Finished difference Result 35617 states and 58570 transitions.
[2025-02-05 21:55:34,515 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 21:55:34,516 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 676
[2025-02-05 21:55:34,517 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:55:34,724 INFO  L225             Difference]: With dead ends: 35617
[2025-02-05 21:55:34,724 INFO  L226             Difference]: Without dead ends: 17827
[2025-02-05 21:55:34,748 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 21:55:34,749 INFO  L435           NwaCegarLoop]: 646 mSDtfsCounter, 322 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 21:55:34,750 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1841 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 21:55:34,759 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 17827 states.
[2025-02-05 21:55:35,441 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 17827 to 17761.
[2025-02-05 21:55:35,476 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 17761 states, 12944 states have (on average 1.5319839307787393) internal successors, (19830), 13068 states have internal predecessors, (19830), 4688 states have call successors, (4688), 128 states have call predecessors, (4688), 128 states have return successors, (4688), 4564 states have call predecessors, (4688), 4688 states have call successors, (4688)
[2025-02-05 21:55:35,518 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17761 states to 17761 states and 29206 transitions.
[2025-02-05 21:55:35,536 INFO  L78                 Accepts]: Start accepts. Automaton has 17761 states and 29206 transitions. Word has length 676
[2025-02-05 21:55:35,537 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:55:35,537 INFO  L471      AbstractCegarLoop]: Abstraction has 17761 states and 29206 transitions.
[2025-02-05 21:55:35,537 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105)
[2025-02-05 21:55:35,538 INFO  L276                IsEmpty]: Start isEmpty. Operand 17761 states and 29206 transitions.
[2025-02-05 21:55:35,553 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 678
[2025-02-05 21:55:35,553 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:55:35,553 INFO  L218           NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:55:35,553 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 21:55:35,554 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:55:35,554 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:55:35,554 INFO  L85        PathProgramCache]: Analyzing trace with hash 327658191, now seen corresponding path program 1 times
[2025-02-05 21:55:35,554 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:55:35,554 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407261752]
[2025-02-05 21:55:35,554 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:55:35,554 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:55:35,602 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes.
[2025-02-05 21:55:35,634 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 677 of 677 statements.
[2025-02-05 21:55:35,635 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:55:35,635 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:55:35,992 INFO  L134       CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked.
[2025-02-05 21:55:35,992 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:55:35,993 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407261752]
[2025-02-05 21:55:35,993 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407261752] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:55:35,993 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:55:35,993 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 21:55:35,993 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199911250]
[2025-02-05 21:55:35,993 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:55:35,994 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 21:55:35,994 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:55:35,994 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 21:55:35,994 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 21:55:35,994 INFO  L87              Difference]: Start difference. First operand 17761 states and 29206 transitions. Second operand  has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105)
[2025-02-05 21:55:36,772 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:55:36,773 INFO  L93              Difference]: Finished difference Result 45278 states and 74936 transitions.
[2025-02-05 21:55:36,773 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 21:55:36,773 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 677
[2025-02-05 21:55:36,774 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:55:36,861 INFO  L225             Difference]: With dead ends: 45278
[2025-02-05 21:55:36,861 INFO  L226             Difference]: Without dead ends: 27520
[2025-02-05 21:55:36,904 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 21:55:36,905 INFO  L435           NwaCegarLoop]: 568 mSDtfsCounter, 580 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-05 21:55:36,905 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 1692 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-05 21:55:36,921 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 27520 states.
[2025-02-05 21:55:38,283 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 27520 to 24958.
[2025-02-05 21:55:38,313 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 24958 states, 20033 states have (on average 1.5998602306194778) internal successors, (32050), 20157 states have internal predecessors, (32050), 4793 states have call successors, (4793), 131 states have call predecessors, (4793), 131 states have return successors, (4793), 4669 states have call predecessors, (4793), 4793 states have call successors, (4793)
[2025-02-05 21:55:38,387 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24958 states to 24958 states and 41636 transitions.
[2025-02-05 21:55:38,411 INFO  L78                 Accepts]: Start accepts. Automaton has 24958 states and 41636 transitions. Word has length 677
[2025-02-05 21:55:38,412 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:55:38,412 INFO  L471      AbstractCegarLoop]: Abstraction has 24958 states and 41636 transitions.
[2025-02-05 21:55:38,412 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105)
[2025-02-05 21:55:38,412 INFO  L276                IsEmpty]: Start isEmpty. Operand 24958 states and 41636 transitions.
[2025-02-05 21:55:38,431 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 679
[2025-02-05 21:55:38,431 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:55:38,431 INFO  L218           NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:55:38,432 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 21:55:38,432 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:55:38,432 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:55:38,432 INFO  L85        PathProgramCache]: Analyzing trace with hash -630943180, now seen corresponding path program 1 times
[2025-02-05 21:55:38,433 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:55:38,433 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791736525]
[2025-02-05 21:55:38,433 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:55:38,433 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:55:38,465 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 678 statements into 1 equivalence classes.
[2025-02-05 21:55:38,651 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 678 of 678 statements.
[2025-02-05 21:55:38,651 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:55:38,651 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:55:38,928 INFO  L134       CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked.
[2025-02-05 21:55:38,929 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:55:38,929 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791736525]
[2025-02-05 21:55:38,929 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791736525] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:55:38,929 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:55:38,929 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-05 21:55:38,929 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707688345]
[2025-02-05 21:55:38,929 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:55:38,930 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 21:55:38,930 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:55:38,931 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 21:55:38,931 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-02-05 21:55:38,931 INFO  L87              Difference]: Start difference. First operand 24958 states and 41636 transitions. Second operand  has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105)
[2025-02-05 21:55:43,517 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:55:43,517 INFO  L93              Difference]: Finished difference Result 121924 states and 200238 transitions.
[2025-02-05 21:55:43,518 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-02-05 21:55:43,518 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 678
[2025-02-05 21:55:43,518 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:55:43,811 INFO  L225             Difference]: With dead ends: 121924
[2025-02-05 21:55:43,811 INFO  L226             Difference]: Without dead ends: 102942
[2025-02-05 21:55:43,874 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156
[2025-02-05 21:55:43,875 INFO  L435           NwaCegarLoop]: 1199 mSDtfsCounter, 2413 mSDsluCounter, 3901 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2413 SdHoareTripleChecker+Valid, 5100 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-02-05 21:55:43,875 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2413 Valid, 5100 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-02-05 21:55:43,938 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 102942 states.
[2025-02-05 21:55:47,895 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 102942 to 85984.
[2025-02-05 21:55:47,973 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 85984 states, 67409 states have (on average 1.5668234212048837) internal successors, (105618), 67913 states have internal predecessors, (105618), 17801 states have call successors, (17801), 773 states have call predecessors, (17801), 773 states have return successors, (17801), 17297 states have call predecessors, (17801), 17801 states have call successors, (17801)
[2025-02-05 21:55:48,215 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 85984 states to 85984 states and 141220 transitions.
[2025-02-05 21:55:48,298 INFO  L78                 Accepts]: Start accepts. Automaton has 85984 states and 141220 transitions. Word has length 678
[2025-02-05 21:55:48,299 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:55:48,299 INFO  L471      AbstractCegarLoop]: Abstraction has 85984 states and 141220 transitions.
[2025-02-05 21:55:48,299 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105)
[2025-02-05 21:55:48,299 INFO  L276                IsEmpty]: Start isEmpty. Operand 85984 states and 141220 transitions.
[2025-02-05 21:55:48,327 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 679
[2025-02-05 21:55:48,327 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:55:48,328 INFO  L218           NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 21:55:48,328 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-05 21:55:48,328 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:55:48,329 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:55:48,329 INFO  L85        PathProgramCache]: Analyzing trace with hash -1079533436, now seen corresponding path program 1 times
[2025-02-05 21:55:48,329 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:55:48,329 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303552690]
[2025-02-05 21:55:48,329 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:55:48,329 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:55:48,364 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 678 statements into 1 equivalence classes.
[2025-02-05 21:55:48,404 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 678 of 678 statements.
[2025-02-05 21:55:48,404 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:55:48,404 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:55:48,730 INFO  L134       CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked.
[2025-02-05 21:55:48,730 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:55:48,731 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303552690]
[2025-02-05 21:55:48,731 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303552690] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:55:48,731 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:55:48,731 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 21:55:48,731 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852300377]
[2025-02-05 21:55:48,731 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:55:48,733 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 21:55:48,733 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:55:48,734 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 21:55:48,734 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 21:55:48,734 INFO  L87              Difference]: Start difference. First operand 85984 states and 141220 transitions. Second operand  has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105)