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


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


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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 98bf3444bfc42ab115e7d067c3886787abe4ff198c81ac1a9dcc062a708c7968
[2025-03-08 11:17:12,254 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 11:17:12,262 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 11:17:12,266 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 11:17:12,267 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 11:17:12,267 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 11:17:12,268 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-18.i
[2025-03-08 11:17:13,386 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c37938e0a/20294307c4374d04941909dc8ff1685a/FLAGd31f59b22
[2025-03-08 11:17:13,695 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 11:17:13,695 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-18.i
[2025-03-08 11:17:13,713 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c37938e0a/20294307c4374d04941909dc8ff1685a/FLAGd31f59b22
[2025-03-08 11:17:13,730 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c37938e0a/20294307c4374d04941909dc8ff1685a
[2025-03-08 11:17:13,732 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 11:17:13,734 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 11:17:13,735 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 11:17:13,735 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 11:17:13,738 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 11:17:13,739 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:17:13" (1/1) ...
[2025-03-08 11:17:13,740 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6812484a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:13, skipping insertion in model container
[2025-03-08 11:17:13,742 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:17:13" (1/1) ...
[2025-03-08 11:17:13,775 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 11:17:13,879 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-18.i[916,929]
[2025-03-08 11:17:13,988 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 11:17:13,998 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 11:17:14,009 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-18.i[916,929]
[2025-03-08 11:17:14,073 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 11:17:14,089 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 11:17:14,090 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:14 WrapperNode
[2025-03-08 11:17:14,090 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 11:17:14,091 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 11:17:14,091 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 11:17:14,091 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 11:17:14,094 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:14" (1/1) ...
[2025-03-08 11:17:14,117 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:14" (1/1) ...
[2025-03-08 11:17:14,192 INFO  L138                Inliner]: procedures = 26, calls = 104, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 861
[2025-03-08 11:17:14,192 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 11:17:14,193 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 11:17:14,193 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 11:17:14,193 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 11:17:14,199 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:14" (1/1) ...
[2025-03-08 11:17:14,200 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:14" (1/1) ...
[2025-03-08 11:17:14,213 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:14" (1/1) ...
[2025-03-08 11:17:14,247 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-08 11:17:14,247 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:14" (1/1) ...
[2025-03-08 11:17:14,247 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:14" (1/1) ...
[2025-03-08 11:17:14,273 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:14" (1/1) ...
[2025-03-08 11:17:14,280 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:14" (1/1) ...
[2025-03-08 11:17:14,291 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:14" (1/1) ...
[2025-03-08 11:17:14,296 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:14" (1/1) ...
[2025-03-08 11:17:14,306 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 11:17:14,307 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 11:17:14,307 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 11:17:14,307 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 11:17:14,309 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:14" (1/1) ...
[2025-03-08 11:17:14,312 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 11:17:14,322 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 11:17:14,334 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 11:17:14,338 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 11:17:14,353 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 11:17:14,354 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 11:17:14,354 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 11:17:14,354 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 11:17:14,354 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 11:17:14,354 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 11:17:14,459 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 11:17:14,461 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 11:17:15,516 INFO  L?                        ?]: Removed 29 outVars from TransFormulas that were not future-live.
[2025-03-08 11:17:15,517 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 11:17:15,553 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 11:17:15,553 INFO  L336             CfgBuilder]: Removed 1 assume(true) statements.
[2025-03-08 11:17:15,553 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:17:15 BoogieIcfgContainer
[2025-03-08 11:17:15,553 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 11:17:15,557 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 11:17:15,558 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 11:17:15,561 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 11:17:15,561 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:17:13" (1/3) ...
[2025-03-08 11:17:15,562 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6736a1d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:17:15, skipping insertion in model container
[2025-03-08 11:17:15,562 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:17:14" (2/3) ...
[2025-03-08 11:17:15,563 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6736a1d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:17:15, skipping insertion in model container
[2025-03-08 11:17:15,563 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:17:15" (3/3) ...
[2025-03-08 11:17:15,564 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-18.i
[2025-03-08 11:17:15,574 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 11:17:15,578 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-18.i that has 2 procedures, 345 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 11:17:15,642 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 11:17:15,650 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;@34cd4b02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 11:17:15,651 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 11:17:15,655 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 345 states, 251 states have (on average 1.593625498007968) internal successors, (400), 252 states have internal predecessors, (400), 91 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91)
[2025-03-08 11:17:15,672 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 609
[2025-03-08 11:17:15,673 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:17:15,673 INFO  L218           NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:17:15,674 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:17:15,677 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:17:15,678 INFO  L85        PathProgramCache]: Analyzing trace with hash -355632439, now seen corresponding path program 1 times
[2025-03-08 11:17:15,682 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:17:15,683 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125572524]
[2025-03-08 11:17:15,683 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:17:15,683 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:17:15,776 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes.
[2025-03-08 11:17:15,960 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements.
[2025-03-08 11:17:15,964 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:17:15,964 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:17:16,437 INFO  L134       CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked.
[2025-03-08 11:17:16,438 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:17:16,438 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125572524]
[2025-03-08 11:17:16,438 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125572524] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:17:16,438 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:17:16,439 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 11:17:16,440 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495782497]
[2025-03-08 11:17:16,441 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:17:16,445 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 11:17:16,446 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:17:16,462 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 11:17:16,463 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:17:16,466 INFO  L87              Difference]: Start difference. First operand  has 345 states, 251 states have (on average 1.593625498007968) internal successors, (400), 252 states have internal predecessors, (400), 91 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) Second operand  has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91)
[2025-03-08 11:17:16,684 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:17:16,684 INFO  L93              Difference]: Finished difference Result 1018 states and 1908 transitions.
[2025-03-08 11:17:16,687 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 11:17:16,688 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 608
[2025-03-08 11:17:16,689 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:17:16,700 INFO  L225             Difference]: With dead ends: 1018
[2025-03-08 11:17:16,700 INFO  L226             Difference]: Without dead ends: 676
[2025-03-08 11:17:16,704 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:17:16,706 INFO  L435           NwaCegarLoop]: 549 mSDtfsCounter, 557 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 11:17:16,707 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 1080 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 11:17:16,719 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 676 states.
[2025-03-08 11:17:16,816 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 674.
[2025-03-08 11:17:16,819 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 674 states, 489 states have (on average 1.5705521472392638) internal successors, (768), 489 states have internal predecessors, (768), 182 states have call successors, (182), 2 states have call predecessors, (182), 2 states have return successors, (182), 182 states have call predecessors, (182), 182 states have call successors, (182)
[2025-03-08 11:17:16,830 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1132 transitions.
[2025-03-08 11:17:16,835 INFO  L78                 Accepts]: Start accepts. Automaton has 674 states and 1132 transitions. Word has length 608
[2025-03-08 11:17:16,837 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:17:16,837 INFO  L471      AbstractCegarLoop]: Abstraction has 674 states and 1132 transitions.
[2025-03-08 11:17:16,837 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91)
[2025-03-08 11:17:16,837 INFO  L276                IsEmpty]: Start isEmpty. Operand 674 states and 1132 transitions.
[2025-03-08 11:17:16,849 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 610
[2025-03-08 11:17:16,849 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:17:16,850 INFO  L218           NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:17:16,850 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-08 11:17:16,850 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:17:16,851 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:17:16,852 INFO  L85        PathProgramCache]: Analyzing trace with hash 140682683, now seen corresponding path program 1 times
[2025-03-08 11:17:16,852 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:17:16,852 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81589799]
[2025-03-08 11:17:16,852 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:17:16,853 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:17:16,901 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes.
[2025-03-08 11:17:16,965 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 609 of 609 statements.
[2025-03-08 11:17:16,965 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:17:16,965 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:17:17,331 INFO  L134       CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked.
[2025-03-08 11:17:17,333 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:17:17,333 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81589799]
[2025-03-08 11:17:17,333 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81589799] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:17:17,333 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:17:17,334 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 11:17:17,334 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055168925]
[2025-03-08 11:17:17,334 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:17:17,336 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 11:17:17,337 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:17:17,338 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 11:17:17,338 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:17:17,338 INFO  L87              Difference]: Start difference. First operand 674 states and 1132 transitions. Second operand  has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91)
[2025-03-08 11:17:17,487 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:17:17,487 INFO  L93              Difference]: Finished difference Result 1704 states and 2855 transitions.
[2025-03-08 11:17:17,488 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 11:17:17,489 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 609
[2025-03-08 11:17:17,490 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:17:17,497 INFO  L225             Difference]: With dead ends: 1704
[2025-03-08 11:17:17,500 INFO  L226             Difference]: Without dead ends: 1033
[2025-03-08 11:17:17,502 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:17:17,503 INFO  L435           NwaCegarLoop]: 675 mSDtfsCounter, 289 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 11:17:17,503 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1208 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 11:17:17,504 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1033 states.
[2025-03-08 11:17:17,610 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1029.
[2025-03-08 11:17:17,628 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1029 states, 748 states have (on average 1.5601604278074865) internal successors, (1167), 750 states have internal predecessors, (1167), 276 states have call successors, (276), 4 states have call predecessors, (276), 4 states have return successors, (276), 274 states have call predecessors, (276), 276 states have call successors, (276)
[2025-03-08 11:17:17,635 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1719 transitions.
[2025-03-08 11:17:17,636 INFO  L78                 Accepts]: Start accepts. Automaton has 1029 states and 1719 transitions. Word has length 609
[2025-03-08 11:17:17,638 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:17:17,640 INFO  L471      AbstractCegarLoop]: Abstraction has 1029 states and 1719 transitions.
[2025-03-08 11:17:17,640 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91)
[2025-03-08 11:17:17,640 INFO  L276                IsEmpty]: Start isEmpty. Operand 1029 states and 1719 transitions.
[2025-03-08 11:17:17,645 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 610
[2025-03-08 11:17:17,646 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:17:17,647 INFO  L218           NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:17:17,647 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 11:17:17,647 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:17:17,647 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:17:17,647 INFO  L85        PathProgramCache]: Analyzing trace with hash 589379322, now seen corresponding path program 1 times
[2025-03-08 11:17:17,650 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:17:17,650 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566345551]
[2025-03-08 11:17:17,650 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:17:17,651 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:17:17,693 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes.
[2025-03-08 11:17:17,745 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 609 of 609 statements.
[2025-03-08 11:17:17,745 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:17:17,745 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:17:17,997 INFO  L134       CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked.
[2025-03-08 11:17:17,997 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:17:17,997 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566345551]
[2025-03-08 11:17:17,998 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566345551] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:17:17,998 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:17:17,998 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 11:17:17,998 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365211973]
[2025-03-08 11:17:17,998 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:17:17,999 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 11:17:17,999 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:17:17,999 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 11:17:17,999 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 11:17:18,000 INFO  L87              Difference]: Start difference. First operand 1029 states and 1719 transitions. Second operand  has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91)
[2025-03-08 11:17:18,244 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:17:18,245 INFO  L93              Difference]: Finished difference Result 2868 states and 4789 transitions.
[2025-03-08 11:17:18,245 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 11:17:18,246 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 609
[2025-03-08 11:17:18,247 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:17:18,257 INFO  L225             Difference]: With dead ends: 2868
[2025-03-08 11:17:18,257 INFO  L226             Difference]: Without dead ends: 1842
[2025-03-08 11:17:18,260 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 11:17:18,261 INFO  L435           NwaCegarLoop]: 638 mSDtfsCounter, 512 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 11:17:18,261 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 1657 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 11:17:18,263 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1842 states.
[2025-03-08 11:17:18,361 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1706.
[2025-03-08 11:17:18,365 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1706 states, 1353 states have (on average 1.6045824094604582) internal successors, (2171), 1359 states have internal predecessors, (2171), 344 states have call successors, (344), 8 states have call predecessors, (344), 8 states have return successors, (344), 338 states have call predecessors, (344), 344 states have call successors, (344)
[2025-03-08 11:17:18,375 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2859 transitions.
[2025-03-08 11:17:18,377 INFO  L78                 Accepts]: Start accepts. Automaton has 1706 states and 2859 transitions. Word has length 609
[2025-03-08 11:17:18,378 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:17:18,378 INFO  L471      AbstractCegarLoop]: Abstraction has 1706 states and 2859 transitions.
[2025-03-08 11:17:18,379 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91)
[2025-03-08 11:17:18,379 INFO  L276                IsEmpty]: Start isEmpty. Operand 1706 states and 2859 transitions.
[2025-03-08 11:17:18,387 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 610
[2025-03-08 11:17:18,387 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:17:18,387 INFO  L218           NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:17:18,388 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 11:17:18,388 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:17:18,388 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:17:18,388 INFO  L85        PathProgramCache]: Analyzing trace with hash -651660035, now seen corresponding path program 1 times
[2025-03-08 11:17:18,388 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:17:18,388 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898696832]
[2025-03-08 11:17:18,388 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:17:18,389 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:17:18,439 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes.
[2025-03-08 11:17:18,478 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 609 of 609 statements.
[2025-03-08 11:17:18,478 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:17:18,478 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:17:18,621 INFO  L134       CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked.
[2025-03-08 11:17:18,622 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:17:18,622 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898696832]
[2025-03-08 11:17:18,623 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898696832] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:17:18,623 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:17:18,623 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 11:17:18,623 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69430761]
[2025-03-08 11:17:18,623 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:17:18,624 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 11:17:18,624 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:17:18,625 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 11:17:18,625 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:17:18,625 INFO  L87              Difference]: Start difference. First operand 1706 states and 2859 transitions. Second operand  has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91)
[2025-03-08 11:17:18,811 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:17:18,812 INFO  L93              Difference]: Finished difference Result 4818 states and 8047 transitions.
[2025-03-08 11:17:18,812 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 11:17:18,812 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 609
[2025-03-08 11:17:18,813 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:17:18,830 INFO  L225             Difference]: With dead ends: 4818
[2025-03-08 11:17:18,830 INFO  L226             Difference]: Without dead ends: 3115
[2025-03-08 11:17:18,835 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:17:18,836 INFO  L435           NwaCegarLoop]: 700 mSDtfsCounter, 548 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 11:17:18,838 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1244 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 11:17:18,841 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3115 states.
[2025-03-08 11:17:19,017 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3115 to 3113.
[2025-03-08 11:17:19,022 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3113 states, 2408 states have (on average 1.5780730897009967) internal successors, (3800), 2420 states have internal predecessors, (3800), 688 states have call successors, (688), 16 states have call predecessors, (688), 16 states have return successors, (688), 676 states have call predecessors, (688), 688 states have call successors, (688)
[2025-03-08 11:17:19,034 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3113 states to 3113 states and 5176 transitions.
[2025-03-08 11:17:19,036 INFO  L78                 Accepts]: Start accepts. Automaton has 3113 states and 5176 transitions. Word has length 609
[2025-03-08 11:17:19,037 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:17:19,037 INFO  L471      AbstractCegarLoop]: Abstraction has 3113 states and 5176 transitions.
[2025-03-08 11:17:19,037 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91)
[2025-03-08 11:17:19,037 INFO  L276                IsEmpty]: Start isEmpty. Operand 3113 states and 5176 transitions.
[2025-03-08 11:17:19,042 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 610
[2025-03-08 11:17:19,042 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:17:19,043 INFO  L218           NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:17:19,043 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 11:17:19,043 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:17:19,043 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:17:19,044 INFO  L85        PathProgramCache]: Analyzing trace with hash 701649662, now seen corresponding path program 1 times
[2025-03-08 11:17:19,044 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:17:19,044 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138273078]
[2025-03-08 11:17:19,044 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:17:19,044 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:17:19,075 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes.
[2025-03-08 11:17:19,126 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 609 of 609 statements.
[2025-03-08 11:17:19,126 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:17:19,126 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:17:19,347 INFO  L134       CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked.
[2025-03-08 11:17:19,348 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:17:19,348 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138273078]
[2025-03-08 11:17:19,348 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138273078] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:17:19,348 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:17:19,348 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 11:17:19,348 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244078745]
[2025-03-08 11:17:19,348 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:17:19,349 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 11:17:19,349 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:17:19,350 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 11:17:19,350 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:17:19,350 INFO  L87              Difference]: Start difference. First operand 3113 states and 5176 transitions. Second operand  has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91)
[2025-03-08 11:17:19,575 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:17:19,575 INFO  L93              Difference]: Finished difference Result 8675 states and 14434 transitions.
[2025-03-08 11:17:19,576 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 11:17:19,576 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 609
[2025-03-08 11:17:19,577 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:17:19,605 INFO  L225             Difference]: With dead ends: 8675
[2025-03-08 11:17:19,606 INFO  L226             Difference]: Without dead ends: 5565
[2025-03-08 11:17:19,615 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:17:19,615 INFO  L435           NwaCegarLoop]: 806 mSDtfsCounter, 381 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 11:17:19,615 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1329 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 11:17:19,619 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5565 states.
[2025-03-08 11:17:19,912 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5565 to 5555.
[2025-03-08 11:17:19,921 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5555 states, 4498 states have (on average 1.5980435749221877) internal successors, (7188), 4526 states have internal predecessors, (7188), 1024 states have call successors, (1024), 32 states have call predecessors, (1024), 32 states have return successors, (1024), 996 states have call predecessors, (1024), 1024 states have call successors, (1024)
[2025-03-08 11:17:19,940 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5555 states to 5555 states and 9236 transitions.
[2025-03-08 11:17:19,944 INFO  L78                 Accepts]: Start accepts. Automaton has 5555 states and 9236 transitions. Word has length 609
[2025-03-08 11:17:19,945 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:17:19,945 INFO  L471      AbstractCegarLoop]: Abstraction has 5555 states and 9236 transitions.
[2025-03-08 11:17:19,945 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91)
[2025-03-08 11:17:19,946 INFO  L276                IsEmpty]: Start isEmpty. Operand 5555 states and 9236 transitions.
[2025-03-08 11:17:19,954 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 610
[2025-03-08 11:17:19,954 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:17:19,954 INFO  L218           NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:17:19,955 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 11:17:19,955 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:17:19,955 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:17:19,955 INFO  L85        PathProgramCache]: Analyzing trace with hash 687399517, now seen corresponding path program 1 times
[2025-03-08 11:17:19,955 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:17:19,956 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137552418]
[2025-03-08 11:17:19,956 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:17:19,956 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:17:19,986 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes.
[2025-03-08 11:17:20,014 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 609 of 609 statements.
[2025-03-08 11:17:20,014 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:17:20,015 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:17:20,222 INFO  L134       CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked.
[2025-03-08 11:17:20,222 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:17:20,223 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137552418]
[2025-03-08 11:17:20,223 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137552418] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:17:20,223 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:17:20,223 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 11:17:20,223 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148181157]
[2025-03-08 11:17:20,223 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:17:20,224 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 11:17:20,224 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:17:20,224 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 11:17:20,224 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:17:20,225 INFO  L87              Difference]: Start difference. First operand 5555 states and 9236 transitions. Second operand  has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91)
[2025-03-08 11:17:20,602 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:17:20,603 INFO  L93              Difference]: Finished difference Result 16587 states and 27590 transitions.
[2025-03-08 11:17:20,603 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 11:17:20,604 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 609
[2025-03-08 11:17:20,604 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:17:20,654 INFO  L225             Difference]: With dead ends: 16587
[2025-03-08 11:17:20,654 INFO  L226             Difference]: Without dead ends: 11035
[2025-03-08 11:17:20,668 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:17:20,669 INFO  L435           NwaCegarLoop]: 758 mSDtfsCounter, 389 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 11:17:20,669 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1304 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 11:17:20,677 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11035 states.
[2025-03-08 11:17:21,139 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11035 to 11033.
[2025-03-08 11:17:21,157 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11033 states, 8920 states have (on average 1.5973094170403588) internal successors, (14248), 8976 states have internal predecessors, (14248), 2048 states have call successors, (2048), 64 states have call predecessors, (2048), 64 states have return successors, (2048), 1992 states have call predecessors, (2048), 2048 states have call successors, (2048)
[2025-03-08 11:17:21,203 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11033 states to 11033 states and 18344 transitions.
[2025-03-08 11:17:21,211 INFO  L78                 Accepts]: Start accepts. Automaton has 11033 states and 18344 transitions. Word has length 609
[2025-03-08 11:17:21,212 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:17:21,212 INFO  L471      AbstractCegarLoop]: Abstraction has 11033 states and 18344 transitions.
[2025-03-08 11:17:21,212 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91)
[2025-03-08 11:17:21,213 INFO  L276                IsEmpty]: Start isEmpty. Operand 11033 states and 18344 transitions.
[2025-03-08 11:17:21,227 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 611
[2025-03-08 11:17:21,227 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:17:21,228 INFO  L218           NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:17:21,228 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 11:17:21,228 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:17:21,228 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:17:21,229 INFO  L85        PathProgramCache]: Analyzing trace with hash -452751681, now seen corresponding path program 1 times
[2025-03-08 11:17:21,229 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:17:21,229 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318691449]
[2025-03-08 11:17:21,229 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:17:21,229 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:17:21,268 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 610 statements into 1 equivalence classes.
[2025-03-08 11:17:21,318 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 610 of 610 statements.
[2025-03-08 11:17:21,318 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:17:21,318 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:17:21,573 INFO  L134       CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked.
[2025-03-08 11:17:21,573 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:17:21,573 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318691449]
[2025-03-08 11:17:21,574 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318691449] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:17:21,574 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:17:21,574 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 11:17:21,574 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110627143]
[2025-03-08 11:17:21,574 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:17:21,575 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 11:17:21,575 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:17:21,575 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 11:17:21,575 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:17:21,576 INFO  L87              Difference]: Start difference. First operand 11033 states and 18344 transitions. Second operand  has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91)
[2025-03-08 11:17:22,303 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:17:22,303 INFO  L93              Difference]: Finished difference Result 33045 states and 54978 transitions.
[2025-03-08 11:17:22,304 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 11:17:22,304 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 610
[2025-03-08 11:17:22,305 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:17:22,379 INFO  L225             Difference]: With dead ends: 33045
[2025-03-08 11:17:22,380 INFO  L226             Difference]: Without dead ends: 22015
[2025-03-08 11:17:22,413 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:17:22,414 INFO  L435           NwaCegarLoop]: 906 mSDtfsCounter, 525 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 11:17:22,414 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1445 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 11:17:22,433 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22015 states.
[2025-03-08 11:17:23,273 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22015 to 22013.
[2025-03-08 11:17:23,302 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22013 states, 17788 states have (on average 1.5923094220823026) internal successors, (28324), 17900 states have internal predecessors, (28324), 4096 states have call successors, (4096), 128 states have call predecessors, (4096), 128 states have return successors, (4096), 3984 states have call predecessors, (4096), 4096 states have call successors, (4096)
[2025-03-08 11:17:23,366 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22013 states to 22013 states and 36516 transitions.
[2025-03-08 11:17:23,377 INFO  L78                 Accepts]: Start accepts. Automaton has 22013 states and 36516 transitions. Word has length 610
[2025-03-08 11:17:23,378 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:17:23,378 INFO  L471      AbstractCegarLoop]: Abstraction has 22013 states and 36516 transitions.
[2025-03-08 11:17:23,378 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91)
[2025-03-08 11:17:23,378 INFO  L276                IsEmpty]: Start isEmpty. Operand 22013 states and 36516 transitions.
[2025-03-08 11:17:23,393 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 612
[2025-03-08 11:17:23,394 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:17:23,394 INFO  L218           NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:17:23,395 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 11:17:23,395 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:17:23,395 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:17:23,396 INFO  L85        PathProgramCache]: Analyzing trace with hash 407331619, now seen corresponding path program 1 times
[2025-03-08 11:17:23,396 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:17:23,396 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747505375]
[2025-03-08 11:17:23,396 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:17:23,396 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:17:23,424 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 611 statements into 1 equivalence classes.
[2025-03-08 11:17:23,462 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 611 of 611 statements.
[2025-03-08 11:17:23,463 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:17:23,463 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:17:23,998 INFO  L134       CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked.
[2025-03-08 11:17:24,001 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:17:24,001 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747505375]
[2025-03-08 11:17:24,001 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747505375] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:17:24,001 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:17:24,002 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 11:17:24,002 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695862495]
[2025-03-08 11:17:24,002 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:17:24,002 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 11:17:24,002 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:17:24,003 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 11:17:24,003 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 11:17:24,003 INFO  L87              Difference]: Start difference. First operand 22013 states and 36516 transitions. Second operand  has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91)
[2025-03-08 11:17:25,423 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:17:25,423 INFO  L93              Difference]: Finished difference Result 60187 states and 100031 transitions.
[2025-03-08 11:17:25,423 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 11:17:25,424 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 611
[2025-03-08 11:17:25,425 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:17:25,541 INFO  L225             Difference]: With dead ends: 60187
[2025-03-08 11:17:25,542 INFO  L226             Difference]: Without dead ends: 37137
[2025-03-08 11:17:25,589 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 11:17:25,589 INFO  L435           NwaCegarLoop]: 999 mSDtfsCounter, 696 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1772 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 11:17:25,590 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1772 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 11:17:25,620 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 37137 states.
[2025-03-08 11:17:26,587 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 37137 to 27869.
[2025-03-08 11:17:26,623 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 27869 states, 23644 states have (on average 1.6262899678565386) internal successors, (38452), 23756 states have internal predecessors, (38452), 4096 states have call successors, (4096), 128 states have call predecessors, (4096), 128 states have return successors, (4096), 3984 states have call predecessors, (4096), 4096 states have call successors, (4096)
[2025-03-08 11:17:26,681 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27869 states to 27869 states and 46644 transitions.
[2025-03-08 11:17:26,704 INFO  L78                 Accepts]: Start accepts. Automaton has 27869 states and 46644 transitions. Word has length 611
[2025-03-08 11:17:26,705 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:17:26,705 INFO  L471      AbstractCegarLoop]: Abstraction has 27869 states and 46644 transitions.
[2025-03-08 11:17:26,705 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91)
[2025-03-08 11:17:26,707 INFO  L276                IsEmpty]: Start isEmpty. Operand 27869 states and 46644 transitions.
[2025-03-08 11:17:26,732 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 612
[2025-03-08 11:17:26,732 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:17:26,732 INFO  L218           NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:17:26,733 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 11:17:26,733 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:17:26,733 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:17:26,733 INFO  L85        PathProgramCache]: Analyzing trace with hash -174770906, now seen corresponding path program 1 times
[2025-03-08 11:17:26,733 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:17:26,734 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642859250]
[2025-03-08 11:17:26,734 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:17:26,734 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:17:26,761 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 611 statements into 1 equivalence classes.
[2025-03-08 11:17:26,783 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 611 of 611 statements.
[2025-03-08 11:17:26,783 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:17:26,783 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:17:26,892 INFO  L134       CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked.
[2025-03-08 11:17:26,892 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:17:26,892 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642859250]
[2025-03-08 11:17:26,892 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642859250] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:17:26,892 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:17:26,893 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 11:17:26,893 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4977454]
[2025-03-08 11:17:26,893 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:17:26,894 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 11:17:26,894 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:17:26,894 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 11:17:26,894 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:17:26,895 INFO  L87              Difference]: Start difference. First operand 27869 states and 46644 transitions. Second operand  has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91)
[2025-03-08 11:17:27,493 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:17:27,493 INFO  L93              Difference]: Finished difference Result 56025 states and 93478 transitions.
[2025-03-08 11:17:27,494 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 11:17:27,494 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 611
[2025-03-08 11:17:27,495 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:17:27,571 INFO  L225             Difference]: With dead ends: 56025
[2025-03-08 11:17:27,572 INFO  L226             Difference]: Without dead ends: 28159
[2025-03-08 11:17:27,609 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:17:27,609 INFO  L435           NwaCegarLoop]: 838 mSDtfsCounter, 295 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 11:17:27,610 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1376 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 11:17:27,624 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 28159 states.
[2025-03-08 11:17:28,345 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 28159 to 23933.
[2025-03-08 11:17:28,375 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23933 states, 20796 states have (on average 1.641277168686286) internal successors, (34132), 20844 states have internal predecessors, (34132), 3008 states have call successors, (3008), 128 states have call predecessors, (3008), 128 states have return successors, (3008), 2960 states have call predecessors, (3008), 3008 states have call successors, (3008)
[2025-03-08 11:17:28,432 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23933 states to 23933 states and 40148 transitions.
[2025-03-08 11:17:28,454 INFO  L78                 Accepts]: Start accepts. Automaton has 23933 states and 40148 transitions. Word has length 611
[2025-03-08 11:17:28,455 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:17:28,455 INFO  L471      AbstractCegarLoop]: Abstraction has 23933 states and 40148 transitions.
[2025-03-08 11:17:28,455 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91)
[2025-03-08 11:17:28,455 INFO  L276                IsEmpty]: Start isEmpty. Operand 23933 states and 40148 transitions.
[2025-03-08 11:17:28,484 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 612
[2025-03-08 11:17:28,484 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:17:28,485 INFO  L218           NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:17:28,485 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-08 11:17:28,485 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:17:28,486 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:17:28,486 INFO  L85        PathProgramCache]: Analyzing trace with hash -241777659, now seen corresponding path program 1 times
[2025-03-08 11:17:28,486 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:17:28,486 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489983273]
[2025-03-08 11:17:28,486 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:17:28,486 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:17:28,525 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 611 statements into 1 equivalence classes.
[2025-03-08 11:17:28,569 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 611 of 611 statements.
[2025-03-08 11:17:28,569 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:17:28,569 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:17:28,896 INFO  L134       CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked.
[2025-03-08 11:17:28,897 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:17:28,897 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489983273]
[2025-03-08 11:17:28,897 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489983273] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:17:28,897 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:17:28,897 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 11:17:28,897 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496690602]
[2025-03-08 11:17:28,897 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:17:28,898 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 11:17:28,898 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:17:28,898 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 11:17:28,898 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:17:28,899 INFO  L87              Difference]: Start difference. First operand 23933 states and 40148 transitions. Second operand  has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91)
[2025-03-08 11:17:29,943 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:17:29,943 INFO  L93              Difference]: Finished difference Result 71793 states and 120438 transitions.
[2025-03-08 11:17:29,944 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 11:17:29,944 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 611
[2025-03-08 11:17:29,945 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:17:30,092 INFO  L225             Difference]: With dead ends: 71793
[2025-03-08 11:17:30,093 INFO  L226             Difference]: Without dead ends: 47863
[2025-03-08 11:17:30,156 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 11:17:30,157 INFO  L435           NwaCegarLoop]: 554 mSDtfsCounter, 345 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 11:17:30,158 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1102 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 11:17:30,195 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 47863 states.
[2025-03-08 11:17:31,616 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 47863 to 47861.
[2025-03-08 11:17:31,677 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 47861 states, 41588 states have (on average 1.6394152159276714) internal successors, (68180), 41684 states have internal predecessors, (68180), 6016 states have call successors, (6016), 256 states have call predecessors, (6016), 256 states have return successors, (6016), 5920 states have call predecessors, (6016), 6016 states have call successors, (6016)
[2025-03-08 11:17:31,772 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 47861 states to 47861 states and 80212 transitions.
[2025-03-08 11:17:31,801 INFO  L78                 Accepts]: Start accepts. Automaton has 47861 states and 80212 transitions. Word has length 611
[2025-03-08 11:17:31,802 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:17:31,802 INFO  L471      AbstractCegarLoop]: Abstraction has 47861 states and 80212 transitions.
[2025-03-08 11:17:31,802 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91)
[2025-03-08 11:17:31,802 INFO  L276                IsEmpty]: Start isEmpty. Operand 47861 states and 80212 transitions.
[2025-03-08 11:17:31,831 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 612
[2025-03-08 11:17:31,831 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:17:31,831 INFO  L218           NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:17:31,832 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-08 11:17:31,832 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:17:31,832 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:17:31,833 INFO  L85        PathProgramCache]: Analyzing trace with hash 602694212, now seen corresponding path program 1 times
[2025-03-08 11:17:31,833 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:17:31,833 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789242606]
[2025-03-08 11:17:31,833 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:17:31,833 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:17:31,862 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 611 statements into 1 equivalence classes.
[2025-03-08 11:17:31,904 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 611 of 611 statements.
[2025-03-08 11:17:31,904 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:17:31,904 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:17:32,469 INFO  L134       CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked.
[2025-03-08 11:17:32,469 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:17:32,469 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789242606]
[2025-03-08 11:17:32,469 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789242606] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:17:32,469 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:17:32,469 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 11:17:32,469 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895812900]
[2025-03-08 11:17:32,469 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:17:32,470 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 11:17:32,470 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:17:32,470 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 11:17:32,470 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-08 11:17:32,471 INFO  L87              Difference]: Start difference. First operand 47861 states and 80212 transitions. Second operand  has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91)
[2025-03-08 11:17:34,822 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:17:34,823 INFO  L93              Difference]: Finished difference Result 155655 states and 259133 transitions.
[2025-03-08 11:17:34,823 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 11:17:34,823 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 611
[2025-03-08 11:17:34,824 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:17:35,121 INFO  L225             Difference]: With dead ends: 155655
[2025-03-08 11:17:35,121 INFO  L226             Difference]: Without dead ends: 107797
[2025-03-08 11:17:35,194 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-08 11:17:35,194 INFO  L435           NwaCegarLoop]: 1180 mSDtfsCounter, 1745 mSDsluCounter, 1991 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1745 SdHoareTripleChecker+Valid, 3171 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 11:17:35,194 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1745 Valid, 3171 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 11:17:35,262 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 107797 states.
[2025-03-08 11:17:39,152 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 107797 to 107453.
[2025-03-08 11:17:39,251 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 107453 states, 91964 states have (on average 1.6206341611935104) internal successors, (149040), 92284 states have internal predecessors, (149040), 14720 states have call successors, (14720), 768 states have call predecessors, (14720), 768 states have return successors, (14720), 14400 states have call predecessors, (14720), 14720 states have call successors, (14720)
[2025-03-08 11:17:39,468 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 107453 states to 107453 states and 178480 transitions.
[2025-03-08 11:17:39,525 INFO  L78                 Accepts]: Start accepts. Automaton has 107453 states and 178480 transitions. Word has length 611
[2025-03-08 11:17:39,525 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:17:39,526 INFO  L471      AbstractCegarLoop]: Abstraction has 107453 states and 178480 transitions.
[2025-03-08 11:17:39,526 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91)
[2025-03-08 11:17:39,526 INFO  L276                IsEmpty]: Start isEmpty. Operand 107453 states and 178480 transitions.
[2025-03-08 11:17:39,566 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 612
[2025-03-08 11:17:39,566 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:17:39,566 INFO  L218           NwaCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:17:39,567 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-08 11:17:39,567 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:17:39,567 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:17:39,567 INFO  L85        PathProgramCache]: Analyzing trace with hash -1440008404, now seen corresponding path program 1 times
[2025-03-08 11:17:39,567 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:17:39,567 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877814289]
[2025-03-08 11:17:39,568 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:17:39,568 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:17:39,596 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 611 statements into 1 equivalence classes.
[2025-03-08 11:17:39,672 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 611 of 611 statements.
[2025-03-08 11:17:39,672 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:17:39,672 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:17:40,969 INFO  L134       CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16380 trivial. 0 not checked.
[2025-03-08 11:17:40,969 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:17:40,969 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877814289]
[2025-03-08 11:17:40,970 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877814289] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:17:40,970 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:17:40,970 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 11:17:40,970 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205161685]
[2025-03-08 11:17:40,970 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:17:40,970 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 11:17:40,970 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:17:40,972 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 11:17:40,972 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2025-03-08 11:17:40,972 INFO  L87              Difference]: Start difference. First operand 107453 states and 178480 transitions. Second operand  has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91)
[2025-03-08 11:17:46,771 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:17:46,772 INFO  L93              Difference]: Finished difference Result 303671 states and 502574 transitions.
[2025-03-08 11:17:46,775 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 11:17:46,775 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 1 states have call successors, (91), 1 states have call predecessors, (91), 1 states have return successors, (91), 1 states have call predecessors, (91), 1 states have call successors, (91) Word has length 611
[2025-03-08 11:17:46,775 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:17:47,634 INFO  L225             Difference]: With dead ends: 303671
[2025-03-08 11:17:47,634 INFO  L226             Difference]: Without dead ends: 196221
[2025-03-08 11:17:47,753 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90
[2025-03-08 11:17:47,754 INFO  L435           NwaCegarLoop]: 832 mSDtfsCounter, 2003 mSDsluCounter, 3135 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2003 SdHoareTripleChecker+Valid, 3967 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-08 11:17:47,754 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2003 Valid, 3967 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-08 11:17:47,859 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 196221 states.